Factor matrix trace norm minimization for low-rank tensor completion

SIAM International Conference on Data Mining 2014, SDM 2014

Volumn 2, Issue , 2014, Pages 866-874

  Liu, Yuanyuan ^a   Shang, Fanhua ^a   Cheng, Hong ^a   Cheng, James ^a   Tong, Hanghang ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; LARGE DATASET; LEARNING TO RANK; SINGULAR VALUE DECOMPOSITION; TENSORS;

ALTERNATING DIRECTION METHOD OF MULTIPLIERS; COMPUTATIONAL COSTS; CONVEX COMBINATIONS; MATRIX RANK MINIMIZATIONS; MINIMIZATION METHODS; NUCLEAR NORM MINIMIZATIONS; RANK MINIMIZATIONS; STATE-OF-THE-ART APPROACH;

DATA MINING;

EID: 84959917731     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973440.99     Document Type: Conference Paper

References (33)

1. E. Acar, D. M. Dunlavy, T. G. Kolda, and M. Morup. Scalable tensor factorizations with missing data. In SDM, pp. 701-711, 2010.
2. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn., 3(1):1-122, 2011.
3. J. Cai, E. J. Candes, and Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM J. Optim., 20(4):1956-1982, 2010.
4. E. J. Candes and B. Recht. Exact matrix completion via convex optimization. Found. Comput. Math., 9(6):717-772, 2009.
5. E. J. Candes, and T. Tao. Decoding by linear programming. IEEE Trans. Inform. Theory, 51(2):4203-4215, 2009.
6. L. De Lathauwer. A link between the canonical decomposition in multilinear algebra and simultaneous matrix diagonalization. SIAM J. Matrix Anal. Appl., 28:642-666, 2006.
7. L. De Lathauwer and J. Vandewalle. Dimensionality reduction in higher-order signal processing and rank-(rl, r2,..., rn) reduction in multilinear algebra. Lin. Algebra. Appl., 391:31-55, 2004.
8. M. Fazel. Matrix rank minimization with applications. PhD Thesis, Stanford University, California, 2002.
9. M. Filipovic and A. Jukic. Tucker factorization with missing data with application to low-n-rank tensor completion. Multidim. Syst. Sign. Process., 2014.
10. S. Gandy, B. Recht, and I. Yamada. Tensor completion and low-n-rank tensor recovery via convex optimization. Inverse Problem, 27(2), 025010, 2011.
11. R. A. Harshman. Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-modal factor analysis. UCLA working papers in phonetics, 16:1-84, 1970.
12. B. He, M. Tao, and X. Yuan. Alternating direction method with Gaussian back substitution for separable convex programming. SIAM J. Optim., 22(2):313-340, 2012.
13. C. J. Hillar, L. H. Lim. Most tensor problems are NP hard. J. ACM, 45(6), 2013.
14. R. Bro, H. A. L. Kiers. A new efficient method for determining the number of components in PARAFAC models. J. Chemometrics, 17:274-286, 2003.
15. T. G. Kolda and B. W. Bader. Tensor decompositions and applications. SIAM Review, 51(3):455-500, 2009.
16. T. G. Kolda and J. Sun. Scalable tensor decompositions for multi-aspect data mining, in ICDM, pp. 363-372, 2008.
17. L. Lathauwer, B. Moor, and J. Vandewalle. A multilinear singular value decomposition. SIAM J. Matrix Anal. AppL, 21(4):1253-1278, 2000.
18. Z. Lin, M. Chen, and L. Wu. The augmented Lagrange multiplier method for exact recovery of corrupted lowrank matrices. Technical Report UILU-ENG-09-2215, Univ. Illinois, Urbana-Champaign, Oct. 2009.
19. J. Liu, P. Musialski, P. Wonka, and J. Ye. Tensor completion for estimating missing values in visual data. In ICCV, pp. 2114-2121, 2009.
20. J. Liu, P. Musialski, P. Wonka, and J. Ye. Tensor completion for estimating missing values in visual data. IEEE TPAMI, 35(1):208-220, 2013.
21. Y. Liu, L. C. Jiao, and F. Shang. A fast tri-factorization method for low-rank matrix recovery and completion. pattern recogn., 46(1):163-173, 2013.
22. M. Morup, L. K. Hansen, C. S. Herrmann, J. Parnas, and S. M. Arnfred. Parallel factor analysis as an exploratory tool for wavelet transformed event-related EEG. Neurolmage, 29(3):938-947, 2006.
23. A. Narita, K. Hayashi, R. Tomioka, and H. Kashima. Tensor facotiration using auxiliary information. DMKD, 25(2):298-324, 2012.
24. B. Recht, M. Fazel, and P. Parrilo. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review, 52(3):471-501, 2010.
25. F. Shang, L. C. Jiao, and F. Wang. Graph dual regularization non-negative matrix factorization for coclustering. pattern recogn., 45(6):2237-2250, 2012.
26. Y. Shen, Z. Wen, and Y. Zhang. Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization. Optim. Method Softw., 29(2):239-263, 2014.
27. M. Signoretto, Q. T. Dinh, L. D. Lathauwer, and J. Suykens. Learning with tensors: a framework based on covex optimization and spectral regulzation. Mach. Learn., in press, 2014.
28. M. Signoretto, L. D. Lathauwer, and J. Suykens. Nuclear norms for tensors and their use for convex multilinear estimation. Technical Report 10-186, ESAT-SISTA, K. U. Leuven, 2010.
29. J. Sun, S. Papadimitriou, C.-Y. Lin, N. Cao, S. Liu, and W. Qian. MultiVis: content-based social network exploration through multi-way visual analysis. In SDM, pp. 1063-1074, 2009.
30. L. Tang, X. Wang and H. Liu. Uncovering groups via heterogeneous interaction analysis. In ICDM, pp. 503-512, 2009.
31. L. R. Tucker. Some mathematical notes on three-mode factor analysis. Psychometrika, 31:279-311, 1966.
32. Z. Wen, W. Yin, and Y. Zhang. Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Prog. Comp., 4(4):333-361, 2012.
33. Y. K. Yilmaz, A. T. Cemgil, and U. Simsekli. Generalized coupled tensor factorization. In NIPS, pp. 2151-2159, 2011.