An effective initialization for orthogonal nonnegative matrix factorization

Journal of Computational Mathematics

Volumn 30, Issue 1, 2012, Pages 34-46

  Wang, Xuansheng ^a   Xie, Xiaoyao ^b   Lu, Linzhang ^a,b  

^a XIAMEN UNIVERSITY   (China)

^b GUIZHOU NORMAL UNIVERSITY   (China)

Author keywords

Lanczos bidiagonalization; Low rank approximation; Nonnegative approximation; Orthogonal nonnegative matrix factorization

Indexed keywords

EID: 84863289867     PISSN: 02549409     EISSN: None     Source Type: Journal    
DOI: 10.4208/jcm.1110-m11si10     Document Type: Article

References (21)

1. M.W. Berry, M. Browne, A.N. Langvile, V.P. Pauca, R.J. Plemmons, Algorithms and applications for approximation nonnegative matrix factorization, Comput. Stat. Data An., 52 (2007), 115-173.
2. C. Boutsidis, E. Gallopoulos, SVD based initialization: A head start of nonnegative matrix factorization, Pattern Recogn., 41 (2008), 1350-1362.
3. S. Choi, Algorithms for orthogonal nonnegative matrix factorization. In Proceedings of the International Joint Conference on Neural Networks (IJCNN), Hong Kong, 2008.
4. A. Cichocki, R. Zdunek, NMFLAB MATLAB toolbox for vsugunar@yahoo.co.in nonnegative matrix factorization. URL: http://www.bsp.brain.riken.jp/ICALAB/nmflab.html/.
5. C. Ding, T. Li, W. Peng, H. Park, orhtogonal nonnegative matrix factorization for clustering. In proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2006.
6. C. Ding, X. He, H.D. Simon, On the equivalence of nonnegative matrix factoriation and spectral clustering, In: SIAM Data Mining Conf, 2005.
7. C. Ding, T. Li, W. Peng, H. Park, Orthogonal nonnegative matrix t-factorizations for clustering. In: KDD '06: Proc. 12th ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining, ACM, 2006, 126-135.
8. J. Cohen, U. Rothblum, Nonnegative ranks, decomposition, and factorizations of nonnegative matrices, Linear Algerbra Appl., 190 (1993), 149-168.
9. J. Cullum, R.A. Willoughby, and M. Lake, A Lanczos algorithm for computing the singular values and corrsponding singular vectors of a matrix, ACM T. Math. Software, 7 (1981), 140-169.
10. L. Elden, Matrix Methods in Data Mining and Pattern Recognition, SIAM, Philadelphia, PA, USA, 2007.
11. G.H. Gloub and C.F. Van Loan, Matrix Computation, 3rd ed., The Johns Hopkins University Press, Baltimore, MD. 1996.
12. N.J. Higham, Matrix nearest problems and applications, in: M. Gover, S. Barnett (Eds.), Applications of Matrix Theory, Oxford University Press, 1989, pp. 1-27.
13. D.D. Lee, H.S. Seung, Unsupervised learning by convex and coinc coding, Adv. Neural Inf. Process. Syst, 9 (1997) 515-521.
14. D.D. Lee, H. S. Seung, Algorithms for non-negative matrix factorization, Adv. Neural Inf. Process. Syst., 13 (2001).
15. Nicolas Gillis, Francois Glineur Using Underapproximations for Sparse Nonnegative Matrix Factorization, Pattern Recogn., (2010), 1676-1687.
16. P. Paatero, Least squares formulation of robust non-negative factor analysis, Chemometr. Intell. lab., 37 (1997), 23-35.
17. P. Paatero, U. Tapper, Positive matrix factorization: a non-negative factor model with optimal utilization of error estiamtes of data values, Environmetrics, 5 (1994), 111-126.
18. C.C. Paige, Errors analysis of the Lanczos algorithm for tridiagonalizaing a symmetric matrix, J. Inst. Math. Appl., 18 (1976), 341-349.
19. R. Salakhutdinov, S. Roweis, Z. Ghahramani, On the convergence of bound optimization algorithms, in: Proceedings of the 19th Conference in Uncertainty in Artifical Intelligence (UAI'03), Morgan Kanfamann, Los Altos, CA, 2003, 509-516.
20. H.D. Simon and H. Zha, Low-rank Matrix Approximation Using Lanczos Bidiagonalization Process with Applications, SIAM J. Sci. Comput, 21:6 (2000), 2257-2274.
21. Jiho Yoo, and Seungjin Choi, Orthogonal nonnegative matrix tri-factorization for co-clustering: Multiplicative updates on Stiefel manifolds, Inform. Process. Manag., 46 (2010), 559-570.