An Algorithm to Approximately Mine Frequent Closed Itemsets from Data Streams

LIU Xu; MAO Guo-Jun; SUN Yue; LIU Chun-Nian

您当前的位置：

首页 >

文章列表页 >

An Algorithm to Approximately Mine Frequent Closed Itemsets from Data Streams

更新时间：2025-07-16

- An Algorithm to Approximately Mine Frequent Closed Itemsets from Data Streams
- Acta Electronica Sinica Vol. 35, Issue 5, Pages: 900-905(2007)
- 作者机构：
  
  北京工业大学计算机学院,北京市多媒体与智能软件重点实验室,北京,100022
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP311
- Published：2007
- 稿件说明：
移动端阅览
LIU Xu, MAO Guo-Jun, SUN Yue, et al. An Algorithm to Approximately Mine Frequent Closed Itemsets from Data Streams[J]. Acta Electronica Sinica, 2007, 35(5): 900-905.
DOI：

LIU Xu, MAO Guo-Jun, SUN Yue, et al. An Algorithm to Approximately Mine Frequent Closed Itemsets from Data Streams[J]. Acta Electronica Sinica, 2007, 35(5): 900-905. DOI：

摘要

在数据流中挖掘频繁项集得到了广泛的研究

传统的研究方法大多关注于在数据流中挖掘全部频繁项集.由于挖掘全部频繁项集存在数据和模式冗余问题

所以对算法的时间和空间效率都具有更大的挑战性.因此

近年来人们开始关注在数据流中挖掘频繁闭项集

其中一个典型的工作就是Moment算法.本文提出了一种数据流中频繁闭项集的近似挖掘算法A-Moment.它采用衰减窗口机制、近似计数估计方法和分布式更新信息策略来解决Moment算法中过度依赖于窗口和执行效率低等问题.实验表明

该算法在保证挖掘精度的前提下

可以比Moment获得更好的效率.

Abstract

Mining frequent itemsets from data streams has extensively been studied

and most of them focus on finding complete set of frequent itemsets in a data stream.Because of numerous redundant data and patterns in main memory

they cannot get very good performance in time and space.Therefore

mining frequent closed itemsets in data streams becomes a new important problem in recent years

where algorithm Moment was regarded as a typical method of them.This paper presents an algorithm

called A-Moment

which uses the damped window technique

approximate count method and distributed updating strategy to get higher mining efficiency.Experimental results show that our algorithm performs much better than the previous approaches.

关键词

Keywords

references

Views

676

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

An Incremental Density-Based Clustering Algorithm for Concept Drift Detection and Adaption over Data Stream

Improved Adaptive Model Pools for Online Anomaly Detection Algorithms

Hub Gene Discovery of Cancer Traits Based on Network Embedding

Network Embedding Based on Nested Generative Adversarial Networks

Privacy Protection Method for K-modes Clustering Data with Local Differential Privacy

Related Author

LU Hao-yang

FAN Yu-lei

GAO Nan

YANG Liang-huai

XIANG Qiu-yan

ZI Ling-ling

CONG Xin

CHU Yan

Related Institution

College of Computer Science and Technology, Zhejiang University of Technology

College of Computer and Information Science， Chongqing Normal University

College of Computer Science and Technology， Harbin Engineering University

School of Computer Science and Technology， Heilongjiang University

College of Underwater Acoustic Engineering， Harbin Engineering University

⁰