The DOI matches its Crossref record; 78 of the 78 references it cites were found in a registry or an index.
Data stream clustering: A survey
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
(1967) · Cited by 23,719
(1996) · Cited by 20,179
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Data clustering: 50 years beyond K-means
Jain, A. K. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.09.011 · Cited by 9,368
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
Proceedings of the 25th international conference on Machine learning - ICML '08
(2008) · doi:10.1145/1390156 · Cited by 6,680
Top 10 algorithms in data mining
Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667
A detailed analysis of the KDD CUP 99 data set
Tavallaee, M., Bagheri, E., Lu, W., & Ghorbani, A. A. (2009) · 2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications · doi:10.1109/cisda.2009.5356528 · Cited by 5,396
Model-Based Clustering, Discriminant Analysis, and Density Estimation
Fraley, C., & Raftery, A. E. (2002) · Journal of the American Statistical Association · doi:10.1198/016214502760047131 · Cited by 4,257
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
Models and issues in data stream systems
Babcock, B., Babu, S., Datar, M., Motwani, R., & Widom, J. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543615 · Cited by 2,495
From data mining to knowledge discovery: an overview
Fayyad, U. M., Piatetsky-Shapiro, G., & Smyth, P. (1996) · Knowledge Discovery and Data Mining · Cited by 2,395
De Maesschalck, R., Jouan-Rimbaud, D., & Massart, D. L. (2000) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(99)00047-7 · Cited by 2,325
Storing and querying ordered XML using a relational database system
Tatarinov, I., Viglas, S. D., Beyer, K., Shanmugasundaram, J., Shekita, E., & Zhang, C. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564715 · Cited by 2,235
A Framework for Clustering Evolving Data Streams
Aggarwal, C. C., Yu, P. S., Han, J., & Wang, J. (2003) · Proceedings 2003 VLDB Conference · doi:10.1016/b978-012722442-8/50016-1 · Cited by 1,808
Clustering to minimize the maximum intercluster distance
Gonzalez, T. F. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90224-5 · Cited by 1,717
Data Clustering: Theory, Algorithms, and Applications
Gan, G., Ma, C., & Wu, J. (2007) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718348 · Cited by 1,562
Gama, J., Medas, P., Castillo, G., & Rodrigues, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28645-5_29 · Cited by 1,536
Self-citationConcept Decompositions for Large Sparse Text Data Using Clustering
Dhillon, I. S., & Modha, D. S. (2001) · Machine Learning · doi:10.1023/a:1007612920971 · Cited by 1,293
Mining concept-drifting data streams using ensemble classifiers
Wang, H., Fan, W., Yu, P. S., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956778 · Cited by 1,256
Proceedings 35th Annual Symposium on Foundations of Computer Science
(1994) · doi:10.1109/sfcs.1994 · Cited by 1,087
Refining Initial Points for K-Means Clustering
Bradley, P. S., & Fayyad, U. M. (1998) · Cited by 1,031
Density-Based Clustering over an Evolving Data Stream with Noise
Cao, F., Estert, M., Qian, W., & Zhou, A. (2006) · Proceedings of the 2006 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972764.29 · Cited by 1,016
YALE: rapid prototyping for complex data mining tasks
Mierswa, I., Wurst, M., Klinkenberg, R., Scholz, M., & Euler, T. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150531 · Cited by 1,010
ISODATA, A NOVEL METHOD OF DATA ANALYSIS AND PATTERN CLASSIFICATION
Ball, G. H., & Hall, D. J. (1965) · Defense Technical Information Center (DTIC) · Cited by 919
Iosifescu, M., & Howard, R. A. (1972) · International Statistical Review · doi:10.2307/1402771 · Cited by 897
BIRCH: A New Data Clustering Algorithm and Its Applications
Zhang, T., Ramakrishnan, R., & Livny, M. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009783824328 · Cited by 888
Clustering data streams: theory and practice
Guha, S., Meyerson, A., Mishra, N., Motwani, R., & O'Callaghan, L. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1198387 · Cited by 882
BifetAlbert, HolmesGeoff, KirkbyRichard, & PfahringerBernhard (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1859903 · Cited by 771
Scaling clustering algorithms to large databases
Bradley, P., Fayyad, U. M., & Reina, C. (1998) · Cited by 716
Zhu, Y., & Shasha, D. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50039-1 · Cited by 656
Guha, S., Mishra, N., Motwani, R., & O'Callaghan, L. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892124 · Cited by 623
Streaming-data algorithms for high-quality clustering
O'Callaghan, L., Mishra, N., Meyerson, A., Guha, S., & Motwani, R. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994785 · Cited by 577
Density-based clustering for real-time stream data
Chen, Y., & Tu, L. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281210 · Cited by 572
Knowledge Discovery in Data Streams
(2009) · Encyclopedia of Library and Information Sciences, Third Edition · doi:10.1081/e-elis3-120043643 · Cited by 551
On coresets for k-means and k-median clustering
Har-Peled, S., & Mazumdar, S. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007400 · Cited by 527
A Framework for Projected Clustering of High Dimensional Data Streams
Aggarwal, C. C., Han, J., Wang, J., & Yu, P. S. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50075-9 · Cited by 519
Density-Connected Subspace Clustering for High-Dimensional Data
Kailing, K., Kriegel, H., & Kröger, P. (2004) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.23 · Cited by 384
Dimensionality reduction based on rough set theory: A review
Thangavel, K., & Pethalakshmi, A. (2009) · Applied Soft Computing · doi:10.1016/j.asoc.2008.05.006 · Cited by 363
How slow is the k -means method?
Arthur, D., & Vassilvitskii, S. (2006) · Proceedings of the twenty-second annual symposium on Computational geometry · doi:10.1145/1137856.1137880 · Cited by 304
StreamKM++: A clustering algorithm for data streams
Ackermann, M. R., Märtens, M., Raupach, C., Swierkot, K., Lammersen, C., & Sohler, C. (2012) · ACM Journal of Experimental Algorithmics · doi:10.1145/2133803.2184450 · Cited by 294
Research issues in data stream association rule mining
Jiang, N., & Gruenwald, L. (2006) · ACM SIGMOD Record · doi:10.1145/1121995.1121998 · Cited by 287
(2007) · Advances in Database Systems · doi:10.1007/978-0-387-47534-9 · Cited by 282
Meyerson, A. (2001) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959917 · Cited by 262
Hierarchical Clustering of Time-Series Data Streams
Rodrigues, P. P., Gama, J., & Pedroso, J. P. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190727 · Cited by 260
Self-citationGan, G., Ma, C., & Wu, J. (2007) · Society for Industrial and Applied Mathematics eBooks · Cited by 257
Proceedings of the 10th IEEE International Conference on Data Mining (ICDM)
Webb, G. I., Liu, B., Zhang, C., Gunopulos, D., & Wu, X. (2010) · Cited by 247
da Gama, J. M. P., & Gaber, M. M. (2007) · Springer eBooks · doi:10.1007/3-540-73679-4 · Cited by 235
Self-citationBetter streaming algorithms for clustering problems
Charikar, M., O'Callaghan, L., & Panigrahy, R. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780548 · Cited by 230
Chapman & Hall/CRC Data Mining and Knowledge Discovery Series
(2010) · Chapman & Hall/CRC data mining and knowledge discovery series · doi:10.1201/chdaminodis · Cited by 201
Iterative Optimization and Simplification of Hierarchical Clusterings
Fisher, D. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.276 · Cited by 195
k-means requires exponentially many iterations even in the plane
Vattani, A. (2009) · Proceedings of the twenty-fifth annual symposium on Computational geometry · doi:10.1145/1542362.1542419 · Cited by 186
A Framework for Clustering Uncertain Data Streams
Aggarwal, C. C., & Yu, P. S. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497423 · Cited by 186
Data Streams: Models and Algorithms (Advances in Database Systems)
Aggarwal, C. C. (2006) · Springer eBooks · Cited by 177
(2006) · Cited by 172
Introduction to Clustering Large and High-Dimensional Data
McAleavy, T. (2006) · Cited by 162
Requirements for clustering data streams
Barbará, D. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/507515.507519 · Cited by 156
AN OVERVIEW OF COMBINATORIAL DATA ANALYSIS
Arabie, P., & Hubert, L. J. (1996) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812832153_0002 · Cited by 122
Banerjee, A., & Ghosh, J. (2004) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.824416 · Cited by 110
Knowledge discovery from data streams
da Gama, J. M. P., Ganguly, A. R., Omitaomu, O. A., Vatsavai, R. R., & Gaber, M. M. (2009) · Intelligent Data Analysis · doi:10.3233/ida-2009-0372 · Cited by 110
Self-citationAn effective evaluation measure for clustering on evolving data streams
Kremer, H., Kranen, P., Jansen, T., Seidl, T., Bifet, A., Holmes, G., & Pfahringer, B. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020555 · Cited by 99
Discretization from data streams
da Gama, J. M. P., & Pinto, C. (2006) · ACM Symposium on Applied Computing · doi:10.1145/1141277.1141429 · Cited by 95
Self-citationIncremental clustering of dynamic data streams using connectivity based representative points
Lühr, S., & Lazarescu, M. (2008) · Data & Knowledge Engineering · doi:10.1016/j.datak.2008.08.006 · Cited by 91
A study of density-grid based clustering algorithms on data streams
Amini, A., Wah, T. Y., Saybani, M. R., & Aghabozorgi, S. R. (2011) · International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) · doi:10.1109/fskd.2011.6019867 · Cited by 87
Efficient Clustering-Based Outlier Detection Algorithm for Dynamic Data Stream
Elahi, M., Li, K., Nisar, W., Lv, X., & Wang, H. (2008) · International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) · doi:10.1109/fskd.2008.374 · Cited by 86
Clustering Time Series Data Stream - A Literature SurveyPreprint
Kavitha, V., & Punithavalli, M. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1005.4270 · Cited by 73
SOStream: Self Organizing Density-Based Clustering over Data Stream
Isaksson, C., Dunham, M. H., & Hahsler, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31537-4_21 · Cited by 63
Dunham, M. H., Yu, M., & Huang, J. (2005) · Proceedings · doi:10.1109/icdm.2004.10067 · Cited by 35
Cell trees: An adaptive synopsis structure for clustering multi-dimensional on-line data streams
Park, N. H., & Lee, W. S. (2007) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.04.003 · Cited by 32
A clustering approach for sampling data streams in sensor networks
Silva, A. D., Chiky, R., & Hébrail, G. (2011) · Knowledge and Information Systems · doi:10.1007/s10115-011-0448-7 · Cited by 32
Semantic Smoothing for Model-based Document Clustering
Zhang, X., Zhou, X., & Hu, X. (2006) · Proceedings · doi:10.1109/icdm.2006.142 · Cited by 25
rEMM: Extensible Markov Model for Data Stream Clustering inR
Hahsler, M., & Dunham, M. H. (2010) · Journal of Statistical Software · doi:10.18637/jss.v035.i05 · Cited by 24
Temporal Structure Learning for Clustering Massive Data Streams in Real-Time
Hahsler, M., & Dunham, M. H. (2011) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.57 · Cited by 14
(2008) · doi:10.1061/(asce)0733-9496(2008)134:6(556
Cited by
A Comprehensive Survey of Clustering Algorithms
Xu, D., & Tian, Y. (2015) · Annals of Data Science · doi:10.1007/s40745-015-0040-1 · Cited by 1,939
“For more detailed information about this kind of clustering algorithms, you can refer to [128–131], D-Stream [41,132].”
Learning under Concept Drift: A Review
Lu, J., Liu, A., Dong, F., Gu, F., Gama, J., & Zhang, G. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2876857 · Cited by 1,603
Self-citationA Review on Outlier/Anomaly Detection in Time Series Data
Blázquez-García, A., Conde, A., Mori, U., & Lozano, J. A. (2022) · ACM Computing Surveys · doi:10.1145/3444690 · Cited by 1,102
Ezugwu, A. E., Ikotun, A. M., Oyelade, O. O., Abualigah, L., Agushaka, J. O., Eke, C. I., & Akinyelu, A. A. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.104743 · Cited by 924
A Survey on Ensemble Learning for Data Stream Classification
Gomes, H. M., Barddal, J. P., Enembreck, F., & Bifet, A. (2018) · ACM Computing Surveys · doi:10.1145/3054925 · Cited by 579
Metadata
- Authors
- Silva, J. A., Faria, E. R., Barros, R. C., Hruschka, E. R., Carvalho, A. C. P. L. F. D., & Gama, J.
- Venue
- ACM Computing Surveys
- Published
- 2013-07-11
- Volume
- 46
- Issue
- 1
- Pages
- 1-31
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2088340225
- Cited by
- 508
- References
- 78
- FWCI
- 35.71
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.