Data Stream Clustering: A Survey

被引:347
作者
Silva, Jonathan A. [1 ]
Faria, Elaine R. [1 ,2 ]
Barros, Rodrigo C. [1 ]
Hruschka, Eduardo R. [1 ]
de Carvalho, Andre C. P. L. F. [1 ]
Gama, Joao [3 ,4 ]
机构
[1] Univ Sao Paulo, Inst Math & Comp Sci ICMC, Sao Paulo, Brazil
[2] Univ Fed Uberlandia, Sch Comp, BR-38400 Uberlandia, MG, Brazil
[3] Univ Porto, Lab Artificial Intelligence & Decis Support LIAAD, P-4100 Oporto, Portugal
[4] Univ Porto, FEP, P-4100 Oporto, Portugal
基金
巴西圣保罗研究基金会;
关键词
Algorithms; Data stream clustering; online clustering; ALGORITHM; FRAMEWORK; TREES; MODEL;
D O I
10.1145/2522968.2522981
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Data stream mining is an active research area that has recently emerged to discover knowledge from large amounts of continuously generated data. In this context, several data stream clustering algorithms have been proposed to perform unsupervised learning. Nevertheless, data stream clustering imposes several challenges to be addressed, such as dealing with nonstationary, unbounded data that arrive in an online fashion. The intrinsic nature of stream data requires the development of algorithms capable of performing fast and incremental processing of data objects, suitably addressing time and memory limitations. In this article, we present a survey of data stream clustering algorithms, providing a thorough discussion of the main design components of state-of-the-art algorithms. In addition, this work addresses the temporal aspects involved in data stream clustering, and presents an overview of the usually employed experimental methodologies. A number of references are provided that describe applications of data stream clustering in different domains, such as network intrusion detection, sensor networks, and stock market analysis. Information regarding software packages and data repositories are also available for helping researchers and practitioners. Finally, some important issues and open questions that can be subject of future research are discussed.
引用
收藏
页数:31
相关论文
共 109 条
[1]  
Ackermann M. R., 2012, Journal of Experimental Algorithmics (JEA), V17, DOI [DOI 10.1145/2133803.2184450, 10.1145/2133803.2184450]
[2]   Approximating extent measures of points [J].
Agarwal, PK ;
Har-Peled, S ;
Varadarajan, KR .
JOURNAL OF THE ACM, 2004, 51 (04) :606-635
[3]  
Aggarwal C. C., 2003, P 2003 ACM SIGMOD IN, P575, DOI DOI 10.1145/872757.872826
[4]  
Aggarwal CC, 2006, SIAM PROC S, P479
[5]   A segment-based framework for modeling and mining data streams [J].
Aggarwal, Charu C. .
KNOWLEDGE AND INFORMATION SYSTEMS, 2012, 30 (01) :1-29
[6]  
Aggarwal CC, 2008, PROC INT CONF DATA, P150, DOI 10.1109/ICDE.2008.4497423
[7]  
Aggarwal Charu C, 2007, Data Streams: Models and Algorithms, V31
[8]  
Agotnes T., 2010, 5 START AI RES S, V222, P212
[9]   On clustering large number of data streams [J].
Al Aghbari, Zaher ;
Kamel, Ibrahim ;
Awad, Thuraya .
INTELLIGENT DATA ANALYSIS, 2012, 16 (01) :69-91
[10]  
Amini A., 2011, 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2011), P1652, DOI 10.1109/FSKD.2011.6019867