Low-rank matrix approximation with weights or missing data is NP-hard

SIAM Journal on Matrix Analysis and Applications

Volumn 32, Issue 4, 2011, Pages 1149-1165

  Gillis, Nicolas ^a   Glineur, François ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Computational complexity; Matrix completion with noise; Maximum edge biclique problem; Missing data; Principal component analysis with missing data; Weighted low rank approximation

Indexed keywords

BICLIQUE; LOW RANK APPROXIMATIONS; MATRIX COMPLETION; MISSING DATA; PRINCIPAL COMPONENT ANALYSIS WITH MISSING DATA;

COMPUTATIONAL COMPLEXITY; COMPUTER VISION; PRINCIPAL COMPONENT ANALYSIS;

MATRIX ALGEBRA;

EID: 84856269683     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/110820361     Document Type: Article

References (29)

1. E. CANDÈS AND Y. PLAN, Matrix completion with noise, in Proc. IEEE, 98 (2009), pp. 925-936.
2. E. CANDÈS AND B. RECHT, Exact matrix completion via convex optimization, Found. Comput. Math., 9 (2009), pp. 717-772.
3. F. CHEN, G. WANGA, AND C. ZHANG, Collaborative filtering using orthogonal nonnegative matrix tri-factorization, Inform. Process. Management, 45 (2009), pp. 368-379.
4. P. CHEN, Optimization algorithms on subspaces: Revisiting missing data problem in low-rank matrix, Int. J. Comput. Vis., 80 (2008), pp. 125-142.
5. A. CHISTOV AND D. GRIGORIEV, Complexity of quantifier elimination in the theory of algebraically closed fields, in Proceedings of the 11th Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sci. 176, Springer, 1984, pp. 17-31.
6. P. COMON, Independent component analysis, a new concept?, Signal Process., 36 (1994), pp. 287-314.
7. A. D'ASPREMONT, L. EL GHAOUI, M. I. JORDAN, AND G. R. G. LANCKRIET, A direct formulation for sparse PCA using semidefinite programming, SIAM Rev., 49 (2007), pp. 434-448. (Pubitemid 47377693)
8. K. GABRIEL AND S. ZAMIR, Lower rank approximation of matrices by least squares with any choice of weights, Technometrics, 21 (1979), pp. 489-498. (Pubitemid 10427363)
9. M. GAREY AND D. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
10. N. GILLIS AND F. GLINEUR, Nonnegative factorization and the maximum edge biclique problem, CORE Discussion paper 2008/64, 2008.
11. N. GILLIS AND F. GLINEUR, Using underapproximations for sparse nonnegative matrix factorization, Pattern Recognition, 43 (2010), pp. 1676-1687.
12. G. GOLUB AND C. VAN LOAN, Matrix Computation, 3rd Edition, The Johns Hopkins University Press, Baltimore, MD, 1996.
13. B. GRUNG AND R. MANNE, Missing values in principal component analysis, Chemom. and Intell. Lab. Syst., 42 (1998), pp. 125-139. (Pubitemid 28440367)
14. N.-D. HO, Nonnegative Matrix Factorization - Algorithms and Applications, Ph.D. thesis, Université catholique de Louvain, Louvain-la-Neuve, Belgium, 2008; available online at http://www.inma.ucl.ac.be/~vdooren/ThesisHo. pdf.
15. D. JACOBS, Linear fitting with missing data for structure-from-motion, Vision and Image Understanding, 82 (2001), pp. 57-81. (Pubitemid 32405221)
16. I. JOLLIFFE, Principal Component Analysis, Springer, New York, 1986.
17. Y. KOREN, R. BELL, AND C. VOLINSKY, Matrix factorization techniques for recommender systems, IEEE Computer, 42 (2009), pp. 30-37.
18. D. LEE AND H. SEUNG, Learning the parts of objects by nonnegative matrix factorization, Nature, 401 (1999), pp. 788-791.
19. W.-S. LU, S.-C. PEI, AND P.-H. WANG, Weighted low-rank approximation of general complex matrices and its application in the design of 2-D digital filters, IEEE Trans. Circuits Syst. I, 44 (1997), pp. 650-655. (Pubitemid 127768169)
20. I. MARKOVSKY AND M. NIRANJAN, Approximate low-rank factorization with structured factors, Comput. Statist. Data Anal., 54 (2010), pp. 3411-3420.
21. D. NISTÉR, F. KAHL, AND H. STEWÉNIUS, Structure from motion with missing data is NP-hard, in Proceedings of the IEEE 11th International Conference on Computer Vision, 2007, pp. 1-7.
22. J. NOCEDAL AND S. WRIGHT, Numerical Optimization, 2nd ed., Springer, New York, 2006.
23. R. PEETERS, The maximum edge biclique problem is NP-complete, Discrete Appl. Math., 131 (2003), pp. 651-654.
24. B. SARWAR, G. KARYPIS, J. KONSTAN, AND J. RIEDL, Item-based collaborative filtering recommendation algorithms, in Proceedings of the 10th International WorldWideWeb Conference, ACM, 2001, pp. 285-295.
25. M. SCHUERMANS, Weighted Low Rank Approximation: Algorithms and Applications, Ph.D. thesis, Katholieke Universiteit Leuven, Leuven, Belgium, 2006.
26. H. SHUM, K. IKEUCHI, AND R. REDDY, Principal component analysis with missing data and its application to polyhedral object modeling, IEEE Trans. Pattern Anal. Mach. Intell., 17 (1995), pp. 854-867.
27. N. SREBRO AND T. JAAKKOLA, Weighted low-rank approximations, in Proceedings of the 20th International Conference on Machine Learning, 2004, pp. 720-727.
28. J. TAN, Inapproximability of maximum weighted edge biclique and its applications, in Proceedings of the 5th International Conference on Theory and Applications of Models of Computation, 2008, pp. 282-293.
29. S. A. VAVASIS, On the complexity of nonnegative matrix factorization, SIAM J. Optim., 20 (2009), pp. 1364-1377.