Structured doubly stochastic matrix for graph based clustering

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

Volumn 13-17-August-2016, Issue , 2016, Pages 1245-1254

  Wang, Xiaoqian ^a   Nie, Feiping ^a   Huang, Heng ^a  

^a University of Texas at Arlington   (United States)

Author keywords

Doubly stochastic matrix; Graph laplacian; K means clustering; Spectral clustering

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BENCHMARKING; CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; DATA MINING; GRAPHIC METHODS; INDUSTRIAL RESEARCH; LAPLACE TRANSFORMS; LEARNING SYSTEMS; MATRIX ALGEBRA; OPTIMIZATION; STOCHASTIC SYSTEMS;

DOUBLY STOCHASTIC MATRIX; GRAPH LAPLACIAN; GRAPH-BASED CLUSTERING; K-MEANS CLUSTERING; OBJECTIVE FUNCTION VALUES; OPTIMIZATION ALGORITHMS; SCIENTIFIC RESEARCHES; SPECTRAL CLUSTERING;

STOCHASTIC MODELS;

EID: 84984950698     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2939672.2939805     Document Type: Conference Paper

References (31)

1. R. Angelova and G. Weikum. Graph-based text classification: Learn from your neighbors. annual international ACM SIGIR conference on Research and development in information retrieval, pages 485-492, 2006.
2. M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373-1396, 2003.
3. D. P. Bertsekas. Constrained optimization and lagrange multiplier methods. Athena Scientific, 1996.
4. D. P. Bertsekas et al. Augmented lagrangian and differentiable exact penalty methods. 1981.
5. J.-F. Cai, E. J. Candès, and Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4):1956-1982, 2010.
6. A. Celikyilmaz, M. Thint, and Z. Huang. A graph-based semi-supervised learning for question-answering. the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP, pages 719-727, 2009.
7. W.-Y. Chen, Y. Song, H. Bai, C.-J. Lin, and E. Y. Chang. Parallel spectral clustering in distributed systems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(3):568-586, 2011.
8. F. R. K. Chung. Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, No. 92, American Mathematical Society, February 1997.
9. A. Georghiades, P. Belhumeur, and D. Kriegman. From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intelligence, 23(6):643-660, 2001.
10. J. Khan, J. S. Wei, M. Ringner, L. H. Saal, M. Ladanyi, F. Westermann, F. Berthold, M. Schwab, C. R. Antonescu, C. Peterson, et al. Classification and diagnostic prediction of cancers using gene expression profiling and artificial neural networks. Nature medicine, 7(6):673-679, 2001.
11. D. Luo, C. Ding, and H. Huang. Forging The Graphs: A Low Rank and Positive Semidefinite Graph Learning Approach. Advances in Neural Information Processing Systems (NIPS), pages 2969-2977, 2012.
12. D. Luo, C. Ding, F. Nie, and H. Huang. Cauchy graph embedding. International Conference on Machine Learning, pages 553-560, 2011.
13. J. MacQueen et al. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, volume 1, pages 281-297. Oakland, CA, USA. 1967.
14. A. Martinez and R. Benavente. The ar face database. Technical report, CVC Technical report, 1998.
15. B. Mohar. The laplacian spectrum of graphs. In Graph Theory, Combinatorics, and Applications, pages 871-898. Wiley, 1991.
16. J. V. Neumann. Functional Operators, volume 2. 1950.
17. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, pages 849-856, 2001.
18. F. Nie, H. Wang, H. Huang, and C. Ding. Unsupervised and semi-supervised learning via l1-norm graph. In IEEE Conference on Computer Vision, pages 2268-2273, 2011.
19. F. Nie, X. Wang, and H. Huang. Clustering and projected clustering via adaptive neighbor assignment. The 20th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2014), pages 977-986, 2014.
20. F. Nie, X. Wang, M. Jordan, and H. Huang. The constrained laplacian rank algorithm for graph-based clustering. Thirtieth AAAI Conference on Artificial Intelligence (AAAI 2016), pages 1969-1976, 2016.
21. P. Phillips, H. Wechsler, J. Huang, and P. Rauss. The FERET database and evaluation procedure for face-recognition algorithms. Image and Vision Computing, 16(5):295-306, 1998.
22. M. J. D. Powell. A method for nonlinear constraints in minimization problems. In R. Fletcher, editor, Optimization. Academic Press, London and New York, 1969.
23. F. S. Samaria and A. C. Harter. Parameterisation of a stochastic model for human face identification. In Applications of Computer Vision, 1994. Proceedings of the Second IEEE Workshop on, pages 138-142. IEEE, 1994.
24. A. I. Su, J. B. Welsh, L. M. Sapinoso, S. G. Kern, P. Dimitrov, H. Lapp, P. G. Schultz, S. M. Powell, C. A. Moskaluk, H. F. Frierson, and G. M. Hampton. Molecular Classification of Human Carcinomas by Use of Gene Expression Signatures. Cancer Res. 61(20):7388-7393, 2001.
25. U. Von Luxburg. A tutorial on spectral clustering. Statistics and computing, 17(4):395-416, 2007.
26. F. Wang, P. Li, and A. Konig. Learning a bi-stochastic data similarity matrix. IEEE International Conference on Data Mining, pages 551-560, 2010.
27. M. A. Woodbury. Inverting modified matrices. 1950.
28. K. Yang, Z. Cai, J. Li, and G. Lin. A stable gene selection in microarray data analysis. BMC bioinformatics, 7(1):228, 2006.
29. R. Zass and A. Shashua. Doubly stochastic normalization for spectral clustering. In NIPS, pages 1569-1576, 2006.
30. D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Schölkopf. Learning with local and global consistency. In NIPS, 2004.
31. X. Zhu, Z. Ghahramani, and J. D. Lafferty. Semi-supervised learning using Gaussian fields and harmonic functions. In ICML, pages 912-919, 2003.