Sciweavers

266 search results - page 3 / 54
» High-Rank Matrix Completion
Sort
View
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 1 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
TIT
2010
130views Education» more  TIT 2010»
13 years 1 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
JMLR
2012
11 years 8 months ago
Primal-Dual methods for sparse constrained matrix completion
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
Yu Xin, Tommi Jaakkola
ICASSP
2010
IEEE
13 years 6 months ago
Collaborative spectrum sensing from sparse observations using matrix completion for cognitive radio networks
— In cognitive radio, spectrum sensing is a key component to detect spectrum holes (i.e., channels not used by any primary users). Collaborative spectrum sensing among the cognit...
Jia Meng, Wotao Yin, Husheng Li, Ekram Hossain, Zh...
ICDM
2010
IEEE
146views Data Mining» more  ICDM 2010»
13 years 4 months ago
One-Class Matrix Completion with Low-Density Factorizations
Consider a typical recommendation problem. A company has historical records of products sold to a large customer base. These records may be compactly represented as a sparse custom...
Vikas Sindhwani, Serhat Selcuk Bucak, Jianying Hu,...