Data stream clustering with affinity propagation

IEEE Transactions on Knowledge and Data Engineering

Volumn 26, Issue 7, 2014, Pages 1644-1656

  Zhang, Xiangliang ^a   Furtlehner, Cyril ^b   Germain Renaud, Cecile ^b   Sebag, Michele ^b  

^a KING ABDULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Saudi Arabia)

^b INRIA   (France)

Author keywords

affinity propagation; autonomic computing; grid monitoring; Streaming data clustering

Indexed keywords

BENCHMARKING; DATA COMMUNICATION SYSTEMS; DATA FLOW ANALYSIS; DATA TRANSFER;

AFFINITY PROPAGATION; AUTONOMIC COMPUTING; CHANGE POINT DETECTION; DATA STREAM CLUSTERING; DYNAMIC DISTRIBUTION; EVOLVING PATTERNS; GRID MONITORING; STREAMING DATA;

CLUSTERING ALGORITHMS;

EID: 84904433383     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2013.146     Document Type: Article

References (42)

1. J. Gama and M. M. Gaber, Learning from Data Streams: Processing Techniques in Sensor Networks, Guildford, U.K.: Springer, Dec. 2007.
2. C. Aggarwal, Data Streams: Models and Algorithms. Berlin, Germany: Springer, 2007.
3. G. Cormode, S. Muthukrishnan, and W. Zhuang, "Conquering the divide: Continuous clustering of distributed data streams, " in Proc. IEEE 23rd ICDE, Istanbul, Turkey, 2007, pp. 1036-1045. (Pubitemid 47422107)
4. S. Guha, A. Meyerson, N. Mishra, R. Motwani, and L. O'Callaghan, "Clustering data streams: Theory and practice, " IEEE Trans. Knowl. Data Eng., vol. 15, no. 3, pp. 515-528, May/Jun. 2003.
5. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan, "Clustering data streams, " in Proc. IEEE Symp. Found. Comput. Sci., 2000, pp. 359-366. (Pubitemid 32075905)
6. C. Aggarwal, J. Han, J. Wang, and P. S. Yu, "A framework for clustering evolving data streams, " in Proc. 29th Int. Conf. VLDB, Berlin, Germany, 2003, pp. 81-92.
7. M. R. Ackermann et al., "StreamKM++: A clustering algorithm for data streams, " CM J. Exp. Algorithmics, vol. 17, no. 1, pp. 2.4:2.1-2.4:2.30, May 2012.
8. M. Shindler, A. Wong, and A. Meyerson, "Fast and accurate Kmeans for large datasets, " in Proc. NIPS, 2011, pp. 2375-2383.
9. F. Cao, M. Ester, W. Qian, and A. Zhou, "Density-based clustering over an evolving data stream with noise, " in Proc. SDM, 2006, pp. 326-337.
10. Y. Chen and L. Tu, "Density-based clustering for real-time stream data, " in Proc. 13th ACM SIGKDD, New York, NY, USA, 2007, pp. 133-142. (Pubitemid 350229200)
11. IBM. (2001). IBM manifesto for Autonomic Computing [Online]. Available: http://www.research.ibm.com/autonomic/
12. I. Rish et al., "Adaptive diagnosis in distributed systems, " IEEE Trans. Neural Netw. (special issue on Adaptive Learning Systems in Communication Networks), vol. 16, no. 5, pp. 1088-1109, Sept. 2005. (Pubitemid 41444614)
13. J. O. Kephart and D. M. Chess, "The vision of autonomi
14. B. J. Frey and D. Dueck, "Clustering by passing messages between data points, " Science, vol. 315, no. 5814, pp. 972-976, 2007. (Pubitemid 46281181)
15. X. Zhang, C. Furtlehner, and M. Sebag, "Data streaming with affinity propagation, " in Proc. ECML/PKDD, 2008, pp. 628-643.
16. X. Zhang, C. Furtlehner, J. Perez, C. Germain-Renaud, and M. Sebag, "Toward autonomic grids: Analyzing the job flow with affinity streaming, " in Proc. 15th ACM SIGKDD, Paris, France, 2009.
17. E. Page, "Continuous inspection schemes, " Biometrika, vol. 41, no. 1/2, pp. 100-115, 1954.
18. D. Hinkley, "Inference about the change-point from cumulative sum tests, " Biometrika, vol. 58, no. 3, pp. 509-523, 1971.
19. J. Ma, L. K. Saul, S. Savage, and G. M. Voelker, "Identifying suspicious URLs: An application of large-scale online learning, " in Proc. 26th ICML, Montreal, QC, Canada, 2009, pp. 681-688.
20. W. Fan, H. Wang, and P. S. Yu, "Active mining of data streams, " in Proc. SDM, 2004.
21. S. M. Muthukrishnan, Data Streams: Algorithms and Applications (Foundations and trends in theoretical computer science), vol. 1. Hanover, MA, USA: Now, 2005, pp. 117-236.
22. S. Nittel, K. T. Leung, and A. Braverman, "Scaling clustering algorithms for massive data sets using data streams, " in Proc. 20th ICDE, 2004, p. 830.
23. P. S. Bradley, U. M. Fayyad, and C. Reina, "Scaling clustering algorithms to large databases, " in Proc. 4th Int. Conf. KDD, 1998, pp. 9-15.
24. T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: An efficient data clustering method for very large databases, " in Proc. SIGMOD, Montreal, QC, Canada, 1996, pp. 103-114. (Pubitemid 126440760)
25. G. Dong et al., "Online mining of changes from data streams: Research problems and preliminary results, " in Proc. ACM SIGMOD, San Diego, CA, USA, 2003.
26. B.-R. Dai, J.-W. Huang, M.-Y. Yeh, and M.-S. Chen, "Adaptive clustering for multiple evolving streams, " IEEE Trans. Knowl. Data Eng., vol. 18, no. 9, pp. 1166-1180, Sept. 2006. (Pubitemid 44192185)
27. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, "A density-based algorithm for discovering clusters in large spatial databases with noise, " in Proc. SIGKDD, 1996, pp. 226-231.
28. M. M. Masud, J. Gao, L. Khan, J. Han, and B. Thuraisingham, "Classification and novel class detection in concept-drifting data streams under time constraints, " IEEE Trans. Knowl. Data Eng., vol. 23, no. 6, pp. 859-874, Jun. 2011.
29. Z. Harchaoui, "Kernel methods for detection (méthodes à noyaux pour la détection), " Ph.D. dissertation, TELECOM ParisTech, Paris, France, 2008.
30. Z. Harchaoui, F. Bach, and E. Moulines, "Kernel change-point analysis, " in Proc. NIPS, 2009, pp. 609-616.
31. KDD. KDD Cup 1999 Data (Computer Network Intrusion Detection) [Online]. Available: http://kdd.ics.uci.edu/databases/kddcup99/kddcup99.html
32. W. Lee, S. J. Stolfo, and K. W. Mok, "A data mining framework for building intrusion detection models, " in Proc. IEEE Symp. Security Privacy, Oakland, CA, USA, 1999, pp. 120-132.
33. W. Wang, X. Guan, and X. Zhang, "Processing of massive audit data streams for real-time anomaly intrusion detection, " Comput. Commun., vol. 31, no. 1, pp. 58-72, 2008. (Pubitemid 350251566)
34. S. Papadimitriou, A. Brockwell, and C. Faloutsos, "Adaptive, hands-off stream mining, " in Proc. 29th VLDB, 2003, Berlin, Germany, pp. 560-571.
35. A. Arasu and G. S. Manku, "Approximate counts and quantiles over sliding windows, " in Proc. 23rd PODS, Paris, France, 2004, pp. 286-296.
36. B. Babcock and C. Olston, "Distributed top-k monitoring, " in Proc. SIGMOD, San Diego, CA, USA, 2003, pp. 28-39.
37. X. H. Dang, W.-K. Ng, and K.-L. Ong, "Online mining of frequent sets in data streams with error guarantee, " Knowl. Inf. Syst., vol. 16, no. 2, 2008, pp. 245-258.
38. J. Gama, R. Rocha, and P. Medas, "Accurate decision trees for mining high speed data streams, " in Proc. SIGMOD, Washington, DC, USA, 2003, pp. 523-528.
39. G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava, "Finding hierarchical heavy hitters in streaming data, " ACM Trans. Knowl. Discov. Data, vol. 1, no. 4, Article 2, 2008.
40. M. Leone, Sumedha, and M. Weigt, "Clustering by soft-constraint affinity propagation: Applications to gene-expression data, " Bioinformatics, vol. 23, no. 20, pp. 2708-2715, 2007. (Pubitemid 350048335)
41. X. Zhang, W. Wang, K. Norvag, and M. Sebag, "K-AP: Generating specified K clusters by efficient affinity propagation, " in Proc. IEEE 10th ICDM, Sydney, NSW, Australia, 2010, pp. 1187-1192.
42. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, "Localitysensitive hashing scheme based on p-stable distributions, " in Proc. 20th Annu. SCG, Brooklyn, NY, USA, 2004, pp. 253-262.