Learning spectral embedding for semi-supervised clustering

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2011, Pages 597-606

  Shang, Fanhua ^a   Liu, Yuanyuan ^a   Wang, Fei ^b  

^a XIDIAN UNIVERSITY   (China)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Laplacian regularization; Pairwise constraint; Semisupervised clustering (SSC); Spectral embedding

Indexed keywords

DATA MINING COMMUNITY; DATA SETS; GRAPH-BASED CLUSTERING; LAPLACIANS; LOSS FUNCTIONS; NOISY OBJECTS; PAIRWISE CONSTRAINTS; REAL WORLD DATA; SEMI-SUPERVISED CLUSTERING; SIDE INFORMATION; SPECTRAL EMBEDDING; SPECTRAL REPRESENTATIONS; STRUCTURE INFORMATION;

LAPLACE TRANSFORMS; VIRTUAL REALITY;

DATA MINING;

EID: 84863139902     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2011.89     Document Type: Conference Paper

References (38)

1. O. Chapelle, B. Schölkopf, and A. Zien, Eds., Semi-Supervised Learning. The MIT Press, Cambridge, MA, 2006.
2. X. Zhu, "Semi-supervised learning literature survey," Technical report, Computer Sciences, University of Wisconsin-Madison, 2007.
3. M. Bilenko, S. Basu, and R. Mooney, "Integrating constraints and metric learning in semi-supervised clustering," in Proceedings of the 21st International Conference on Machine Learning, 2004, pp. 81-88.
4. S. Kamvar, D. Klein, and C. Manning, "Spectral learning," in Proceedings of the 18th International Joint Conference on Artificial Intelligence, 2003, pp. 561-566.
5. D. Klein, S. Kamvar, and C. Manning, "From instance-level constraints to space-level constraints: making the most of prior knowledge in data clustering," in Proceedings of the 19th International Conference on Machine Learning, 2002, pp. 307-314.
6. Z. Li, J. Liu, and X. Tang, "Constrained clustering via spectral regularization," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2009, pp. 421-428.
7. K. Wagstaff, C. Cardie, S. Rogers, and S. Schroedl, "Constrained kmeans clustering with background knowledge," in Proceedings of the 18th International Conference on Machine Learning, 2001, pp. 577- 584.
8. Z. Li, J. Liu, and X. Tang, "Pairwise constraint propagation by semidefinite programming for semi-supervised classification," in Proceedings of the 25th International Conference on Machine Learning, 2008, pp. 576-583.
9. K. Wagstaff and C. Cardie, "Clustering with instance-level constraints," in Proceedings of the 17th International Conference on Machine Learning, 2000, pp. 1103-1110.
10. B. Kulis, S. Basu, I. Dhillon, and R. Mooney, "Semi-supervised graph clustering: A kernel approach," Machine Learning, vol. 74, no. 1, pp. 1-22, 2009.
11. X. Wang and I. Davidson, "Flexible constrained spectral clustering," in Proceedings of the 16th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2010, pp. 563-572.
12. F. Shang, L.C. Jiao, J. Shi, M. Gong, and R.H Shang, "Fast densityweighted low-rank approximation spectral clustering," Data Mining and Knowledge Discovery, vol. 23, pp. 345-378, 2011.
13. F. Shang, L.C. Jiao, J. Shi, F. Wang, and M. Gong, "Fast affinity propagation clustering: A multilevel approach," Pattern recognition, vol. 45, no. 1, pp. 474-486, 2012.
14. W. E. Donath and A. J. Hofmann, "Lower bounds for the partitioning of graphs," IBM Journal of Research and Development, vol. 17, pp. 420-425, 1973.
15. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, 2000.
16. L. Hagen and A. Kahng, "New spectral methods for ratio cut partitioning and clustering," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 11, no. 9, pp. 1074- 1085, 1992.
17. C. H. Q. Ding, X. He, H. Zha, M. Gu, and H. D. Simon, "A min-max cut algorithm for graph partitioning and data clustering," in Proceedings of the IEEE International Conference on Data Mining, 2001, pp. 107-114.
18. S. White and P. Smyth, "A spectral clustering approach to finding communities in graph," in proceedings of the SIAM International Conference on Data Mining, 2005, pp. 76-84.
19. Z. Lu and M. Á. Carreira-Perpiñán, "Constrained spectral clustering through affinity propagation," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2008, pp. 848-855.
20. F. Wang, C. H. Q. Ding, and T. Li, "Integrated KL (K-means- Laplacian) clustering: A new clustering approach by combining attribute data and pairwise relations," in proceedings of the SIAM International Conference on Data Mining, 2009, pp. 38-48.
21. S. X. Yu and J. Shi, "Segmentation given partial grouping constraints," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 173-183, 2004.
22. W. Liu and S. Chang, "Robust multi-class transductive learning with graphs," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2009, pp. 381-388.
23. L. Zelnik-Manor and P. Perona, "Self-tuning spectral clustering," in Advances in Neural Information Processing Systems 16, 2004, pp. 1601-1608.
24. F. Chung, Spectral graph theory, American Mathematical Society, 1997.
25. U. von Luxburg, "A tutorial on spectral clustering," Statistics and Computing, vol. 17, no. 4, pp. 395-416, 2007.
26. J. T. Kwok and I. W. Tsang, "Learning with idealized kernels," in Proceedings of the 20th International Conference on Machine Learning, pp.400-407, 2003.
27. X.-M. Wu, A. So, Z. Li and S. Li, "Fast graph Laplacian regularized kernel learning via semidefinite-quadratic-linear programming," in Advances in Neural Information Processing Systems 21, 2009, pp. 1964-1972.
28. G. H. Golub and C. F. V. Loan, Matrix computations, Baltimore, Maryland: The Johns Hopkins University Press, Third edition, 1996.
29. R. H. Tütüncü, K. C. Toh, and M. J. Todd, "Solving semidefinitequadratic- linear programs using SDPT3," Mathematical Programming, vol. 95, pp. 189-217, 2003.
30. J. Löfberg, "YALMIP: A toolbox for modeling and optimization in MATLAB," The CACSD Conference, 2004.
31. E. Hu, S. Chen, D. Zhang, and X. Yin, "Semisupervised kernel matrix learning by kernel propagation," IEEE Trans. Neural Networks, vol. 21, no. 11, pp.1831-1841, 2010.
32. T. Coleman, J. Saunderson, and A. Wirth, "Spectral clustering with inconsistent advice," in Proceedings of the 25th International Conference on Machine Learning, 2008, pp. 152-159.
33. Y. LeCun, C. Cortes, The MNIST database of handwritten digits, 2009. http://yann.lecun.com/exdb/mnist/
34. S.A. Nene, S.K. Nayar, and J. Murase, "Columbia Object Image Library (COIL-20)," Technical Report CUCS-005-96, Columbia Univ., Feb. 1996.
35. A.S. Georghiades, P.N. Belhumeur, and D.J. Kriegman, "From few to many: illumination cone models for face recognition under variable lighting and pose," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 6, pp. 643-660, 2001.
36. L. Fei-Fei, R. Fergus, and P. Perona, "Learning generative visual models from few training examples: an incremental Bayesian approach tested on 101 object categories," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Workshop on Generative Model Based Vision, 2004.
37. A. Oliva and A. Torralba, "Modeling the shape the scene: A holistic representation of the spatial envelope," International Journal of Computer Vision, vol. 42, no. 3, pp. 145-175, 2001.
38. K. Grauman and T. Darrell, "The pyramid match kernel: discriminative classification with sets of image features," in Proceedings of the IEEE International Conference on Computer Vision, 2005, pp. 1458-1465.