Fetching the paper…
Reading the bibliography…
This paper proposes a novel formulation of the tensor completion problem to impute missing entries of data represented by tensors.
L. R. Tucker, “Some mathematical notes on three-mode factor analysis,” Psychometrika , vol. 31, no. 3, pp. 279–311, Sep 1966
1966
Earlier work this paper cites.
J. Carroll and J.-J. Chang, “Analysis of individual differences in multidimensional scaling via an n-way generalization of “eckart-young” decomposition,” Psychometrika , vol. 35, no. 3, pp. 283–319, 1970
1970
Earlier work this paper cites.
R. A. Harshman, “Foundations of the PARAFAC procedure: Models and conditions for an “ explanatory”
1970
Earlier work this paper cites.
M. Fannes, B. Nachtergaele, and R. Werner, “Finitely correlated states on quantum spin chains,” Communications in Mathematical Physics , vol. 144, no. 3, pp. 443–490, 1992
1992
Earlier work this paper cites.
A. Klümper, A. Schadschneider, and J. Zittartz, “Matrix product ground states for one-dimensional spin-1 quantum antiferromagnets,” EPL (Europhysics Letters) , vol. 24, no. 4, p. 293, 1993. [Online]. Available: http://stacks.iop.org/0295-5075/24/i=4/a=010
1993
Earlier work this paper cites.
C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, “Mixed-state entanglement and quantum error correction,” Phys. Rev. A , vol. 54, no. 5, pp. 3824–3851, Nov 1996
1996
Earlier work this paper cites.
M. Bertalmio, G. Sapiro, V. Caselles, and C. Ballester, “Image inpainting,” in Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques , ser. SIGGRAPH ’00. New York, NY, USA: ACM Press/Addison-Wesley Publishing Co., 2000, pp. 417–424
2000
Earlier work this paper cites.
M. Vasilescu and D. Terzopoulos, “Multilinear subspace analysis of image ensembles,” in 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition 2003. Proceedings. Institute of Electrical & Electronics Engineers (IEEE), 2003
2003
Earlier work this paper cites.
G. Vidal, “Efficient Simulation of One-Dimensional Quantum Many-Body Systems,” Phys. Rev. Lett. , vol. 93, no. 4, Jul 2004
2004
Earlier work this paper cites.
J.-T. Sun, H.-J. Zeng, H. Liu, Y. Lu, and Z. Chen, “Cubesvd: A novel approach to personalized web search,” in Proceedings of the 14th International Conference on World Wide Web , ser. WWW ’05. New York, NY, USA: ACM, 2005, pp. 382–390
2005
Earlier work this paper cites.
J. I. Latorre, “Image compression and entanglement,” arxiv , vol. abs/quant-ph/0510031, 2005
2005
Earlier work this paper cites.
N. Komodakis, “Image Completion Using Global Optimization,” in 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR) . Institute of Electrical & Electronics Engineers (IEEE), 2006
2006
Cited alongside, same era.
D. Perez-Garcia, F. Verstraete, M. M. Wolf, and J. I. Cirac, “Matrix product state representations,” Quantum Info. Comput. , vol. 7, no. 5, pp. 401–430, 2007
2007
Cited alongside, same era.
T. Korah and C. Rasmussen, “Spatiotemporal Inpainting for Recovering Texture Maps of Occluded Building Facades,” IEEE Transactions on Image Processing , vol. 16, no. 9, pp. 2262–2271, Sep 2007
2007
Cited alongside, same era.
M. Kurucz, A. A. Benczur, and K. Csalogany, “Methods for large scale SVD with missing values,” KDD Cup and Workshop at the 13th ACM SIGKDD Conference , 2007
2007
Cited alongside, same era.
M. Signoretto, L. De Lathauwer, and J. A. K. Suykens†, “Nuclear norms for tensors and their use for convex multilinear estimation,” ESAT-SISTA, K.U.Leuven (Leuven, Belgium), Tech. Rep., 2010
2010
Later among the works it cites.
I. V. Oseledets, “Tensor-Train Decomposition,” SIAM J. Sci. Comput. , vol. 33, no. 5, pp. 2295–2317, Jan 2011
2011
Later among the works it cites.
M. Signoretto, R. Van de Plas, B. De Moor, and J. Suykens, “Tensor versus matrix completion: A comparison with application to spectral data,” Signal Processing Letters, IEEE , vol. 18, no. 7, pp. 403–406, Jul 2011
2011
Later among the works it cites.
S. Gandy, B. Recht, and I. Yamada, “Tensor completion and low-n-rank tensor recovery via convex optimization,” Inverse Problems , vol. 27, no. 2, p. 025010, Jan 2011
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
T. G. Kolda and B. W. Bader, “Tensor decompositions and applications,” SIAM Review , vol. 51, no. 3, pp. 455–500, 2009
2009
Cited alongside, same era.
T. Franz, A. Schultz, S. Sizov, and S. Staab, “Triplerank: Ranking semantic web data by tensor decomposition,” in The Semantic Web - ISWC 2009 , ser. Lecture Notes in Computer Science, A. Bernstein, D. Karger, T. Heath, L. Feigenbaum, D. Maynard, E. Motta, and K. Thirunarayan, Eds. Springer Berlin Heidelberg, 2009, vol. 5823, pp. 213–228
2009
Cited alongside, same era.
S. Ma, D. Goldfarb, and L. Chen, “Fixed point and Bregman iterative methods for matrix rank minimization,” Mathematical Programming , vol. 128, no. 1-2, pp. 321–353, Sep 2009
2009
Cited alongside, same era.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information . Cambridge University Press (CUP), 2009
2009
Cited alongside, same era.
J.-F. Cai, E. J. Candès, and Z. Shen, “A Singular Value Thresholding Algorithm for Matrix Completion,” SIAM J. Optim. , vol. 20, no. 4, pp. 1956–1982, Jan 2010
2010
Cited alongside, same era.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization,” SIAM Rev. , vol. 52, no. 3, pp. 471–501, Jan 2010
2010
Cited alongside, same era.
T. Ryota, S. Taiji, K. Hayashi, and H. Kashima, “Statistical performance of convex tensor decomposition,” in Proceedings of the 25th Annual Conference on Neural Information Processing Systems (NIPS) , Dec 2011
2011
Later among the works it cites.
Z. Wen, W. Yin, and Y. Zhang, “Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm,” Mathematical Programming Computation , vol. 4, no. 4, pp. 333–361, Jul 2012
2012
Later among the works it cites.
J. Liu, P. Musialski, P. Wonka, and J. Ye, “Tensor completion for estimating missing values in visual data,” Pattern Analysis and Machine Intelligence, IEEE Transactions on , vol. 35, no. 1, pp. 208–220, Jan 2013
2013
Later among the works it cites.
H. Tan, B. Cheng, W. Wang, Y.-J. Zhang, and B. Ran, “Tensor completion via a multi-linear low-n-rank factorization model,” Neurocomputing , vol. 133, pp. 161–169, Jun 2014
2014
Later among the works it cites.
C. Mu, B. Huang, J. Wright, and D. Goldfarb, “Square deal: Lower bounds and improved relaxations for tensor recovery,” in Proceedings of the 31th International Conference on Machine Learning, ICML 2014, Beijing, China, 21-26 June 2014 , ser. JMLR Proceedings, vol. 32. JMLR.org, 2014, pp. 73–81
2014
Later among the works it cites.
Y. Xu, R. Hao, W. Yin, and Z. Su, “Parallel matrix factorization for low-rank tensor completion,” IPI , vol. 9, no. 2, pp. 601–624, Mar 2015
2015
Later among the works it cites.