Sparse and unique nonnegative matrix factorization through data preprocessing

Journal of Machine Learning Research

Volumn 13, Issue , 2012, Pages 3349-3386

  Gillis, Nicolas ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Data preprocessing; Inversepositive matrices; Nonnegative matrix factorization; Sparsity; Uniqueness

Indexed keywords

DATA PREPROCESSING; GEOMETRIC INTERPRETATION; ILL POSED; IMAGE DATASETS; INPUT DATAS; M-MATRICES; NONNEGATIVE MATRIX FACTORIZATION; PART-BASED REPRESENTATION; SPARSE SOLUTIONS; SPARSITY; UNIQUENESS;

FACTORIZATION;

MATRIX ALGEBRA;

EID: 84870868704     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (40)

1. A. Aggarwal, H. Booth, J. O'Rourke, and S. Suri. Finding minimal convex nested polygons. Information and Computation, 83(1):98-110, 1989. (Pubitemid 20608736)
2. S. Arora, R. Ge, R. Kannan, and A. Moitra. Computing a nonnegative matrix factorization -provably. In Proceedings of the 44th Symposium on Theory of Computing, STOC '12, pages 145-162, New York, NY, USA, 2012. ACM.
3. A. Berman and R.J. Plemmons. Nonnegative Matrices in the Mathematical Sciences. SIAM, 1994.
4. C. Bocci, E. Carlini, and F. Rapallo. Perturbation of matrices and non-negative rank with a view toward statistical models. SIAM. J. Matrix Anal. & Appl., 32(4):1500-1512, 2011.
5. C. Boutsidis, M.W. Mahoney, and P. Drineas. An improved approximation algorithm for the column subset selection problem. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '09, pages 968-977, Philadelphia, PA, USA, 2009. Society for Industrial and Applied Mathematics.
6. M.T. Chu and M.M. Lin. Low-dimensional polytope approximation and its applications to nonnegative matrix factorization. SIAM J. Sci. Comput., 30(3):1131-1155, 2008.
7. A. Cichocki, S. Amari, R. Zdunek, and A.H. Phan. Non-negative Matrix and Tensor Factorizations: Applications to ExploratoryMulti-way Data Analysis and Blind Source Separation. Wiley-Blackwell, 2009.
8. M.D. Craig. Minimum-volume tranforms for remotely sensed data. IEEE Trans. On Geoscience and Remote Sensing, 32(3):542-552, 1994.
9. C. Ding, X. He, and H.D. Simon. On the equivalence of nonnegative matrix factorization and spectral clustering. In SIAM Int. Conf. Data Mining (SDM'05), pages 606-610, 2005.
10. C. Ding, T. Li, W. Peng, and H. Park. Orthogonal nonnegative matrix tri-factorizations for clustering. In In Proc. Of the 12th ACM SIGKDD Int. Conf. On Knowledge Discovery and Data Mining, pages 126-135, 2006. (Pubitemid 44535510)
11. D. Donoho and V. Stodden. When does non-negative matrix factorization give a correct decomposition into parts? In Advances in Neural Information Processing Systems 16, 2003.
12. C. F́evotte, N. Bertin, and J.L. Durrieu. Nonnegative matrix factorization with the itakura-saito divergence: With application to music analysis. Neural Computation, 21(3):793-830, 2009.
13. N. Gillis. Nonnegative Matrix Factorization: Complexity, Algorithms and Applications. PhD thesis, Universit'e catholique de Louvain, 2011.
14. N. Gillis and F. Glineur. Nonnegative factorization and the maximumedge biclique problem. CORE discussion paper 2008/64, 2008.
15. N. Gillis and F. Glineur. Using underapproximations for sparse nonnegative matrix factorization. Pattern Recognition, 43(4):1676-1687, 2010.
16. N. Gillis and F. Glineur. On the geometric interpretation of the nonnegative rank. Linear Algebra and its Applications, 437(11):2685-2712, 2012a.
17. N. Gillis and F. Glineur. Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization. Neural Computation, 24(4):1085-1105, 2012b.
18. N. Gillis and S.A. Vavasis. Fast and robust recursive algorithms for separable nonnegative matrix factorization. arXiv:1208.1237, 2012.
19. H. Hazewinkel. On positive vectors, positive matrices and the specialization ordering. Technical report, CWI Report PM-R8407, 1984.
20. P.O. Hoyer. Nonnegative matrix factorization with sparseness constraints. J. Machine Learning Research, 5:1457-1469, 2004.
21. A. Huck, M. Guillaume, and J. Blanc-Talon. Minimum dispersion constrained nonnegative matrix factorization to unmix hyperspectral data. IEEE Trans. On Geoscience and Remote Sensing, 48 (6):2590-2602, 2010.
22. V. Kalofolias and E. Gallopoulos. Computing symmetric nonnegative rank factorizations. Linear Algebra and its Applications, 436(2):421-435, 2012.
23. H. Kim and H. Park. Sparse non-negative matrix factorizations via alternating non-negativityconstrained least squares for microarray data analysis. Bioinformatics, 23(12):1495-1502, 2007. (Pubitemid 47244474)
24. B. Klingenberg, J. Curry, and A. Dougherty. Non-negative matrix factorization: Ill-posedness and a geometric algorithm. Pattern Recognition, 42(5):918-928, 2009.
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. Computational Intelligence and Neuroscience, 2008. Article ID 764206.
26. D.D. Lee and H.S. Seung. Learning the parts of objects by nonnegative matrix factorization. Nature, 401:788-791, 1999.
27. L. Miao and H. Qi. Endmember extraction from highly mixed data using minimum volume constrained nonnegative matrix factorization. IEEE Trans. On Geoscience and Remote Sensing, 45 (3):765-777, 2007. (Pubitemid 46375748)
28. P. Paatero and U. Tapper. Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values. Environmetrics, 5:111-126, 1994.
29. V.P. Pauca, J. Piper, and R.J. Plemmons. Nonnegative matrix factorization for spectral data analysis. Linear Algebra and its Applications, 406(1):29-47, 2006. (Pubitemid 43737212)
30. B.T. Polyak and P.S. Shcherbakov. Hard problems in linear control theory: Possible approaches to solution. Automation and Remote Control, 66:681-718, 2005. (Pubitemid 40683646)
31. F. Pompili, N. Gillis, P.-A. Absil, and F. Glineur. Two algorithms for orthogonal nonnegative matrix factorization with application to clustering. arXiv:1201.090, 2011.
32. G.B. Recht, M. Fazel, and P.A. Parrilo. Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization. SIAM Review, 52(3):471-501, 2010.
33. Y. Sun and J. Xin. Underdetermined sparse blind source separation of nonnegative and partially overlapped data. SIAM Journal on Scientific Computing, 33(4):2063-2094, 2011.
34. O. Taussky. A recurring theorem on determinants. The American Mathematical Monthly, 56(10): 672-676, 1949.
35. F.J. Theis, K. Stadlthanner, and T. Tanaka. First results on uniqueness of sparse non-negative matrix factorization. In 13th European Signal Processing Conference, EUSIPCO, Antalya, Turkey, 2005.
36. L.B. Thomas. Rank factorization of nonnegative matrices. SIAM Review, 16(3):393-394, 1974.
37. S.A. Vavasis. On the complexity of nonnegative matrix factorization. SIAM J. On Optimization, 20 (3):1364-1377, 2009.
38. F.-Y. Wang, C.-Y. Chi, T.-H. Chan, and Y. Wang. Nonnegative least-correlated component analysis for separation of dependent sources by volume maximization. IEEE Trans. On Pattern Analysis and Machine Intelligence, 32(5):875-888, 2010.
39. W. Xu, X. Liu, and Y. Gong. Document clustering based on non-negative matrix factorization. In Proc. Of the 26th Annual Int. ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '03, pages 267-273, New York, NY, USA, 2003. ACM.
40. G. Zhou, S. Xie, Z. Yang, J.-M. Yang, and Z. He. Minimum-volume- constrained nonnegative matrix factorization: Enhanced ability of learning parts. IEEE Trans. On Neural Networks, 22(10):1626-1637, 2011.