Association Rules Mining over Data Streams: Review

被引：0

作者：

Tan, Jun ^{[1
]}

机构：

[1] Cent South Univ Forestry & Technol, Coll Comp & Informat Engn, Changsha, Hunan, Peoples R China

来源：

ADVANCES IN CIVIL ENGINEERING II, PTS 1-4 | 2013年 / 256-259卷

关键词：

data streams; association rules; frequent patterns; data model; FREQUENT ITEMSETS;

D O I：

10.4028/www.scientific.net/AMM.256-259.2890

中图分类号：

TU [建筑科学];

学科分类号：

0813 ;

摘要：

Data streams are continuous, unbounded and coming with high speed which put forward a strong challenge against traditional association rules mining algorithms. In this paper, we give a comprehensive summary on association rules mining algorithm from three side including single-pass scanning algorithm, data processing model, memory optimization. At last, we discuss the main problems and future research directions.

引用

页码：2890 / 2893

页数：4

共 20 条

[1]

Agrawal R., P 20 INT C VERY LARG

[2]

Bifet A., 2008, Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining, P34, DOI DOI 10.1145/1401890.1401900

[3]

Chang J.H., 2003, P 9 ACM SIGKDD INT C, P487, DOI DOI 10.1145/956750.956807

[4]

Chang JH, 2004, J INF SCI ENG, V20, P753

[5]

CHANG JH, 2003, P 2003 ACM CIKM INT, P536

[6] Maintaining frequent closed itemsets over a sliding window [J].

Cheng, James ;

Ke, Yiping ;

Ng, Wilfred .

JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2008, 31 (03) :191-215

[7] Moment: Maintaining closed frequent itemsets over a stream sliding window [J].

Chi, Y ;

Wang, HX ;

Yu, PS ;

Muntz, RR .

FOURTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2004, :59-66

[8]

Giannella C, 2002, ACM SIGMOD INT C MAN, P635

[9]

Han Jiawei, 2002, DATA MINING CONCEPTS, P56

[10]

Han JW, 2000, SIGMOD RECORD, V29, P1

← 1 2 →