Fetching the paper…
Reading the bibliography…
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 applications in collaborative filtering, computer vision and control.
Laman, G. (1970) On graphs and rigidity of plane skeletal structures. Journal of Engineering Mathematics
1970
Earlier work this paper cites.
Almost all simply connected closed surfaces are rigid
Gluck, H. (1975) · 1975
Earlier work this paper cites.
Asimow, L. and Roth, B. (1978) The rigidity of graphs. Trans. Amer. Math. Soc
1978
Earlier work this paper cites.
Rigid and Flexible Frameworks
Roth, B. (1981) · 1981
Earlier work this paper cites.
Paige, C.C. and Saunders, M.A. (1982) LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares. ACM Transactions on Mathematical Software (TOMS)
1982
Earlier work this paper cites.
Connelly, R. (1991) On generic global rigidity. In Applied Geometry and Discrete Mathematics
1991
Earlier work this paper cites.
Shape and Motion from Image Streams under Orthography: a Factorization Method. International Journal of Computer Vision
Tomasi, C. and Kanade, T. (1992) · 1992
Earlier work this paper cites.
Conditions for unique graph realizations
Hendrickson, B. (1992) · 1992
Earlier work this paper cites.
Vandenberghe, L. and Boyd, S.P. (1996) Semidefinite programming. SIAM Review
1996
Earlier work this paper cites.
Golub, G.H. and Van Loan, C.F. (1996) Matrix computations
1996
Earlier work this paper cites.
Mesbahi, M. and Papavassilopoulos, G.P (1997) On the rank minimization problem over a positive semidefinite linear matrix inequality. IEEE Transactions on Automatic Control
1997
Cited alongside, same era.
Jacobs, D. (1997) Linear Fitting with Missing Data: Applications to Structure-from-Motion and to Characterizing Intensity Images. IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’97)
1997
Cited alongside, same era.
An Algorithm for Two-Dimensional Rigidity Percolation: The Pebble Game
Jacobs, D. J. and Hendrickson, B. (1997) · 1997
Cited alongside, same era.
Fazel, M. (2002) Matrix Rank Minimization with Applications. Elec. Eng. Dept, Stanford University
2002
Cited alongside, same era.
Weighted Low-Rank Approximations
Srebro, N. and Jaakkola, T. (2003) · 2003
Cited alongside, same era.
Donoho, D.L. (2006) Compressed sensing. IEEE Transactions on Information Theory
2006
Later among the works it cites.
Jackson, B., Servatius, B., and Servatius, H. (2006) The 2-Dimensional Rigidity of Certain Families of Graphs. Journal of Graph Theory
2006
Later among the works it cites.
ACM SIGKDD and Netflix. Proceedings of KDD Cup and Workshop, 2007. Proceedings available online at http://www.cs.uic.edu/ liub/KDD-cup-2007/proceedings.html
2007
Later among the works it cites.
Keshavan, R., Montanari, A., and Oh, S. (2008) Learning low rank matrices from O ( n ) O(n) entries. Allerton 2008
2008
Later among the works it cites.
Lee, A. and Streinu, I. (2008) Pebble Game Algorithms and Sparse Graphs. Discrete Mathematics
2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Srebro, N. (2004) Learning with Matrix Factorizations. PhD thesis
2004
Cited alongside, same era.
Fazel, M., Hindi, H., and Boyd, S. (2004) Rank Minimization and Applications in System Theory. Proceedings of American Control Conference
2004
Cited alongside, same era.
Candès, E.J. and Tao, T. (2005) Decoding by linear programming. IEEE Transactions on Information Theory
2005
Cited alongside, same era.
Connelly, R. (2005) Generic global rigidity, Discrete Comput. Geom
2005
Cited alongside, same era.
Jackson, B. and Jordan, T. (2005) Connected rigidity matroids and unique realization graphs. J. Combinatorial Theory B
2005
Cited alongside, same era.
Cai, J.-F., Candès, E.J., and Shen, Z. A Singular Value Thresholding Algorithm for Matrix Completion, submitted for publication
Cited in the paper.
Candès, E.J. and Recht, B. Exact Matrix Completion via Convex Optimization, submitted for publication
Cited in the paper.
2008
Later among the works it cites.
Gotsman, C. and Toledo, S. (2008) On the Computation of Null Spaces of Sparse Rectangular Matrices. SIAM Journal on Matrix Analysis and Applications
2008
Later among the works it cites.
Singer, A. (2008) A Remark on Global Positioning from Local Distances. Proceedings of the National Academy of Sciences
2008
Later among the works it cites.
Keshavan, R., Oh, S., and Montanari, A. (2009) Matrix Completion from a Few Entries. ISIT 2009
2009
Closest in time.