Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

# Low-rank approximation

Known as: Low rank approximation
In mathematics, low-rank approximation is a minimization problem, in which the cost function measures the fit between a given matrix (the data) and… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
• Signal Process.
• 2019
• Corpus ID: 13709506
Tensor completion recovers missing entries of multiway data. Teh missing of entries could often be caused during teh data… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
• SIAM J. Matrix Anal. Appl.
• 2008
• Corpus ID: 7159193
There has been continued interest in seeking a theorem describing optimal low-rank approximations to tensors of order 3 or higher… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
• ICML '08
• 2008
• Corpus ID: 10651609
Low-rank matrix approximation is an effective tool in alleviating the memory and computational burdens of kernel methods and… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
• SIAM J. Comput.
• 2006
• Corpus ID: 5453786
In many applications, the data consist of (or may be naturally formulated as) an $m \times n$ matrix $A$. It is often of interest… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We consider the problem of computing low rank approximations of matrices. The novelty of our approach is that the low rank… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
• JACM
• 2004
• Corpus ID: 2483891
We consider the problem of approximating a given <i>m</i> × <i>n</i> matrix <b>A</b> by another matrix of specified rank <i>k</i… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
• ICML
• 2003
• Corpus ID: 5815325
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
• Computing
• 2003
• Corpus ID: 16501661
This article deals with the solution of integral equations using collocation methods with almost linear complexity. Methods such… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
• 2003
• Corpus ID: 5542821
This paper concerns the construction of a structured low rank matrix that is nearest to a given matrix. The notion of structured… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
• SIAM J. Matrix Anal. Appl.
• 2001
• Corpus ID: 22258700
The singular value decomposition (SVD) has been extensively used in engineering and statistical applications. This method was… Expand
Is this relevant?