Abstract
Clustering is one of the most popular data mining techniques. In this article, we review the relevant methods and algorithms for designing cluster algorithms under the data streams computational model and discuss research directions in tracking evolving clusters.
This is a preview of subscription content, log in via an institution to check access.
References
Ackermann MR, Martens M, Raupach C, Swierkot K, Lammersen C, Sohler C (2012) StreamKM++: a clustering algorithm for data streams. ACM J Exp Algorithm 17(1):173–187
Aggarwal CC, Han J, Wang J, Yu PS (2003) A framework for clustering evolving data streams. In: Proceedings of the 29th International Conference on Very Large Data Bases. VLDB Endowment, pp 81–92
Cao F, Ester M, Qian W, Zhou A (2006) Density-based clustering over an evolving data stream with noise. In: Ghosh J, Lambert D, Skillicorn DB, Srivastava J (eds) Proceedings of the Sixth SIAM International Conference on Data Mining, 20–22 Apr, 2006. Bethesda, MD, USA. SIAM, pp 328–339
Domingos P, Hulten G (2001) A general method for scaling up machine learning algorithms and its application to clustering. In: Machine Learning, Proceedings of the 18th International Conference, Williamstown, USA. Morgan Kaufmann, pp 106–113
Farnstrom F, Lewis J, Elkan C (2000) Scalability for clustering algorithms revisited. SIGKDD Explorations 2(1):51–57
Gama J (2010) Knowledge discovery from data streams. Chapman and Hall/CRC Data Mining and Knowledge Discovery Series. CRC Press, Boca Raton
Gama J, Rodrigues PP, Lopes LMB (2011) Clustering distributed sensor data streams using local processing and reduced communication. Intell Data Anal 15(1):3–28
Guha S, Meyerson A, Mishra N, Motwani R, O’Callaghan L (2003) Clustering data streams: theory and practice. IEEE Trans Knowl Data Eng 15(3):515–528
Kranen P, Assent I, Baldauf C, Seidl T (2011) The clusTree: indexing micro-clusters for anytime stream mining. Knowl. Inf. Syst. 29(2):249–272
MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Oakland, CA. University of Berkeley, pp 281–297
Sander J, Ester M, Kriegel H, Xu X (1998) Density-based clustering in spatial databases: the algorithm GDBSCAN and its applications. Data Min. Knowl. Discov. 2(2):169–194
Silva JA, Faria ER, Barros RC, Hruschka ER, de Leon Ferreira de Carvalho ACP, Gama J (2013) Data stream clustering: a survey. ACM Comput. Surv. 46(1):13:1–13:31
Spiliopoulou M, Ntoutsi I, Theodoridis Y, Schult R (2006) Monic: modeling and monitoring cluster transitions. In: Proceedings ACM International Conference on Knowledge Discovery and Data Mining, Philadelphia, USA. ACM Press, pp 706–711
Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering method for very large databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Montreal, Canada. ACM Press, pp 103–114
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Gama, J. (2024). Clustering from Data Streams. In: Phung, D., Webb, G.I., Sammut, C. (eds) Encyclopedia of Machine Learning and Data Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7502-7_41-2
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7502-7_41-2
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4899-7502-7
Online ISBN: 978-1-4899-7502-7
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering
Publish with us
Chapter history
-
Latest
Clustering from Data Streams- Published:
- 06 April 2024
DOI: https://doi.org/10.1007/978-1-4899-7502-7_41-2
-
Original
Clustering from Data Streams- Published:
- 28 July 2016
DOI: https://doi.org/10.1007/978-1-4899-7502-7_41-1