Unsupervised large graph embedding

31st AAAI Conference on Artificial Intelligence, AAAI 2017

Volumn , Issue , 2017, Pages 2422-2428

  Nie, Feiping ^a   Zhu, Wei ^a   Li, Xuelong ^b  

^a NORTHWESTERN POLYTECHNICAL UNIVERSITY   (China)

^b XI AN INSTITUTE OF OPTICS AND PRECISION MECHANICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; SPECTRUM ANALYSIS; STOCHASTIC SYSTEMS;

DIMENSIONALITY REDUCTION METHOD; DOUBLY STOCHASTIC; LAPLACIAN EIGENMAP; LINEAR DIMENSIONALITY REDUCTION; LOCALITY PRESERVING PROJECTIONS; NUMBER OF SAMPLES; SIMILARITY MATRIX; SPECTRAL REGRESSIONS;

MATRIX ALGEBRA;

EID: 85028549826     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Belkin, M., and Niyogi, P. 2001. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in Neural Information Processing Systems 14, 585-591.
2. Cai, D., and Chen, X. 2015. Large scale spectral clustering via landmark-based sparse representation. IEEE T. Cybernetics 45(8):1669-1680.
3. Cai, D.; He, X.; and Han, J. 2007. Spectral regression: a unified subspace learning framework for content-based image retrieval. In Proceedings of the 15th International Conference on Multimedia, 403-412.
4. Cai, D. 2015. Compressed spectral regression for efficient nonlinear dimensionality reduction. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 3359-3365.
5. Chen, X., and Cai, D. 2011. Large scale spectral clustering with landmark-based representation. In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence.
6. Chung, F. R. K. 1997. Spectral Graph Theory. American Mathematical Society.
7. Eckart, C., and Young, G. 1936. The approximation of one matrix by another of lower rank. Psychometrika In Psychometrika 1(3):211-218.
8. He, X., and Niyogi, P. 2003. Locality preserving projections. In Advances in Neural Information Processing Systems 16, 153-160.
9. Li, Y.; Nie, F.; Huang, H.; and Huang, J. 2015. Large-scale multi-view spectral clustering via bipartite graph. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2750-2756.
10. Li, X.; Hu, D.; and Nie, F. 2017. Large graph hashing with spectral rotation. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence.
11. Liu, W.; He, J.; and Chang, S. 2010. Large graph construction for scalable semi-supervised learning. In Proceedings of the 27th International Conference on Machine Learning, 679-686.
12. Ng, A. Y.; Jordan, M. I.; and Weiss, Y. 2001. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems 14, 849-856.
13. Nie, F.; Xu, D.; Tsang, I. W.; and Zhang, C. 2010. Flexible manifold embedding: A framework for semi-supervised and unsupervised dimension reduction. IEEE Transactions on Image Processing 19(7):1921-1932.
14. Nie, F.; Xu, D.; Li, X.; and Xiang, S. 2011. Semisupervised dimensionality reduction and classification through virtual label regression. IEEE Trans. Systems, Man, and Cybernetics, Part B 41(3):675-685.
15. Nie, F.; Wang, X.; Jordan, M. I.; and Huang, H. 2016. The constraint laplacian rank algorithm for graph-based clustering. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence.
16. Paige, C. C., and Saunders, M. A. 1982. LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Softw. 8(1):43-71.
17. Schwenker, F.; Kestler, H. A.; and Palm, G. 2001. Three learning phases for radial-basis-function networks. Neural Networks 14(4-5):439-458.
18. T, R. S., and K, S. L. 2000. Nonlinear dimensionality reduction by locally linear embedding. Science 290(5):2323-2326.
19. Tenenbaum, J. B. 1997. Mapping a manifold of perceptual observations. In Advances in Neural Information Processing Systems 10, 682-688.
20. Wang, H.; Yan, S.; Xu, D.; Tang, X.; and Huang, T. S. 2007. Trace ratio vs. ratio trace for dimensionality reduction. In 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
21. Wang, X.; Nie, F.; and Huang, H. 2016. Structured doubly stochastic matrix for graph based clustering: Structured doubly stochastic matrix. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1245-1254.
22. Yan, S.; Xu, D.; Zhang, B.; Zhang, H.; Yang, Q.; and Lin, S. 2007. Graph embedding and extensions: A general framework for dimensionality reduction. IEEE Trans. Pattern Anal. Mach. Intell. 29(1):40-51.
23. Zass, R., and Shashua, A. 2006. Doubly stochastic normalization for spectral clustering. In Advances in Neural Information Processing Systems, 1569-1576.
24. Zhou, D.; Weston, J.; Gretton, A.; Bousquet, O.; and Schölkopf, B. 2003. Ranking on data manifolds. In Advances in Neural Information Processing Systems 16, 169-176.
25. Zhu, X. 2008. Semi-supervised learning literature survey. Computer Science 37(1):63-77.