Data stream clustering: A survey

ACM Computing Surveys

Volumn 46, Issue 1, 2013, Pages

  Silva, Jonathan A ^a   Faria, Elaine R ^a   Barros, Rodrigo C ^a   Hruschka, Eduardo R ^a   De Carvalho, André C P L F ^a   Gama, Joaõ ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSITY OF PORTO   (Portugal)

Author keywords

Data stream clustering; Online clustering

Indexed keywords

DATA STREAM CLUSTERING; DATA STREAM MINING; EXPERIMENTAL METHODOLOGY; INCREMENTAL PROCESSING; NETWORK INTRUSION DETECTION; ONLINE-CLUSTERING; STATE-OF-THE-ART ALGORITHMS; STOCK MARKET ANALYSIS;

DATA COMMUNICATION SYSTEMS; INTRUSION DETECTION; RESEARCH; SENSOR NETWORKS; SURVEYS;

CLUSTERING ALGORITHMS;

EID: 84887425296     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/2522968.2522981     Document Type: Article

References (110)

1. ACKERMANN,M. R.,MARTENS,M.,RAUPACH, C.,SWIERKOT, K., LAMMERSEN, C., AND SOHLER, C. 2012. StreamKM++: A clustering algorithm for data streams. ACM J. Exper. Algor. 17, 1.
2. AGARWAL, P. K., HAR-PELED, S., AND VARADARAJAN, K. R. 2004a. Approximating extent measures of points. J. ACM 51, 4, 606-635.
3. AGGARWAL, C. C. 2003. A framework for diagnosing changes in evolving data streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD03). 575-586.
4. AGGARWAL, C. C. 2007. Data Streams-Models and Algorithms. Springer.
5. AGGARWAL, C. C. 2010. A segment-based framework for modeling and mining data streams. Knowl. Inf. Syst, 30, 1, 1-29.
6. AGGARWAL, C. C., HAN, J.,WANG, J., AND YU, P. S. 2003. A framework for clustering evolving data streams. In Proceedings of the 29th Conference on Very Large Data Bases (VLDB03). Vol. 29, 81-92.
7. AGGARWAL, C. C., HAN, J.,WANG, J., AND YU, P. S. 2004b. A framework for projected clustering of high dimensional data streams. In Proceedings of the 30th Conference on Very Large Data Bases (VLDB04). Vol. 30, 852-863.
8. AGGARWAL, C. C. AND YU, P. S. 2006. A framework for clustering massive text and categorical data streams. In Proceedings of the 6th International Conference on Data Mining (SDM06). 479.
9. AGGARWAL, C. C. AND YU, P. S. 2008. A framework for clustering uncertain data streams. In Proceedings of the 24th IEEE International Conference on Data Engineering (ICDE08). 150-159.
10. AGHBARI, Z. A., KAMEL, I., AND AWAD, T. 2012. On clustering large number of data streams. Intell. Data Anal. 16, 1, 69-91.
11. AMINI, A., WAH, T. Y., SAYBANI, M. R., AGHABOZORGI, S. R., AND YAZDI, S. 2011. A study of density-grid based clustering algorithms on data streams. In Proceedings of the 8th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD11). IEEE Press, Los Alamitos, CA, 1652-1656.
12. ARABIE, P. AND HUBERT, L. J. 1999. An Overview of Combinatorial Data Analysis. World Scientific Publishing.
13. ARTHUR, D. AND VASSILVITSKII, S. 2006. How slow is the k-means method In Proceedings of the 22nd Annual Symposium on Computational Geometry (SCG06). ACM Press, New York, 144-153.
14. ARTHUR, D. AND VASSILVITSKII, S. 2007. K-means++: The advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms. 1027-1035.
15. BABCOCK, B., BABU, S., DATAR, M., MOTWANI, R., AND WIDOM, J. 2002. Models and issues in data stream systems. In Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS02). ACM Press, New York, 1-16.
16. BABCOCK, B., DATAR, M., MOTWANI, R., AND OCALLAGHAN, L. 2003. Maintaining variance and k-medians over data stream windows. In Proceedings of the 22nd ACM SIGMOD-SIGACT SIGART Symposium on Principles of Database Systems. ACM Press, New York, 234-243.
17. BADOIU, M., HAR-PELED, S., AND INDYK, P. 2002. Approximate clustering via core-sets. In Proceedings of the 34th ACM Symposium on The ory of Computing (STOC02). ACM Press, New York, 250-257.
18. BALL, G. H. AND HALL, D. J. 1965. ISODATA. A novel method of data analysis and pattern classification. Tech. rep. Stanford Research Institute, Menlo Park.
19. BARBARA, D. 2002. Requirements for clustering data streams. SIGKDD Explorations 3, 23-27.
20. BENTLEY, J. L. 1975. Multidimensional binary search trees used for associative searching. Comm. ACM 18, 9, 509-517.
21. BENTLEY, J. L. AND SAXE, J. B. 1980. Decomposable searching problems I: Static-to-dynamic transformation. J. Algor. 1, 4, 301-358.
22. BALL, G. H. AND HALL, D. J. 1965. ISODATA. A novel method of data analysis and pattern classification. Tech. rep. Stanford Research Institute, Menlo Park.
23. BIFET, A. 2010. Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams. IOS Press.
24. BIFET, A., HOLMES, G., KIRKBY, R., AND PFAHRINGER, B. 2010. MOA: Massive online analysis. J. Mach. Learn. Res. 11, 1601-1604.
25. BRADLEY, P. S. AND FAYYAD, U. M. 1998a. Refining initial points for k-means clustering. In Proceedings of the 15th International Conference on Machine Learning (ICML98). Morgan Kaufmann Publishers, San Francisco, 91-99.
26. BRADLEY, P. S., FAYYAD, U. M., AND REINA, C. 1998b. Scaling clustering algorithms to large databases. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD98). AAAI Press, 9-15.
27. CAO, F., ESTER, M., QIAN, W., AND ZHOU, A. 2006. Density-based clustering over an evolving data stream with noise. In Proceedings of the 6th SIAM International Conference on Data Mining. 328-339.
28. CHARIKAR, M. AND GUHA, S. 1999. Improved combinatorial algorithms for the facility location and k-median problems. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science. 378-388.
29. CHARIKAR, M., OCALLAGHAN, L., AND PANIGRAHY, R. 2003. Better streaming algorithms for clustering problems. In Proceedings of the 35th Annual ACM Symposium on The ory of Computing. ACM Press, New York, 30-39.
30. CHEN, Y. AND TU, L. 2007. Density-based clustering for real-time stream data. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM Press, New York, 133-142.
31. CHO, K., JO, S., JANG, H., KIM, S. M., AND SONG, J. 2006. DCF: An efficient data stream clustering framework for streaming applications. In Proceedings of the 17th International Conference on Database and Expert Systems Applications (DEXA06). 114-122.
32. CSERNEL, B., CLEROT, F., AND HEBRAIL, G. 2006. Datastream clustering over tilted windows through sampling. In Proceedings of the Knowledge Discovery from Data Streams Workshop (ECML/PKDD).
33. DANG, X. H., LEE, V. C. S., NG, W. K., CIPTADI, A., AND ONG, K.-L. 2009. An em-based algorithm for clustering data streams in slidingwindows. In Proceedings of the 14th InternationalConference on Database Systems for Advanced Applications. Lecture Notes in Computer Science, vol. 5463, Springer, 230-235.
34. DOMINGOS, P. AND HULTEN, G. 2001. A general method for scaling up machine learning algorithms and its application to clustering. In Proceedings of the 8th International Conference on Machine Learning. Morgan Kaufmann Publishers, San Francisco, 106-113.
35. DUNHAM, M. H., MENGA, Y., AND HUANG, J. 2004. Extensible markov model. In Proceedings of the 4th IEEE International Conference on Data Mining (ICDM04). 371-374.
36. ESTER, M., KRIEGEL, H.-P., SANDER, J., AND XU, X. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining. 226-231.
37. RIBEIRO, E. F., BARROS, R. C., CARVALHO, A. C. P. L. F., AND GAMA, J. 2012. improving the offline clustering stage of data stream algorithms in scenarios with variable number of clusters. In Proceedings of the 27th ACM Symposium on Applied Computing (SAC12). 572-573.
38. FARNSTROM, F., LEWIS, J., AND ELKAN, C. 2000. Scalability for clustering algorithms revisited. SIGKDD Exploration Newslett. 2, 1, 51-57.
39. FAYYAD, U., PIATETSKY-SHAPIRO, G., AND SMYTH, P. 1996. From data mining to knowledge discovery: An overview. In Advances in Knowledge Discovery and Data Mining. American Association for Artificial Intelligence, Menlo Park, CA, 1-34.
40. FRANK, A. AND ASUNCION, A. 2010. UCI machine learning repository. http://archive.ics.uci.edu/ml.
41. GABER, M. M., VATSAVAI, R. R., OMITAOMU, O. A., GAMA, J., CHAWLA, N. V., AND GANGULY, A. R. 2010. Knowledge Discovery from Sensor Data. Springer.
42. GAMA, J. 2010. Knowledge Discovery from Data Streams. Chapman Hall/CRC.
43. GAMA, J. AND GABER, M. M. 2007. Learning from Data Streams: Processing Techniques in Sensor Networks. Springer.
44. GAMA, J.,MEDAS, P., CASTILLO, G., AND RODRIGUES, P. P. 2004. Learning with drift detection. In Proceedings of the 17th Brazilian Symposium on Artificial Intelligence (SBIA04). Vol. 3171., 286-295.
45. GAMA, J., PEREIRA, P. R., AND LOPES, L. 2011. Clustering distributed sensor data streams using local processing and reduced communication. Intell. Data Anal. 15, 1, 3-28.
46. GAMA, J. AND PINTO, C. 2006. Discretization from data streams: Applications to histograms and data mining. In Proceedings of the ACM Symposium on Applied Computing (SAC06). 662-667.
47. GAN, G.,MA, C., AND WU, J. 2007. Data Clustering: The ory, Algorithms, and Applications. ASA-SIAM Series on Statistics and Applied Probability.
48. SIAM. GAO, M.-M., LIU, J.-Z., AND GAO, X.-X. 2010. Application of compound gaussian mixture model clustering in the data stream. In Proceedings of the International Conference on Computer Application and System Modeling (ICCASM10).
49. GONZALEZ, T. F. 1985. Clustering to minimize the maximum intercluster distance. The or. Comput. Sci. 38, 293-306.
50. GUHA, S. 2009. Tight results for clustering and summarizing data streams. In Proceedings of the 12th International Conference on Database The ory (ICDT09). ACM Press, New York, 268-275.
51. GUHA, S.,MEYERSON, A.,MISHRA, N.,MOTWANI, R., AND OCALLAGHAN, L. 2003. Clustering data streams: The ory and practice. IEEE Trans. Knowl. Data Engin. 15, 515-528.
52. GUHA, S.,MISHRA, N.,MOTWANI, R., AND OCALLAGHAN, L. 2000. Clustering data streams. In Proceedings of the IEEE Symposium on Foundations of Computer Science. 359-366.
53. HAHSLER, M. AND DUNHAM, M. H. 2010. rEMM: Extensible markov model for data stream clustering in r. J. Statist. Softw. 35, 5, 1-31.
54. HAHSLER, M. AND DUNHAM, M. H. 2011. Temporal structure learning for clustering massive data streams in real-time. In Proceedings of the SIAM Conference on Data Mining. SIAM/Omnipress, 664-675.
55. HAN, J. AND KAMBER, M. 2000. Data Mining: Concepts and Techniques. Morgan Kaufmann.
56. HAR-PELED, S. AND MAZUMDAR, S. 2004. On coresets for k-means and k-median clustering. In Proceedings of the 36th Annual ACM Symposium on The ory of Computing. 291-300.
57. HULTEN, G. AND DOMINGOS, P. 2003. VFML-A toolkit for mining high-speed time-changing data streams. Tech. rep. University of Washington. http://www.cs.washington.edu/dm/vfml/.
58. ISAKSSON, C.,DUNHAM, M. H., AND HAHSLER, M. 2012. SOStream: Self organizing density-based clustering over data stream. In Proceedings of the 8th International Conference on Machine Learning and Data Mining in Pattern Recognition. Lecture Notes in Computer Science, vol. 7376, Springer, 264-278.
59. JAIN, A. K. 2009. Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31, 651-666.
60. JIANG, N. AND GRUENWALD, L. 2006. Research issues in data stream association rule mining. SIGMOD Rec. 35, 1, 14-19.
61. KAUFMAN, L. AND ROUSSEEUW, P. J. 1990. Finding Groups in Data: An Introduction to Cluster Analysis. Wiley Interscience.
62. KAVITHA, V. AND PUNITHAVALLI, M. 2010. Clustering time series data stream-A literature survey. Int. J. Comput. Sci. Inf. Secur. 8, 1, 289-294.
63. KHALILIAN, M. AND MUSTAPHA, N. 2010. Data stream clustering: challenges and issues. In Proceedings of International Multi Conference of Engineers and Computer Scientists. 566-569.
64. KOGAN, J. 2007. Introduction to Clustering Large and High-Dimensional Data. Cambridge University Press.
65. KONTAKI, M., PAPADOPOULOS, A. N., AND MANOLOPOULOS, Y. 2008. Continuous trend-based clustering in data streams. In Proceedings of the 10th International Conference on Data Warehousing and Knowledge Discovery. 251-262.
66. KRANEN, P.,ASSENT, I.,BALDAUF, C., AND SEIDL, T. 2011. The clustree: Indexing microclusters for anytime stream mining. Knowl. Inf. Syst. 29, 2, 249-272.
67. KREMER, H., KRANEN, P., JANSEN, T., SEIDL, T., BIFET, A., HOLMES, G., AND PFAHRINGER, B.. 2011. An effective evaluation measure for clustering on evolving data streams. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD11). ACM Press, New York, 868-876.
68. LI, Q.,MA, X., TANG, S., AND XIE, S. 2011. Continuously identifying representatives out of massive streams. In Proceedings of the 7th International Conference on Advanced Data Mining and Applications (ADMA11). Springer, 1-14.
69. LI, Y. AND TAN, B. H. 2011. Data stream clustering algorithm based on affinity propagation and density. Advanced Materials Res. 267, 444-449.
70. LIU, Y.-B., CAI, J.-R., YIN, J., AND FU, A. W.-C. 2008. Clustering text data streams. J. Comput. Sci. Technol. 23, 1, 112-128.
71. LLOYD, S. P. 1982. Least squares quantization in pcm. IEEE Trans. Inf. The ory 28, 2, 129-137.
72. LUHR, S. AND LAZARESCU, M. 2009. Incremental clustering of dynamic data streams using connectivity based representative points. Data Knowl. Engin. 68, 1-27.
73. MACQUEEN, J. B. 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley Symposium on Mathe matical Statistics and Probability. L. M. Le Cam and J. Neyman, Eds., Vol. 1., 281-297.
74. DE MAESSCHALCK, R., JOUAN-RIMBAUD, D., AND MASSART, D. L. 2000. The mahalanobis distance. Chemometrics Intell. Laboratory Syst. 50, 1-18.
75. MAHDIRAJI, A. R. 2009. Clustering data stream: A survey of algorithms. Int. J. Knowl.-Based Intell. Engin. Syst. 13, 2, 39-44.
76. MARKOV, A. 1971. Extension of the limit the orems of probability the ory to a sum of variables connected in a chain. In Dynamic Probabilistic Systems, Vol. 1, R. Howard, Ed., JohnWiley and Sons, Chapter Appendix B, 552-577.
77. METWALLY, A., AGRAWAL, D., AND ABBADI, A. E. L. 2005. Duplicate detection in click streams. In Proceedings of the 14th International Conference on World Wide Web. ACM Press, New York, 12-21.
78. MEYERSON, A. 2001. Online facility location. In Proceedings of the Annual IEEE Symposium on Foundations of Computer Science. 426-431.
79. MIERSWA, I.,WURST, M.,KLINKENBERG, R., SCHOLZ, M., AND EULER, T. 2006. YALE: Rapid prototyping for complex data mining tasks. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD06). L.
80. Ungar, M. Craven, D. Gunopulos, and T. Eliassi-Rad, Eds., ACM Press, New York, 935-940.
81. OCALLAGHAN, L., MISHRA, N., MEYERSON, A., GUHA, S., AND MOTWANI, R. 2002. Streaming data algorithms for high-quality clustering. In Proceedings of the 18th International Conference on Data Engineering. 85-694.
82. OLIVEIRA, M. AND GAMA, J. 2010. MEC-Monitoring clusters transitions. In Proceedings of the 5th Starting AI Researchers Symposium. IOS Press, 212-224.
83. ONG, K. L, LI, W., NG, W.-K., AND LIM, E.-P. 2004. SCLOPE: An algorithm for clustering data streams of categorical attributes. In Proceedings of the 6th International Conference on Data Warehousing and Knowledge Discovery (KDD04). 209-218.
84. OLIVEIRA, M. D. B. AND GAMA, J. 2012. A framework to monitor clusters evolution applied to economy and finance problems. Intell. Data Anal. 16, 1, 93-111.
85. OSTFELD, A.,UBER, J. G., SALOMONS, E., ET AL. 2008. The battle of the water sensor networks (BWSN): A design challenge for engineers and algorithms. J. Water Resources Plan. Manag. 134, 556.
86. PARK, N. H. AND SUK LEE,W. 2007. Cell trees: An adaptive synopsis structure for clustering multidimensional on-line data streams. Data Knowl. Engin. 63, 2, 528-549.
87. REN, J. AND MA, R. 2009. Density-based data streams clustering over sliding windows. In Proceedings of the 6th International Conference on Fuzzy Systems and Knowledge Discovery. Vol. 5. 248-252.
88. RODRIGUES, P., GAMA, J., AND PEDROSO, J. P. 2006. ODAC: Hierarchical clustering of time series data streams. In Proceedings of the 6th SIAM International Conference on Data Mining. 499-503.
89. RODRIGUES, P. P., GAMA, J., AND PEDROSO, J. P. 2008. Hierarchical clustering of time-series data streams. IEEE Trans. Knowl. Data Engin. 20, 5, 615-627.
90. SERIR, L.,RAMASSO, E., AND ZERHOUNI, N. 2012. Evidential evolving gustafson-kessel algorithm for online data streams partitioning using belief function the ory. Int. J. Approximate Reason. 53, 5, 1-22.
91. SHAH, R., KRISHNASWAMY, S., AND GABER, M. M. 2005. Resource-aware very fast k-means for ubiquitous data stream mining. In Proceedings of the 2nd International Workshop on Knowledge Discovery in Data Streams, Held in Conjunction with the 16th European Conference on Machine Learning (ECML05).
92. SILVA, A.,CHIKY, R., ANDHEBRAIL,G. 2011. A clustering approach for sampling data streams in sensor networks. Knowl. Inf. Syst. 32, 1, 1-23.
93. SILVA, J. A. AND HRUSCHKA, E. R. 2011. Extending k-means-based algorithms for evolving data streams with variable number of clusters. In Proceedings of the 4th International Conference on Machine Learning and Applications (ICMLA11). Vol. 2. 14-19.
94. SPILIOPOULOU, M.,NTOUTSI, I., THE ODORIDIS, Y., AND SCHULT, R. 2006. MONIC: Modeling and monitoring cluster transitions. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD06). ACM Press, New York, 706-711.
95. STEINHAUS, H. 1956. Sur la division des corp materiels en parties. Bull. Acad. Polon. Sci 1, 801-804.
96. TASOULIS, D. K.,ADAMS, N.M., ANDHAND,D. J. 2006. Unsupervised clustering in streaming data. In Proceedings of the 6th IEEE International Conference on Data Mining-Workshops (ICDM06). 638-642.
97. TAVALLAEE, M., BAGHERI, E., LU, W., AND GHORBANI, A. A. 2009. A detailed analysis of the kdd cup 99 data set. In Proceedings of the 2nd IEEE International Conference on Computational Intelligence for Security and Defense Applications. 53-58.
98. VATTANI, A. 2009. K-means requires exponentially many iterations even in the plane. In Proceedings of the 25th Annual Symposium on Computational Geometry (SCG09). ACM Press, New York, 324-332.
99. WAN, R.,YAN, X., AND SU, X. 2008. A weighted fuzzy clustering algorithm for data stream. In Proceedings of the ISECS International Colloquium on Computing, Communication, Control, and Management. 360-364.
100. WU, X., KUMAR, V., QUINLAN, J. R, GHOSH, J., YANG, Q., MOTODA, H., MCLACHLAN, G. J., NG, A., LIU, B., YU, P. S., ZHOU, Z.-H., STEINBACH, M., HAND, D. J., AND STEINBERG, D. 2007. Top 10 algorithms in data mining. Knowl. Inf. Syst. 14, 1-37.
101. XU, R. AND WUNSCH, D. 2009. Clustering. Computational Intelligence Series, Wiley-IEEE Press.
102. YANG , C. AND ZHOU, J. 2006. HClustream: A novel approach for clustering evolving heterogeneous data stream. In Proceedings of the 6th IEEE International Conference on Data Mining. 682-688.
103. ZHANG, T., RAMAKRISHNAN, R. AND 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. ACM Press, New York, 103-114.
104. ZHANG, T.,RAMAKRISHNAN, R., AND LIVNY,M. 1997. BIRCH: A new data clustering algorithm and its applications. Data Mining Knowl. Discov. 1, 2, 141-182.
105. ZHANG, X., SEBAG, M., AND GERMAIN-RENAUD, C. 2009. Multi-scale real-time grid monitoring with job stream mining. In Proceedings of the 9th IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID09). 420-427.
106. ZHANG, X. AND WANG, W. 2010. Self-adaptive change detection in streaming data with nonstationary distribution. In Advanced Data Mining and Applications. Springer, 1-12.
107. ZHANG, X., ZHOU, X., AND HU, X. 2006. Semantic smoothing for model-based document clustering. In Proceedings of the 6th International Conference on Data Mining (ICDM06). 1193-1198.
108. ZHOU, A., CAO, F.,QIAN, W., AND JIN, C. 2008. Tracking clusters in evolving data streams over sliding windows. Knowl. Inf. Syst. 15, 2, 181-214.
109. ZHU, H.,WANG, Y., AND YU, Z. 2010. Clustering of evolving data stream with multiple adaptive sliding window. In Proceedings of the International Conference on Data Storage and Data Engineering (DSDE10). 95-100.
110. ZHU, Y. AND SHASHA, D. 2002. StatStream: Statistical monitoring of thousands of data streams in real time. In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB02). VLBD Endowment, 358-369.