Browse > Article

Orthogonal Nonnegative Matrix Factorization: Multiplicative Updates on Stiefel Manifolds  

Yoo, Ji-Ho (포항공과대학교 컴퓨터공학과)
Choi, Seung-Jin (포항공과대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Software and Applications / v.36, no.5, 2009 , pp. 347-352 More about this Journal
Abstract
Nonnegative matrix factorization (NMF) is a popular method for multivariate analysis of nonnegative data, the goal of which is decompose a data matrix into a product of two factor matrices with all entries in factor matrices restricted to be nonnegative. NMF was shown to be useful in a task of clustering (especially document clustering). In this paper we present an algorithm for orthogonal nonnegative matrix factorization, where an orthogonality constraint is imposed on the nonnegative decomposition of a term-document matrix. We develop multiplicative updates directly from true gradient on Stiefel manifold, whereas existing algorithms consider additive orthogonality constraints. Experiments on several different document data sets show our orthogonal NMF algorithms perform better in a task of clustering, compared to the standard NMF and an existing orthogonal NMF.
Keywords
document clustering; nonnegative matrix factorization; Stiefel manifold;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Lee, D.D., Seung, H.S., 'Learning the parts of objects by non-negative matrix factorization,' Nature 401, pp. 788-791, 1999   DOI   ScienceOn
2 Ding, C., He, X., Simon, H.D., 'On the equivalence of nonnegative matrix factorization and spectral clustering,' Proceedings of the SIAM International Conference on Data Mining (SDM), Newport Beach, CA, pp. 606-610, 2005
3 Lovasz, L., Plummer, M., 'Matching Theory,' Akademiai Kiado, 1986
4 Shahnaz, F., Berry, M., Pauca, P., Plemmons, R., 'Document clustering using nonnegative matrix factorization,' Information Processing and Management 42, pp. 363-385, 2006   DOI   ScienceOn
5 Ding, C., Li, T., Peng, W., Park, H., 'Orthogonal nonnegative matrix tri-factorizations for clustering,' Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), Philadelphia, PA, 2006   DOI
6 Stiefel, E., 'Richtungsfelder und fernparallelismus in n-dimensionalem mannig faltigkeiten,' Commentarii Math. Helvetici 8, pp. 305-353, 1935-1936
7 Edelman, A., Arias, T., Smith, S.T., 'The geometry of algorithms with orthogonality constraints,' SIAM J. Matrix Anal. Appl. 20(2), pp. 303-353, 1998   DOI   ScienceOn
8 Lee, D.D., Seung, H.S., 'Algorithms for non-negative matrix factorization,' Advances in Neural Information Processing Systems (NIPS). Volume 13, MIT Press, 2001
9 Gaussier, E., Goutte, C., 'Relation between PLSA and NMF and implications,' Proceedings of the ACM SIGIR International Conference on Research and Development in Information Retrieval (SIGIR), Salvador, Brazil, 2005   DOI
10 Li, S.Z., Hou, X.W., Zhang, H.J., Cheng, Q.S. 'Learning spatially localized parts-based repre sentation,' Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), Kauai, Hawaii, pp. 207-212, 2001   DOI
11 Xu, W., Liu, X., Gong, Y., 'Document clustering based on non-negative matrix factorization,' Proceedings of the ACM SIGIR International Conference on Research and Development in Information Retrieval (SIGIR), Toronto, Canada, 2003   DOI
12 Smith, S.T., 'Geometric Optimization Methods for Adaptive Filtering,' PhD thesis, Harvard University, May 1993
13 Choi, S., 'Algorithms for orthogonal nonnegative matrix factorization,' Proceedings of the International Joint Conference on Neural Networks (IJCNN), Hong Kong, 2008