Independent component analysis, a new concept?
Signal Processing - Special issue on higher order statistics
Matrix computations (3rd ed.)
Item-based collaborative filtering recommendation algorithms
Proceedings of the 10th international conference on World Wide Web
Linear fitting with missing data for structure-from-motion
Computer Vision and Image Understanding
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Principal Component Analysis with Missing Data and Its Application to Polyhedral Object Modeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields
Proceedings of the Mathematical Foundations of Computer Science 1984
The maximum edge biclique problem is NP-complete
Discrete Applied Mathematics
Optimization Algorithms on Subspaces: Revisiting Missing Data Problem in Low-Rank Matrix
International Journal of Computer Vision
Collaborative filtering using orthogonal nonnegative matrix tri-factorization
Information Processing and Management: an International Journal
Exact Matrix Completion via Convex Optimization
Foundations of Computational Mathematics
Using underapproximations for sparse nonnegative matrix factorization
Pattern Recognition
Inapproximability of maximum weighted edge biclique and its applications
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Approximate low-rank factorization with structured factors
Computational Statistics & Data Analysis
On the Complexity of Nonnegative Matrix Factorization
SIAM Journal on Optimization
Joint estimation of segmentation and structure from motion
Computer Vision and Image Understanding
Aggregating crowdsourced binary ratings
Proceedings of the 22nd international conference on World Wide Web
Domination analysis of algorithms for bipartite boolean quadratic programs
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Weighted low-rank approximation (WLRA), a dimensionality reduction technique for data analysis, has been successfully used in several applications, such as in collaborative filtering to design recommender systems or in computer vision to recover structure from motion. In this paper, we prove that computing an optimal WLRA is NP-hard, already when a rank-one approximation is sought. In fact, we show that it is hard to compute approximate solutions to the WLRA problem with some prescribed accuracy. Our proofs are based on reductions from the maximum-edge biclique problem and apply to strictly positive weights as well as to binary weights (the latter corresponding to low-rank matrix approximation with missing data).