Nonnegative Matrix Factorization clustering on multiple manifolds

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2010, Pages 575-580

  Shen, Bin ^a   Si, Luo ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CLUSTERING ALGORITHMS; FACTORIZATION;

GEOMETRICAL STRUCTURE; HIGH DIMENSIONAL SPACES; LINEAR REPRESENTATION; LOW-DIMENSIONAL SPACES; LOW-DIMENSIONAL SUBSPACE; NON-NEGATIVE MATRIX; NONNEGATIVE MATRIX FACTORIZATION; REAL-WORLD DATASETS;

MATRIX ALGEBRA;

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

References (16)

1. Cai, D.; He, X.; Wang, X.; Bao, H.; and Han, J. 2009. Locality preserving nonnegative matrix factorization. In IJCAI'09: Proceedings of the. 21st international joint conference on Artifical intelligence, 1010-1015. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
2. Cai, D.; He, X.; and Han, J. 2008. Graph regularized non-negative matrix factorization for data representation. In UIUC Computer Science Research and Tech Reports.
3. Donoho, D. L. 2006. For most large underdetermined systems of equations, the minimal 11-norm near-solution approximates the sparsest near-solution. Communications on pure and applied mathematics 59(7):907-934.
4. Elhamifar, E., and Vidal, R. 2009. Sparse subspace clustering. In IEEE Conference on Computer Vision and Pattern Recognition., 2790-2797.'
5. Goldberg, A.; Zhu, X.; Singh, A.; Xu, Z.; and Nowak, R. 2009. Multi-manifold semi-supervised learning. In Twelfth International Conference on Artificial Intelligence and Statistics.
6. Gu, Q., and Zhou, J. 2009. Neighborhood preserving nonnegative matrix factorization. In The, 20th British Machine. Vision Conference.
7. Hover, P. O. 2004. Non-negative matrix factorization with sparseness constraints. J. Mach. team. Res. 5:1457-1469.
8. Kim. J., and Park, H. 2008. Sparse nonnegative matrix factorization for clustering. In CSE Technical Reports. Georgia Institute of Technology.
9. Lee, D. D.. and Seung, H. S. 2001. Algorithms for non-negative matrix factorization. In NIPS, 556-562. MIT Press.
10. Lovasz, L., and Plummer, M. D. 1986. Matching Theory. Akademiai Kiado.
11. Niyogi, P. 2003. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15:1373-1396.
12. Roweis, S. T., and Saul. L. K. 2000. Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323-2326.
13. Turlach, B. A.; Venablesy, W. N.; and Wright, S. J. 2005. Simultaneous variable selection. Technometrics 27:349-363.
14. Wang, Y; Jia, Y.: Hu, C: and Turk, M. 2004. Fisher non-negative matrix factorization for learning local features. In Asian Conference, on Computer Vision.
15. Xu, W.; Liu, X.; and Gong, Y. 2003. Document clustering based on non-negative matrix factorization. In SIGIR '03: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in information retrieval, 267-273. New York, NY, USA: ACM.
16. Zafeiriou, S.; Tefas, A.; Buciu, I.: and Pitas, I. 2007. Exploiting discriminant information in non-negative matrix factorization with application to frontal face verification. IEEE Transactions on Neural Networks 17(3):683-695.