Generalizing the column-row matrix decomposition to multi-way arrays

Linear Algebra and Its Applications

Volumn 433, Issue 3, 2010, Pages 557-573

  Caiafa, Cesar F ^a   Cichocki, Andrzej ^a  

^a RIKEN BRAIN SCIENCE INSTITUTE   (Japan)

Author keywords

Large scale problems; Low rank approximation; N way array; Pseudo skeleton (CUR) matrix decomposition; Tucker tensor decomposition

Indexed keywords

APPROXIMATION METHODS; CORE TENSOR; EXISTENCE THEOREM; EXPLICIT FORMULA; LARGE-SCALE APPLICATIONS; LARGE-SCALE PROBLEM; LOW RANK APPROXIMATIONS; MATRIX; MATRIX DECOMPOSITION; NUMERICAL RESULTS; SUBMATRIX; TENSOR DECOMPOSITION;

ADAPTIVE ALGORITHMS; APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; FIBERS; MATRIX ALGEBRA; NUMERICAL ANALYSIS; NUMERICAL METHODS;

TENSORS;

EID: 77953154158     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2010.03.020     Document Type: Article

References (29)

1. Goreinov S.A., Tyrtyshnikov E.E., and Zamarashkin N.L. A theory of pseudoskeleton approximations. Linear Algebra Appl. 261 (1997) 1-21
2. Oseledets I.V., Savostianov D.V., and Tyrtyshnikov E.E. Tucker dimensionality reduction of three-dimensional arrays in linear time. SIAM J. Matrix Anal. Appl. 30 3 (2008) 939-956
3. Gantmacher F.R. Theory of Matrices (1959), Chelsea, New York
4. Goreinov S.A., and Tyrtyshnikov E.E. The maximal-volume concept in approximation by low-rank matrices. Contemp. Math. 280 (2001) 47-51
5. Goreinov S.A., Tyrtyshnikov E.E., and Zamarashkin N.L. Pseudo-skeleton approximations by matrices of maximal volume. Math. Notes 62 4 (1997) 515-519
6. De Lathauwer L., De Moor B., and Vandewalle J. On the best rank-1 and rank-(R 1, R 2, ... Rn) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl. 21 (2000) 1324-1342
7. Kolda T.G., and Bader B.W. Tensor decompositions and applications. SIAM Rev. 51 3 (2009) 455-500
8. Stewart G.W. Four algorithms for the efficient computation of truncated pivoted QR approximations to a sparse matrix. Numer. Math. 83 2 (1999) 313-323
9. Drineas P., Kannan R., and Mahoney M.W. Fast Monte Carlo algorithms for matrices III: computing a compressed approximate matrix decomposition. SIAM J. Comput. 36 (2006) 184-206
10. Drineas P., Mahoney M.W., and Muthukrishnan S. Relative-error CUR matrix decompositions. SIAM J. Matrix Anal. Appl. 30 2 (2008) 844-881
11. J. Sun, Y. Xie, H. Zhang, C. Faloutsos, Less is more: compact matrix decomposition for large sparse graphs, in: Proceedings of the 2007 SIAM International Conference on Data Mining (SDM), 2007.
12. Mahoney M.W., and Drineas P. CUR matrix decompositions for improved data analysis. Proc. Nat. Acad. Sci. 106 3 (2009) 697-702
13. Mahoney M.W., Maggioni M., and Drineas P. Tensor-CUR decompositions for tensor-based data. KDD '06: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA (2006), ACM 327-336
14. Mahoney M.W., Maggioni M., and Drineas P. Tensor-CUR decompositions for tensor-based data. SIAM J. Matrix Anal. Appl. 30 3 (2008) 957-987
15. E.E. Tyrtyshnikov, Low-rank structures and tensor approximations for huge-size data sets, in: Proceedings of the 8th Hellenic European Research on Computer Mathematics and its Applications Conferences - HERCMA 2007, Athens, 2007, pp. 1-9.
16. S.A. Goreinov, I.V. Oseledets, D.V. Savostyanov, E.E. Tyrtyshnikov, N.L. Zamarashkin, How to find a good submatrix, Research Report 08-12, ICM, 2008. .
17. Goreinov S.A. On cross approximation of multi-index arrays. Dokl. Math. 77 3 (2008) 404-406
18. Oseledets I.V., and Tyrtyshnikov E.E. Breaking the curse od dimensionality, or how to use SVD in many dimensions. SIAM J. Sci. Comput. 31 5 (2009) 3744-3759
19. I.V. Oseledets, Compact matrix form of the d-dimensional tensor decomposition, Preprint 2009-01, INM RAS, March 2009.
20. Tucker L.R. Implications of factor analysis of three-way matrices for measurement of change. In: Harris C.W. (Ed). Problems in Measuring Change (1963), University of Wisconsin Press 122-137
21. Tucker L.R. Some mathematical notes on three-mode factor analysis. Psychometrika 31 3 (1966) 279-311
22. De Lathauwer L., De Moor B., and Vandewalle J. A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21 (2000) 1253-1278
23. Carroll J.D., and Chang J.J. Analysis of individual differences in multidimensional scaling via an N-way generalization of Eckart-Young decomposition. Psychometrika 35 (1970) 283-319
24. R.A. Harshman, Foundations of the PARAFAC procedure: models and conditions for an exploratory multi-modal factor analysis, UCLA working papers in phonetics 16 (1970) 1-84.
25. Cichocki A., Zdunek R., Phan A.H., and Amari S.I. Nonnegative Matrix and Tensor Factorizations (2009), Wiley
26. Bartholdi J.J. A good submatrix is hard to find. Oper. Res. Lett. 1 5 (1982) 190-193
27. Tyrtyshnikov E.E. Incomplete cross approximation in the mosaic-skeleton method. Computing 64 4 (2000) 367-380
28. Ford J.M., and Tyrtyshnikov E.E. Combining Kronecker product approximation with discrete wavelet transforms to solve dense, function-related systems. SIAM J. Sci. Comput. 25 (2003) 961-981
29. B.W. Bader, T.G. Kolda, Matlab tensor toolbox version 2.2, January 2007. .