Evolutionary spectral clustering by incorporating temporal smoothness

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2007, Pages 153-162

  Chi, Yun ^a   Song, Xiaodan ^a   Zhou, Dengyong ^a   Hino, Koji ^a   Tseng, Belle L ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

Evolutionary spectral clustering; Mining data streams; Preserving cluster membership; Temporal smoothness; Treserving cluster quality

Indexed keywords

COST FUNCTIONS; DATA MINING; PROBLEM SOLVING; SPECTRUM ANALYSIS; WORLD WIDE WEB;

EVOLUTIONARY SPECTRAL CLUSTERING; MINING DATA STREAMS; PRESERVING CLUSTER MEMBERSHIP; TEMPORAL SMOOTHNESS;

CLUSTER ANALYSIS;

EID: 36849005505     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281192.1281212     Document Type: Conference Paper

References (22)

1. C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu. A framework for clustering evolving data streams. In Proc. of the 12th VLDB Conference, 2003.
2. F. R. Bach and M. I. Jordan. Learning spectral clustering, with application to speech separation. Journal of Machine Learning Research, 7, 2006.
3. D. Chakrabarti, R. Kumar, and A. Tomkins. Evolutionary clustering. In Proc. of the 12th ACM SIGKDD Conference, 2006.
4. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. In Proc. of the 29th STOC Conference, 1997.
5. C. Chatfield. The Analysis of Time Series: An Introduction. Chapman &: Hall/CRC.
6. F. R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
7. L. De Lathauwer, B. De Moor, and J. Vandewalle. A multilinear singular value decomposition. SIAM J. on Matrix Analysis and Applications, 21(4), 2000.
8. I. S. Dhillon, Y. Guan, and B. Kulis. Kernel k-means: spectral clustering and normalized cuts. In Proc. of the 10th ACM SIGKDD Conference, 2004.
9. C. Ding and X. He. K-means clustering via principal component analysis. In Proc. of the 21st ICML Conference, 2004.
10. K. Fan. On a theorem of weyl concerning eigenvalues of linear transformations. In Proc. Natl. Acad. Sci., 1949.
11. G. Golub and C. V. Loan. Matrix Computations. Johns Hopkins University Press, third edition, 1996.
12. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. In IEEE Symposium on Foundations of Computer Science, 2000.
13. C. Gupta and R. Grossman. Genie: A single pass generalized incremental algorithm for clustering. In SIAM Int. Conf. on Data Mining, 2004.
14. L. J. Hubert and P. Arabie. Comparing partitions. Journal of Classification, 2, 1985.
15. X. Ji and W. Xu. Document clustering with prior knowledge. In SIGIR, 2006.
16. Y. Li, J. Han, and J. Yang. Clustering moving objects. In Proc. of the 10th ACM SIGKDD Conference, 2004.
17. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, 2001.
18. H. Ning, W. Xu, Y. Chi, Y. Gong, and T. Huang. Incremental spectral clustering with application to monitoring of evolving blog communities. In SIAM Int. Conf. on Data Mining, 2007.
19. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence, 22(8), 2000.
20. K. Wagstaff, C. Cardie, S. Rogers, and S. Schroedl. Constrained K-means clustering with background knowledge. In Proc. 18th ICML Conference, 2001.
21. Y. Weiss. Segmentation using eigenvectors: A unifying view. In ICCV '99: Proceedings of the International Conference on Computer Vision-Volume 2, 1999.
22. H. Zha, X. He, C. H. Q. Ding, M. Gu, and H. D. Simon. Spectral relaxation for k-means clustering. In NIPS, 2001.