Non-Negative matrix factorization revisited: Uniqueness and algorithm for symmetric decomposition

IEEE Transactions on Signal Processing

Volumn 62, Issue 1, 2014, Pages 211-224

  Huang, Kejun ^a   Sidiropoulos, Nicholas D ^a   Swami, Ananthram ^b  

^a University of Minnesota   (United States)

^b U S ARMY RESEARCH LABORATORY   (United States)

Author keywords

Nonnegative matrix factorization (NMF); Procrustes rotation; sparsity; symmetric NMF; uniqueness

Indexed keywords

NONNEGATIVE MATRIX FACTORIZATION; PROCRUSTES; SPARSITY; SYMMETRIC NMF; UNIQUENESS;

FACTORIZATION; MATRIX ALGEBRA;

CLUSTERING ALGORITHMS;

EID: 84890916116     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2013.2285514     Document Type: Article

References (45)

1. K. Huang, N. D. Sidiropoulos, and A. Swami, NMF revisited: New uniqueness results and algorithms, in Proc. IEEE ICASSP 2013, Vancouver, Canada, May 26-31, 2013.
2. S. L. Campbell and G. D. Poole, Computing nonnegative rank factorizations, Linear Algebra Appl., vol. 35, pp. 175-182, 1981.
3. J.-C. Chen, The nonnegative rank factorizations of nonnegative matrices, Linear Algebra Appl., vol. 62, pp. 207-217, 1984.
4. P. Paatero and U. Tapper, Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values, Environmetrics, vol. 5, no. 2, pp. 111-126, 1994.
5. A. Berman and R. J. Plemmons, NonnegativeMatrices. Philadelphia, PA, USA: SIAM, 1979.
6. D. D. Lee and H. S. Seung, Learning the parts of objects by non-negative matrix factorization, Nature, vol. 401, no. 6755, pp. 788-791, 1999.
7. A. Cichocki, R. Zdunek, A. H. Phan, and S. Amari, Nonnegative Matrix and Tensor Factorizations: Applications to ExploratoryMulti-Way Data Analysis and Blind Source Separation. NewYork,NY,USA: Wiley, 2009.
8. S. A. Vavasis, On the complexity of nonnegative matrix factorization, SIAM J. Optim., vol. 20, no. 3, pp. 1364-1377, 2009.
9. D. D. Lee andH. S. Seung, Algorithms for non-negativematrix factorization, Adv. Neural Inf. Process. Syst. (NIPS), vol. 13, pp. 556-562, 2001.
10. C.-J. Lin, Projected gradient methods for nonnegative matrix factorization, Neural Comput., vol. 19, no. 10, pp. 2756-2779, 2007.
11. R. Zdunek and A. Cichocki, Nonnegative matrix factorization with constrained second-order optimization, Signal Process., vol. 87, no. 8, pp. 1904-1916, 2007. (Pubitemid 46590394)
12. J. Kim and H. Park, Fast nonnegative matrix factorization: An activeset-like method and comparisons, SIAM J. Scientif. Comput., vol. 33, no. 6, pp. 3261-3281, 2011.
13. A. Cichocki and A.-H. Phan, Fast local algorithms for large scale nonnegative matrix and tensor factorizations, IEICE Trans. Fund. Electron., Commun., Comput. Sci., vol. 92, no. 3, pp. 708-721, 2009.
14. J. Li and J. M. Bioucas-Dias, Minimum volume simplex analysis: A fast algorithm to unmix hyperspectral data, in Proc. IEEE Int. Conf. Geosci. Remote Sens. (IGARSS) 2008, vol. 3, pp. 250-253.
15. B. Klingenberg, J. Curry, and A. Dougherty, Non-negative matrix factorization: ILL-posedness and a geometric algorithm, Pattern Recogn., vol. 42, no. 5, pp. 918-928, 2009.
16. R. Zdunek, Initialization of nonnegative matrix factorization with vertices of convex polytope, in Artificial Intelligence and Soft Computing. New York, NY, USA: Springer, 2012, pp. 448-455.
17. W. Ouedraogo, A. Souloumiac, M. Jaidane, and C. Jutten, Geometrical method using simplicial cones for overdetermined nonnegative blind source separation: Application to real PET images, Latent Variable Anal. Signal Separat., vol. 7191, pp. 494-501, 2012.
18. M. T. Chu and M. M. Lin, Low-dimensional polytope approximation and its applications to nonnegative matrix factorization, SIAM J. Scientif. Comput., vol. 30, no. 3, pp. 1131-1155, 2008.
19. F. A. Nielsen, Clustering of scientific citations inWikipedia, in Proc. WikiMania, Alexandria, Egypt, Jul. 2008.
20. W. Xu, X. Li, and Y. Gong, Document clustering based on non-negative matrix factorization, in Proc. 26th Annu. ACM Int. Conf. Res. Develop. Inf. Retrieval (SIGIR'03), Aug. 2003, pp. 267-273.
21. F. J. Theis, K. Stadlthanner, and T. Tanaka, First results on uniqueness of sparse non-negative matrix factorization, in Proc. 13th Eur. Signal Process. Conf. (EUSIPCO'05), Antalya, Turkey, Sep. 4-8, 2005.
22. R. Schachtner, G. Pöppel, and E. W. Lang, Towards unique solutions of non-negative matrix factorization problems by a determinant criterion, Digit. Signal Process., vol. 21, no. 4, pp. 528-534, 2011.
23. L. B. Thomas, Solution to problem 73-14, rank factorization of nonnegative matrices (by A. Berman, and R.J. Plemmons), SIAM Rev., vol. 16, no. 3, pp. 393-394, 1974.
24. D. L. Donoho and V. C. Stodden, When does non-negative matrix factorization give a correct decomposition into parts, in Advances in Neural Information Processing Systems (NIPS). Cambridge, MA, USA: MIT Press, 2003, vol. 16, pp. 1141-1148.
25. H. Laurberg, M. G. Christensen, M. D. Plumbley, L. K. Hansen, and S. H. Jensen, Theorems on positive data: On the uniqueness of NMF, Comput. Intell. Neurosci., vol. 2008, 2008 [Online]. Available: http://www.hindawi.com/journals/ cin/2008/764206/cta/, DOI:10.1155/2008/764206
26. S. Moussaoui, D. Brie, and J. Idier, Non-negative source separation: Range of admissible solutions and conditions for the uniqueness of the solution, in IEEE ICASSP 2005, Philadelphia, PA, USA, Mar. 18-23, 2005, vol. 5, pp. 289-292.
27. A. Berman and N. Shaked-Monderer, Completely PositiveMatrices. Singapore: World Scientific, 2003.
28. P. J. C. Dickinson and L. Gijben, On the computational complexity of membership problems for the completely positive cone and its dual, Comput. Optim. Appl. 2013 [Online]. Available: http://dx.doi.org/10. 1007/s10589-013-9594-z
29. Z. He, S. Xie, R. Zdunek, G. Zhou, and A. Cichocki, Symmetric nonnegative matrix factorization: Algorithms and applications to probabilistic clustering, IEEE Trans. Neural Netw., vol. 22, no. 12, pp. 2117-2131, 2011.
30. M. Catral, L.Han,M.Neumann, and R. J. Plemmons, On reduced rank nonnegativematrix factorization for symmetric nonnegativematrices, Linear Algebra Appl., vol. 393, pp. 107-126, 2004.
31. C. Ding, X. He, and H. D. Simon, On the equivalence of nonnegative matrix factorization and spectral clustering, in Proc. SIAMData Min. Conf., 2005, pp. 606-610.
32. R. T. Rockafellar, Convex Analysis. Princeton, NJ, USA: Princeton Univ. Press, 1996, vol. 28.
33. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
34. L. Khachiyan, E. Boros, K. Borys, K. Elbassioni, and V. Gurvich, Generating all vertices of a polyhedron is hard, Discrete Comput. Geometry, vol. 39, no. 1, pp. 174-190, 2008.
35. H. Laurberg, Non-negative matrix factorization: Theory and methods, Ph.D. dissertation, Aalborg Univ., Aalborg, Denmark, 2008.
36. N. Gillis, Sparse and unique nonnegative matrix factorization through data preprocessing, J. Mach. Learn. Res., vol. 13, pp. 3349-3386, 2012.
37. R. M. Freund and J. B. Orlin, On the complexity of four polyhedral set containment problems, Math. Programm., vol. 33, no. 2, pp. 139-145, 1985.
38. P. H. Schönemann, A generalized solution of the orthogonal Procrustes problem, Psychometrika, vol. 31, no. 1, pp. 1-10, 1966.
39. D. B. Bertsekas, Nonlinear Probramming, 2nd ed. Belmont, MA, USA: Athena Scientific, 1999.
40. L. Grippo and M. Sciandrone, On the convergence of the block nonlinear Gauss-Seidel method under convex constraints, Oper. Res. Lett., vol. 26, no. 3, pp. 127-136, 2000. (Pubitemid 30564332)
41. B. Chen, S. He, Z. Li, and S. Zhang, Maximum block improvement and polynomial optimization, SIAM J. Optim., vol. 22, no. 1, pp. 87-107, 2012.
42. M. R. Sepanski, Compact Lie Groups. New York, NY, USA: Springer, 2007, vol. 235.
43. G. H. Golub and C. F. Van Loan, Matrix Computations. : Johns Hopkins University Press, 1996.
44. H. W. Kuhn and A. W. Tucker, Nonlinear programming, in Proc. 2nd Berkeley Symp. Math. Statist. Probab., 1951, vol. 1, pp. 481-492.
45. G. Zhou, A. Cichocki, and S. Xie, Fast nonnegative matrix/tensor factorization based on low-rank approximation, IEEE Trans. Signal Process., vol. 60, no. 6, pp. 2928-2940, 2012.