On evolutionary spectral clustering

Abstract

Evolutionary clustering is an emerging research area essential to important applications such as clustering dynamic Web and blog contents and clustering data streams. In evolutionary clustering, a good clustering result should fit the current data well, while simultaneously not deviate too dramatically from the recent history. To fulfill this dual purpose, a measure of temporal smoothness is integrated in the overall measure of clustering quality. In this article, we propose two frameworks that incorporate temporal smoothness in evolutionary spectral clustering. For both frameworks, we start with intuitions gained from the well-known k-means clustering problem, and then propose and solve corresponding cost functions for the evolutionary spectral clustering problems. Our solutions to the evolutionary spectral clustering problems provide more stable and consistent clustering results that are less sensitive to short-term noises while at the same time are adaptive to long-term cluster drifts. Furthermore, we demonstrate that our methods provide the optimal solutions to the relaxed versions of the corresponding evolutionary k-means clustering problems. Performance experiments over a number of real and synthetic data sets illustrate our evolutionary spectral clustering methods provide more robust clustering results that are not sensitive to noise and can adapt to data drifts.

References

1. Aggarwal, C. C., Han, J., Wang, J., and Yu, P. S. 2003. A framework for clustering evolving data streams. In Proceedings of the 12th VLDB Conference.
2. Asur, S., Parthasarathy, S., and Ucar, D. 2007. An event-based framework for characterizing the evolutionary behavior of interaction graphs. In Proceedings of the 13th ACM SIGKDD Conference. ACM, New York.
3. Bach, F. R. and Jordan, M. I. 2006. Learning spectral clustering, with application to speech separation. J. Mach. Learn. Res. 7.
4. Chakrabarti, D., Kumar, R., and Tomkins, A. 2006. Evolutionary clustering. In Proceedings of the 12th ACM SIGKDD Conference. ACM, New York.
5. Charikar, M., Chekuri, C., Feder, T., and Motwani, R. 1997. Incremental clustering and dynamic information retrieval. In Proceedings of the 29th STOC Conference. ACM, New York.
6. Chatfield, C. 2003. The Analysis of Time Series: An Introduction. Chapman&Hall/CRC.
7. Chi, Y., Song, X., Zhou, D., Hino, K., and Tseng, B. L. 2007. Evolutionary spectral clustering by incorporating temporal smoothness. In Proceedings of the 13th ACM SIGKDD Conference. ACM, New York.
8. Chung, F. R. K. 1997. Spectral Graph Theory. American Mathematical Society.
9. De Lathauwer, L., De Moor, B., and Vandewalle, J. 2000. A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21, 4.
10. Dhillon, I. S., Guan, Y., and Kulis, B. 2004. Kernel k-means: spectral clustering and normalized cuts. In Proceedings of the 10th ACM SIGKDD Conference.
11. Ding, C. and He, X. 2004. K-means clustering via principal component analysis. In Proceedings of the 21st ICML Conference.
12. Fan, K. 1949. On a theorem of weyl concerning eigenvalues of linear transformations. In Proceedings of the National Academy of Science.
13. Golub, G. and Loan, C. V. 1996. Matrix Computations, third ed. Johns Hopkins University Press.
14. Guha, S., Mishra, N., Motwani, R., and O'Callaghan, L. 2000. Clustering data streams. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA.
15. Gupta, C. and Grossman, R. 2004. Genic: A single pass generalized incremental algorithm for clustering. In Proceedings of the SIAM International Conference on Data Mining. SIAM, Philadelphia, PA.
16. Hubert, L. J. and Arabie, P. 1985. Comparing partitions. J. Classif. 2.
17. Ji, X. and Xu, W. 2006. Document clustering with prior knowledge. In Proceedings of the SIGIR. ACM, New York.
18. Li, Y., Han, J., and Yang, J. 2004. Clustering moving objects. In Proceedings of the 10th ACM SIGKDD Conference. ACM, New York.
19. Mei, Q. and Zhai, C. 2005. Discovering evolutionary theme patterns from text: An exploration of temporal text mining. In Proceedings of the 11th ACM SIGKDD Conference. ACM, New York.
20. Newman, M. E. J. and Girvan, M. 2004. Finding and evaluating community structure in networks. Phys. Rev. E.
21. Ng, A., Jordan, M. and Weiss, Y. 2001. On spectral clustering: Analysis and an algorithm. In NIPS.
22. Ning, H., Xu, W., Chi, Y., Gong, Y., and Huang, T. 2007. Incremental spectral clustering with application to monitoring of evolving blog communities. In Proceedings of the SIAM International Conference on Data Mining. SIAM, Philadelphia, PA.
23. Palla, G., Barabasi, A.-L., and Vicsek, T. 2007. Quantifying social group evolution. Nature 446.
24. Sarkar, P. and Moore, A. W. 2005. Dynamic social network analysis using latent space models. SIGKDD Explor. Newsl. 7, 2.
25. Shi, J. and Malik, J. 2000. Normalized cuts and image segmentation. IEEE Trans. Patt. Anal. Mach. Intell. 22, 8.
26. Spiliopoulou, M., Ntoutsi, I., Theodoridis, Y., and Schult, R. 2006. Monic: Modeling and monitoring cluster transitions. In Proceedings of the 12th ACM SIGKDD Conference. ACM, New York.
27. Sun, J., Faloutsos, C., Papadimitriou, S., and Yu, P. S. 2007. GraphScope: Parameter-free mining of large time-evolving graphs. In Proceedings of the 13th ACM SIGKDD Conference. ACM, New York.
28. Toyoda, M. and Kitsuregawa, M. 2003. Extracting evolution of web communities from a series of web archives. In HYPERTEXT '03: Proceedings of the 14th ACM Conference on Hypertext and Hypermedia. ACM, New York.
29. Wagstaff, K., Cardie, C., Rogers, S., and Schroedl, S. 2001. Constrained K-means clustering with background knowledge. In Proceedings of the 18th ICML Conference.
30. Weiss, Y. 1999. Segmentation using eigenvectors: A unifying view. In ICCV '99: Proceedings of the International Conference on Computer Vision Volume 2.
31. Xu, W., Liu, X., and Gong, Y. 2002. Spectral text clustering. Tech. Rep. 2002-L011, NEC Laboratories America.
32. Xu, W., Liu, X., and Gong, Y. 2003. Document clustering based on non-negative matrix factorization. In Proceedings of the 26th SIGIR Conference. ACM, New York.
33. Zha, H., He, X., Ding, C. H. Q., Gu, M., and Simon, H. D. 2001. Spectral relaxation for k-means clustering. In NIPS.
34. Zhou, D., Huang, J., and Schölkopf, B. 2005. Learning from labeled and unlabeled data on a directed graph. In Proceedings of the 22nd ICML Conference.

Index Terms

• Information systems

  • Information retrieval

    • Retrieval tasks and goals

      • Document filtering

      • Information extraction

  • Information systems applications

    • Data mining