메뉴 건너뛰기




Volumn 20, Issue 4, 2013, Pages 307-310

An efficient matrix factorization method for tensor completion

Author keywords

Low rank; nuclear norm minimization (NNM); tensor n rank; tensor completion

Indexed keywords

COMPUTATION COSTS; CONVEX RELAXATION; EFFECTIVENESS AND EFFICIENCIES; EVALUATION RESULTS; ITERATIVE SCHEMES; LOW RANK; MATRIX FACTORIZATIONS; NUCLEAR NORM MINIMIZATIONS; ORTHOGONALITY CONSTRAINTS; RANK MINIMIZATIONS; TENSOR COMPLETION;

EID: 84874642792     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/LSP.2013.2245416     Document Type: Article
Times cited : (53)

References (14)
  • 1
    • 4644268396 scopus 로고    scopus 로고
    • Dimensionality reduction in higherorder signal processing and rank-reduction in multilinear algebra
    • L. Lathauwer and J. Vandewalle, "Dimensionality reduction in higherorder signal processing and rank-reduction in multilinear algebra, " Lin. Algebra Appl., vol. 391, pp. 31-55, 2004
    • (2004) Lin. Algebra Appl. , vol.391 , pp. 31-55
    • Lathauwer, L.1    Vandewalle, J.2
  • 2
    • 84870175618 scopus 로고    scopus 로고
    • Tensor completion for estimating missing values in visual data
    • Jan.
    • J. Liu, P. Musialski, P. Wonka, and J. Ye, "Tensor completion for estimating missing values in visual data, " IEEE Trans. Patt. Anal. Mach. Intel., vol. 35, no. 1, pp. 208-220, Jan. 2013
    • (2013) IEEE Trans. Patt. Anal. Mach. Intel. , vol.35 , Issue.1 , pp. 208-220
    • Liu, J.1    Musialski, P.2    Wonka, P.3    Ye, J.4
  • 3
    • 79960865296 scopus 로고    scopus 로고
    • Applications of tensors (multiway array) factorizations and decompositions in data mining
    • M. Mørup, "Applications of tensors (multiway array) factorizations and decompositions in data mining, " Wiley Interdisciplinary Reviews: Data Mining Knowl. Disc., vol. 1, no. 1, pp. 24-40, 2011
    • (2011) Wiley Interdisciplinary Reviews: Data Mining Knowl. Disc. , vol.1 , Issue.1 , pp. 24-40
    • Mørup, M.1
  • 4
    • 68649096448 scopus 로고    scopus 로고
    • Tensor decompositions and applications
    • T. Kolda and B. Bader, "Tensor decompositions and applications, " SIAM Rev., vol. 51, no. 3, pp. 455-500, 2009
    • (2009) SIAM Rev. , vol.51 , Issue.3 , pp. 455-500
    • Kolda, T.1    Bader, B.2
  • 5
    • 57049095978 scopus 로고    scopus 로고
    • Unsupervised multiway data analysis: A literature survey
    • Jan.
    • E. Acar and B. Yener, "Unsupervised multiway data analysis: A literature survey, " IEEE Trans. Knowl. Data Eng., vol. 21, no. 1, pp. 6-20, Jan. 2009
    • (2009) IEEE Trans. Knowl. Data Eng. , vol.21 , Issue.1 , pp. 6-20
    • Acar, E.1    Yener, B.2
  • 6
    • 79952446596 scopus 로고    scopus 로고
    • Scalable tensor factorization for incomplete data
    • E. Acar, D. Dunlavy, T. Kolda, and M. Mørup, "Scalable tensor factorization for incomplete data, " Chemometr. Intell. Lab., vol. 106, no. 1, pp. 41-56, 2011
    • (2011) Chemometr. Intell. Lab. , vol.106 , Issue.1 , pp. 41-56
    • Acar, E.1    Dunlavy, D.2    Kolda, T.3    Mørup, M.4
  • 7
    • 79957617475 scopus 로고    scopus 로고
    • Tensor versus matrix completion: A comparison with application to spectral data
    • June
    • M. Signoretto, R. Plas, B. Moor, and J. Suykens, "Tensor versus matrix completion: A comparison with application to spectral data, " IEEE Signal Process. Lett., vol. 18, no. 7, pp. 403-406, June 2011
    • (2011) IEEE Signal Process. Lett. , vol.18 , Issue.7 , pp. 403-406
    • Signoretto, M.1    Plas, R.2    Moor, B.3    Suykens, J.4
  • 8
    • 79551661156 scopus 로고    scopus 로고
    • Tensor completion and low-n-rank tensor recovery via convex optimization
    • S. Gandy, B. Recht, and I. Yamada, "Tensor completion and low-n-rank tensor recovery via convex optimization, " Inv. Probl., vol. 27, no. 2, p. 025010, 2011
    • (2011) Inv. Probl. , vol.27 , Issue.2 , pp. 025010
    • Gandy, S.1    Recht, B.2    Yamada, I.3
  • 9
    • 84869205493 scopus 로고    scopus 로고
    • Solving a low-rank factorization model for matrix completion by a non-linear successive over-relaxation algorithm
    • Z. Wen, W. Yin, and Y. Zhang, "Solving a low-rank factorization model for matrix completion by a non-linear successive over-relaxation algorithm, " Math. Progr. . Comput., vol. 4, pp. 333-361, 2012
    • (2012) Math. Progr. . Comput. , vol.4 , pp. 333-361
    • Wen, Z.1    Yin, W.2    Zhang, Y.3
  • 10
    • 84886375708 scopus 로고    scopus 로고
    • Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
    • in press
    • Y. Shen, Z. Wen, and Y. Zhang, "Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization, " Optim. Method Softw., 2013, in press
    • (2013) Optim. Method Softw.
    • Shen, Y.1    Wen, Z.2    Zhang, Y.3
  • 11
    • 77951291046 scopus 로고    scopus 로고
    • A singular value thresholding algorithm for matrix completion
    • J. Cai, E. Candès, and Z. Shen, "A singular value thresholding algorithm for matrix completion, " SIAM J. Optim., vol. 20, no. 4, pp. 1956-1982, 2010
    • (2010) SIAM J. Optim. , vol.20 , Issue.4 , pp. 1956-1982
    • Cai, J.1    Candès, E.2    Shen, Z.3
  • 13
    • 0013953617 scopus 로고
    • Some mathematical notes on three-mode factor analysis
    • L. Tucker, "Some mathematical notes on three-mode factor analysis, " Psychometrika, vol. 31, pp. 279-311, 1966
    • (1966) Psychometrika , vol.31 , pp. 279-311
    • Tucker, L.1
  • 14
    • 0002740437 scopus 로고
    • Foundations of the PARAFAC procedure: Models and conditions for an Explanatory multi-modal factor analysis
    • R. Harshman, "Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-modal factor analysis, " UCLA Working Papers in Phonetics, vol. 16, pp. 1-84, 1970.
    • (1970) UCLA Working Papers in Phonetics , vol.16 , pp. 1-84
    • Harshman, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.