A new algorithm for maintaining closed frequent itemsets in data streams by incremental updates

被引：0

作者：

Li, Hua-Fu ^{[1
]}

Ho, Chin-Chuan ^{[1
]}

Kuo, Fang-Fei ^{[1
]}

Lee, Suh-Yin ^{[1
]}

机构：

[1] Natl Chiao Tung Univ, Dept Comp Sci, Hsinchu 300, Taiwan

来源：

ICDM 2006: SIXTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, WORKSHOPS | 2006年

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Online mining of closed frequent itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we propose an efficient one-pass algorithm, NewMoment to maintain the set of closed frequent itemsets in data streams with a transaction-sensitive sliding window. An effective bit-sequence representation of items is used in the proposed algorithm to reduce the time and memory needed to slide the windows. Experiments show that the proposed algorithm not only attain highly accurate mining results, but also run significant faster and consume less memory than existing algorithm Moment for mining closed frequent itemsets over recent data streams.

引用

页码：672 / +

页数：2

共 20 条

[1] Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[2] Agrawal R, 1994, P 20 INT C VER LARG, V1215, P487
[3] [Anonymous], 2003, DATA MINING NEXT GEN
[4] Babcock B., 2002, Proceedings of the Twenty-First ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), P1, DOI DOI 10.1145/543613.543615
[5] Chang J., 2004, IEICE T INFORM SYSTE, VE87-D
[6] Chang RS, 2004, J INF SCI ENG, V20
[7] Moment: Maintaining closed frequent itemsets over a stream sliding window
Chi, Y
Wang, HX
Yu, PS
Muntz, RR
[J]. FOURTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2004, : 59 - 66
[8] Golab L, 2003, SIGMOD REC, V32, P5, DOI 10.1145/776985.776986
[9] HAN J, 2000, P 2000 ACM SIGMOD IN, P1, DOI DOI 10.1145/342009.335372
[10] JIANG N, 2006, ACM SIGMOD RECORD, V35

← 1 2 →