Tensor decompositions and applications

SIAM Review

Volumn 51, Issue 3, 2009, Pages 455-500

  Kolda, Tamara G ^a   Bader, Brett W ^b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Canonical decomposition (CANDECOMP); Higher order principal components analysis (Tucker); Higher order singular value decomposition (HOSVD); Multilinear algebra; Multiway arrays; Parallel factors (PARAFAC); Tensor decompositions

Indexed keywords

CANONICAL DECOMPOSITION (CANDECOMP); HIGHER-ORDER PRINCIPAL COMPONENTS ANALYSIS (TUCKER); HIGHER-ORDER SINGULAR VALUE DECOMPOSITION (HOSVD); MULTILINEAR ALGEBRA; MULTIWAY ARRAYS; PARALLEL FACTORS (PARAFAC); TENSOR DECOMPOSITIONS;

ALGEBRA; COMPUTER SOFTWARE; COMPUTER VISION; DECOMPOSITION; MINING; PRINCIPAL COMPONENT ANALYSIS; SIGNAL FILTERING AND PREDICTION; SIGNAL PROCESSING; SINGULAR VALUE DECOMPOSITION;

TENSORS;

EID: 68649096448     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/07070111X     Document Type: Review

References (244)

1. E. E. ABDALLAH, A. B. HAMZA, AND P. BHATTACHARYA, MPEG video watermarking using tensor singular value decomposition, in Image Analysis and Recognition, Lecture Notes in Comput. Sci. 4633, Springer, 2007, pp. 772-783.
2. E. ACAR, C.A. BINGOL, H. BINGOL, R. BRO, and B. YENER, Multiway analysis of epilepsy tensors, Bioinformatics, 23 (2007), pp. i10-i18.
3. E. ACAR, C.A. BINGOL, H. BINGOL, R. BRO, and B. YENER, Seizure recognition on epilepsy feature tensor, in EMBS 2007: Proceedings of the 29th Annual International Conference on Engineering in Medicine and Biology Society, IEEE, 2007, pp. 4273-4276.
4. E. ACAR, S.A. Çamtepe, M. S. KRISHNAMOORTHY, AND B. YENER, Modeling and multiway analysis of chatroom tensors, in ISI 2005: Proceedings of the IEEE International Conference on Intelligence and Security Informatics, Lecture Notes in Comput. Sci. 3495, Springer, 2005, pp. 256-268.
5. E. ACAR, S. A. Çamtepe, AND B. YENER, Collective sampling and analysis of high order tensors for chatroom communications, in ISI 2006: Proceedings of the IEEE International Conference on Intelligence and Security Informatics, Lecture Notes in Comput. Sci. 3975, Springer, 2006, pp. 213-224.
6. E. ACAR AND B. YENER, Unsupervised multiway data analysis: A literature survey, IEEE Trans. Knowledge Date Engrg., 21 (2009), pp. 6-20.
7. J. ALEXANDER AND A. HIRSCHOWITZ, Polynomial interpolation in several variables, J. Algebraic Geom., 4 (1995), pp. 201-222. Cited in [49].
8. A. H. ANDERSEN AND W. S. RAYENS, Structure-seeking multilinear methods for the analysis of fMRI data, NeuroImage, 22 (2004), pp. 728-739.
9. C. M. ANDERSEN AND R. BRO, Practical aspects of PARAFAC modeling of fluorescence excitation-emission data, J. Chemometrics, 17 (2003), pp. 200-215.
10. C. A. ANDERSSON AND R. BRO, Improving the speed of multi-way algorithms: Part I. Tucker3, Chemometrics and Intelligent Laboratory Systems, 42 (1998), pp. 93-103.
11. C. A. ANDERSSON AND R. BRO, The N-way toolbox for MATLAB, Chemometrics and Intelligent Laboratory Systems, 52 (2000), pp. 1-4. See also http://www.models.kvl.dk/source/nwaytoolbox/.
12. C. A. ANDERSSON AND R. HENRION, A general algorithm for obtaining simple structure of core arrays in N-way PCA with application to fluorimetric data, Comput. Statist. Data Anal., 31 (1999), pp. 255-278.
13. C. J. APPELLOF AND E. R. DAVIDSON, Strategies for analyzing data from video fluorometric monitoring of liquid chromatographic effluents, Anal. Chem., 53 (1981), pp. 2053-2056.
14. B. W. BADER, M. W. BERRY, AND M. BROWNE, Discussion tracking in Enron email using PARAFAC, in Survey of Text Mining: Clustering, Classification, and Retrieval, 2nd ed., M. W. Berry and M. Castellanos, eds., Springer, 2007, pp. 147-162.
15. B. W. BADER, R. A. HARSHMAN, AND T. G. KOLDA, Temporal analysis of semantic graphs using ASALSAN, in ICDM 2007: Proceedings of the 7th IEEE International Conference on Data Mining, 2007, pp. 33-42.
16. B. W. BADER AND T. G. KOLDA, Algorithm 862: MATLAB tensor classes for fast algorithm prototyping, ACM Trans. Math. Software, 32 (2006), pp. 635-653.
17. B. W. BADER AND T. G. KOLDA, Efficient MATLAB computations with sparse and factored tensors, SIAM J. Sci. Comput., 30 (2007), pp. 205-231.
18. B. W. BADER AND T. G. KOLDA, MATLAB Tensor Toolbox, Version 2.2. Available at http://csmr.ca.sandia.gov/~tgkolda/TensorToolbox/, 2007.
19. C. BAUCKHAGE, Robust tensor classifiers for color object recognition, in Image Analysis and Recognition, Lecture Notes in Comput. Sci. 4633, Springer, 2007, pp. 352-363.
20. C. BECKMANN AND S. SMITH, Tensorial extensions of independent component analysis for multisubject FMRI analysis, NeuroImage, 25 (2005), pp. 294-311.
21. M. W. BERRY, S. T. DUMAIS, AND G. W. O'BRIEN, Using linear algebra for intelligent information retrieval, SIAM Rev., 37 (1995), pp. 573-595.
22. G. BEYLKIN AND M. J. MOHLENKAMP, Numerical operator calculus in higher dimensions, Proc. Natl. Acad. Sci., 99 (2002), pp. 10246-10251.
23. G. BEYLKIN AND M. J. MOHLENKAMP, Algorithms for numerical analysis in high dimensions, SIAM J. Sci. Comput., 26 (2005), pp. 2133-2159.
24. D. BINI, The Role of Tensor Rank in the Complexity Analysis of Bilinear Forms, presentation at ICIAM07, Zürich, Switzerland, 2007. Available at http://www.stanford.edu/group/multilinear/bini.pdf.
25. 2.7799) complexity for n × n approximate matrix multiplication, Inform. Process. Lett., 8 (1979), pp. 234-235.
26. M. BLÄSER, On the complexity of the multiplication of matrices in small formats, J. Complexity, 19 (2003), pp. 43-60. Cited in [24].
27. R. BRO, PARAFAC. Tutorial and applications, Chemometrics and Intelligent Laboratory Systems, 38 (1997), pp. 149-171.
28. R. BRO, Multi-way Analysis in the Food Industry: Models, Algorithms, and Applications, Ph.D. thesis, University of Amsterdam, 1998. Available at http://www.models.kvl.dk/research/theses/.
29. R. BRO, Review on multiway analysis in chemistry - 2000-2005, Crit. Rev. Anal. Chem., 36 (2006), pp. 279-293.
30. R. BRO AND C. A. ANDERSSON, Improving the speed of multi-way algorithms: Part II. Compression, Chemometrics and Intelligent Laboratory Systems, 42 (1998), pp. 105-113.
31. R. BRO, C. A. ANDERSSON, AND H. A. L. KIERS, PARAFAC2 - Part II. Modeling chromatographic data with retention time shifts, J. Chemometrics, 13 (1999), pp. 295-309.
32. R. BRO AND S. DE JONG, A fast non-negativity-constrained least squares algorithm, J. Chemometrics, 11 (1997), pp. 393-401.
33. R. BRO, R. A. HARSHMAN, AND N. D. SIDIROPOULOS, Modeling Multi-way Data with Linearly Dependent Loadings, Tech. Report 2005-176, KVL, 2005. Cited in [6]. Available at http://www.telecom.tuc.gr/~nikos/paralindKVLTechnicalReport2005-176.pdf.
34. R. BRO AND H. A. L. KIERS, A new efficient method for determining the number of components in PARAFAC models, J. Chemometrics, 17 (2003), pp. 274-286.
35. R. BRO, N. SIDIROPOULOS, AND A. SMILDE, Maximum likelihood fitting using ordinary least squares algorithms, J. Chemometrics, 16 (2002), pp. 387-400.
36. R. BRO AND A. K. SMILDE, Centering and scaling in component analysis, Psychometrika, 17 (2003), pp. 16-33.
37. N. H. BSHOUTY, Maximal rank of m × n × (mn - k) tensors, SIAM J. Comput., 19 (1990), pp. 467-471.
38. J. D. CARROLL AND J. J. CHANG, Analysis of individual differences in multidimensional scaling via an N-way generalization of "Eckart-Young" decomposition, Psychometrika, 35 (1970), pp. 283-319.
39. J. D. CARROLL, S. PRUZANSKY, AND J. B. KRUSKAL, CANDELINC: A general approach to multidimensional analysis of many-way arrays with linear constraints on parameters, Psychometrika, 45 (1980), pp. 3-24.
40. R. B. CATTELL, Parallel proportional profiles and other principles for determining the choice of factors by rotation, Psychometrika, 9 (1944), pp. 267-283.
41. R. B. CATTELL, The three basic factor-analytic research designs - their interrelations and derivatives, Psych. Bull., 49 (1952), pp. 499-452.
42. E. CEULEMANS AND H. A. L. KIERS, Selecting among three-mode principal component models of different types and complexities: A numerical convex hull based method, British J. Math. Statist. Psych., 59 (2006), pp. 133-150.
43. B. CHEN, A. PETROPOLU, AND L. DE LATHAUWER, Blind identification of convolutive MIMO systems with 3 sources and 2 sensors, EURASIP J. Appl. Signal Process., 5 (2002), pp. 487-496.
44. P.A. CHEW, B.W. BADER, T.G. KOLDA, and A. ABDELALI, Cross-language information retrieval using PARAFAC2, in KDD '07: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, 2007, pp. 143-152.
45. A. CICHOCKI, R. ZDUNEK, S. CHOI, R. PLEMMONS, AND S.-I. AMARI, Non-negative tensor factorization using alpha and beta divergences, in ICASSP 07: Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, 2007, pp. III-1393-III-1396.
46. P. COMON, Independent component analysis, a new concept?, Signal Process., 36 (1994), pp. 287-314.
47. P. COMON, Tensor decompositions: State of the art and applications, in Mathematics in Signal Processing V, J. G. McWhirter and I. K. Proudler, eds., Oxford University Press, 2001, pp. 1-24.
48. P. COMON, Canonical Tensor Decompositions, I3S Report RR-2004-17, Lab. I3S, 2000 Route des Lucioles, B.P. 121, F-06903 Sophia-Antipolis cedex, France, 2004.
49. P. COMON, G. GOLUB, L.-H. LIM, AND B. MOURRAIN, Symmetric tensors and symmetric tensor rank, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 1254-1279.
50. P. COMON AND B. MOURRAIN, Decomposition of quantics in sums of powers of linear forms, Signal Process., 53 (1996), pp. 93-107.
51. P. COMON, J. M. F. TEN BERGE, L. DE LATHAUWER, AND J. CASTAING, Generic and typical ranks of multi-way arrays, Linear Algebra Appl., 430 (2009), pp. 2997-3007.
52. R. COPPI AND S. BOLASCO, eds., Multiway Data Analysis, North-Holland, Amsterdam, 1989.
53. A. DE ALMEIDA, G. FAVIER, AND J. ao MOTA, The Constrained Block-PARAFAC Decomposition. Presentation at TRICAP2006, Chania, Greece. Available online at http://www.telecom.tuc.gr/ ~nikos/TRICAP2006main/TRICAP2006Almeida.pdf, June 2006.
54. W. F. de la VEGA, M. KARPINSKI, R. KANNAN, AND S. VEMPALA, Tensor decomposition and approximation schemes for constraint satisfaction problems, in STOC '05: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, ACM Press, 2005, pp. 747-754.
55. L. DE LATHAUWER, A link between the canonical decomposition in multilinear algebra and simultaneous matrix diagonalization, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 642-666.
56. L. DE LATHAUWER, Decompositions of a higher-order tensor in block terms - Part I: Lemmas for partitioned matrices, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 1022-1032.
57. L. DE LATHAUWER, Decompositions of a higher-order tensor in block terms - Part II: Definitions and uniqueness, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 1033-1066.
58. L. DE LATHAUWER AND J. CASTAING, Blind identification of underdetermined mixtures by simultaneous matrix diagonalization, IEEE Trans. Signal Process., 56 (2008), pp. 1096-1105.
59. L. DE LATHAUWER AND J. CASTAING, Tensor-based techniques for the blind separation of DS-CDMA signal, Signal Process., 87 (2007), pp. 322-336.
60. L. DE LATHAUWER, J. CASTAING, AND J.-F. CARDOSO, Fourth-order cumulant based blind identification of underdetermined mixtures, IEEE Trans. Signal Process., 55 (2007), pp. 2965-2973.
61. L. DE LATHAUWER AND A. de BAYNAST, Blind deconvolution of DS-CDMA signals by means of decomposition in rank-(1, L, L) terms, IEEE Trans. Signal Process., 56 (2008), pp. 1562-1571.
62. L. DE LATHAUWER AND B. DE MOOR, From matrix to tensor: Multilinear algebra and signal processing, in Mathematics in Signal Processing IV, J. McWhirter and I. Proudler, eds., Clarendon Press, Oxford, 1998, pp. 1-15.
63. L. DE LATHAUWER, B. DE MOOR, AND J. VANDEWALLE, A multilinear singular value decomposition, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 1253-1278.
64. N) approximation of higher-order tensors, SIAMJ. MatrixAnal. Appl., 21 (2000), pp. 1324-1342.
65. L. DE LATHAUWER, B. DE MOOR, AND J. VANDEWALLE, Independent component analysis and (simultaneous) third-order tensor diagonalization, IEEE Trans. Signal Process., 49 (2001), pp. 2262-2271.
66. L. DE LATHAUWER, B. DE MOOR, AND J. VANDEWALLE, Computation of the canonical decomposition by means of a simultaneous generalized Schur decomposition, SIAMJ. Matrix Anal. Appl., 26 (2004), pp. 295-327.
67. L. DE LATHAUWER AND D. NION, Decompositions of a higher-order tensor in block terms - Part III: Alternating least squares algorithms, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 1067-1083.
68. N) reduction in multilinear algebra, Linear Algebra Appl., 391 (2004), pp. 31-55.
69. V. DE SILVA AND L.-H. LIM, Tensor rank and the ill-posedness of the best low-rank approximation problem, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 1084-1127.
70. M. DE VOS, L. DE LATHAUWER, B. VANRUMSTE, S. VAN HUFFEL, AND W. VAN PAESSCHEN, Canonical decomposition of ictal scalp EEG and accurate source localisation: Principles and simulation study, Comput. Intelligence Neurosci., 2007 (2007), pp. 1-8.
71. M. DE VOS, A. VERGULT, L. DE LATHAUWER, W. DE CLERCQ, S. VAN HUFFEL, P. DUPONT, A. PALMINI, AND W. VAN PAESSCHEN, Canonical decomposition of ictal scalp EEG reliably detects the seizure onset zone, NeuroImage, 37 (2007), pp. 844-854.
72. S. C. DEERWESTER, S. T. DUMAIS, T. K. LANDAUER, G. W. FURNAS, AND R. A. HARSHMAN, Indexing by latent semantic analysis, J. Amer. Soc. Inform. Sci., 41 (1990), pp. 391-407.
73. A. DOOSTAN, G. IACCARINO, AND N. ETEMADI, A least-squares approximation of high-dimensional uncertain systems, in Annual Research Briefs, Center for Turbulence Research, Stanford University, 2007, pp. 121-132.
74. P. DRINEAS AND M. W. MAHONEY, A randomized algorithm for a tensor-based generalization of the singular value decomposition, Linear Algebra Appl., 420 (2007), pp. 553-571.
75. S. T. DUMAIS, G. W. FURNAS, T. K. LANDAUER, S. DEERWESTER, AND R. HARSHMAN, Using latent semantic analysis to improve access to textual information, in CHI '88: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, ACM Press, 1988, pp. 281-285.
76. G. ECKART AND G. YOUNG, The approximation of one matrix by another of lower rank, Psychometrika, 1 (1936), pp. 211-218.
77. 3) approximation of a tensor, SIAM J. Matrix Anal. Appl., 31 (2009), pp. 248-271.
78. N. K. M. FABER, R. BRO, AND P. K. HOPKE, Recent developments in CANDECOMP/PARAFAC algorithms: A critical review, Chemometrics and Intelligent Laboratory Systems, 65 (2003), pp. 119-137.
79. A. S. FIELD AND D. GRAUPE, Topographic component (parallel factor) analysis of multi-channel evoked potentials: Practical issues in trilinear spatiotemporal decomposition, Brain Topography, 3 (1991), pp. 407-423.
80. D. FITZGERALD, M. CRANITCH, AND E. COYLE, Non-negative tensor factorisation for sound source separation, in ISSC 2005: Proceedings of the Irish Signals and Systems Conference, 2005. Available at http://eleceng.dit.ie/papers/35.pdf.
81. M. P. FRIEDLANDER AND K. HATZ, Computing nonnegative tensor factorizations, Comput. Optim. Appl., 23 (2008), pp. 631-647.
82. R. FURUKAWA, H. KAWASAKI, K. IKEUCHI, AND M. SAKAUCHI, Appearance based object modeling using texture database: Acquisition, compression and rendering, in EGRW '02: Proceedings of the 13th Eurographics Workshop on Rendering, Aire-la-Ville, Switzerland, Eurographics Association, 2002, pp. 257-266.
83. R. GARCIA AND A. LUMSDAINE, MultiArray: A C++ library for generic programming with arrays, Software Practice Experience, 35 (2004), pp. 159-188.
84. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, Johns Hopkins University Press, Baltimore, MD, 1996.
85. S. GOURVÉNEC, G. TOMASI, C. DURVILLE, E. DICRESCENZO, C. SABY, D. MASSART, R. BRO, AND G. OPPENHEIM, CuBatch, a MATLAB interface for n-mode data analysis, Chemometrics and Intelligent Laboratory Systems, 77 (2005), pp. 122-130.
86. L. GRASEDYCK, Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure, Computing, 72 (2004), pp. 247-265.
87. V. S. GRIGORASCU AND P. A. REGALIA, Tensor displacement structures and polyspectral matching, in Fast Reliable Algorithms for Matrices with Structure, T. Kaliath and A. H. Sayed, eds., SIAM, Philadelphia, 1999, pp. 245-276.
88. W. HACKBUSCH AND B. N. KHOROMSKIJ, Tensor-product approximation to operators and functions in high dimensions, J. Complexity, 23 (2007), pp. 697-714.
89. W. HACKBUSCH, B. N. KHOROMSKIJ, AND E. E. TYRTYSHNIKOV, Hierarchical Kronecker tensor-product approximations, J. Numer. Math., 13 (2005), pp. 119-156.
90. R. A. HARSHMAN, Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-modal factor analysis, UCLA Working Papers in Phonetics, 16 (1970), pp. 1-84. Available at http://publish.uwo.ca/~harshman/wpppfac0.pdf.
91. R. A. HARSHMAN, Determination and proof of minimum uniqueness conditions for PARAFAC1, UCLA Working Papers in Phonetics, 22 (1972), pp. 111-117. Available from http://publish.uwo.ca/~harshman/wpppfac1.pdf.
92. R. A. HARSHMAN, PARAFAC2: Mathematical and technical notes, UCLA Working Papersin Phonetics, 22 (1972), pp. 30-47.
93. R. A. HARSHMAN, Models for analysis of asymmetrical relationships among N objects or stimuli, in First Joint Meeting of the Psychometric Society and the Society for Mathematical Psychology, McMaster University, Hamilton, Ontario, 1978. Available at http://publish.uwo.ca/ ~harshman/asym1978.pdf.
94. R. A. HARSHMAN, An index formulism that generalizes the capabilities of matrix notation and algebra to n-way arrays, J. Chemometrics, 15 (2001), pp. 689-714.
95. R. A. HARSHMAN, P. E. GREEN, Y. WIND, AND M. E. LUNDY, A model for the analysis of asymmetric data in marketing research, Market. Sci., 1 (1982), pp. 205-242.
96. R. A. HARSHMAN AND S. HONG, "Stretch" vs. "slice" methods for representing three-way structure via matrix notation, J. Chemometrics, 16 (2002), pp. 198-205.
97. R. A. HARSHMAN, S. HONG, AND M. E. LUNDY, Shifted factor analysis - Part I: Models and properties, J. Chemometrics, 17 (2003), pp. 363-378.
98. R. A. HARSHMAN AND M. E. LUNDY, Data preprocessing and the extended PARAFAC model, in Research Methods for Multi-mode Data Analysis, H.G. Law, C.W. Snyder, J. Hattie, and R. K. McDonald, eds., Praeger Publishers, New York, 1984, pp. 216-284.
99. R. A. HARSHMAN AND M. E. LUNDY, Three-Way DEDICOM: Analyzing Multiple Matrices of Asymmetric Relationships, paper presented at the Annual Meeting of the North American Psychometric Society, 1992.
100. R. A. HARSHMAN AND M. E. LUNDY, Uniqueness proof for a family of models sharing features of Tucker's three-mode factor analysis and PARAFAC/CANDECOMP, Psychometrika, 61 (1996), pp. 133-154.
101. J. HÅSTAD, Tensor rank is NP-complete, J. Algorithms, 11 (1990), pp. 644-654.
102. T. HAZAN, S. POLAK, AND A. SHASHUA, Sparse image coding using a 3D non-negative tensor factorization, in ICCV 2005: Proceedings of the 10th IEEE International Conference on Computer Vision, Vol. 1, IEEE Computer Society Press, 2005, pp. 50-57.
103. R. HENRION, Body diagonalization of core matrices in three-way principal components analysis: Theoretical bounds and simulation, J. Chemometrics, 7 (1993), pp. 477-494.
104. R. HENRION, N-way principal component analysis theory, algorithms and applications, Chemometrics and Intelligent Laboratory Systems, 25 (1994), pp. 1-23.
105. F. L. HITCHCOCK, The expression of a tensor or a polyadic as a sum of products, J. Math. Phys., 6 (1927), pp. 164-189.
106. F. L. HITCHCOCK, Multilple invariants and generalized rank of a p-way matrix or tensor, J. Math. Phys., 7 (1927), pp. 39-79.
107. T. D. HOWELL, Global properties of tensor rank, Linear Algebra Appl., 22 (1978), pp. 9-23.
108. I. IBRAGHIMOV, Application of the three-way decomposition for matrix compression, Numer. Linear Algebra Appl., 9 (2002), pp. 551-565.
109. J. JÁJÁ, Optimal evaluation of pairs of bilinear forms, SIAM J. Comput., 8 (1979), pp. 443-462.
110. J. JIANG, H. WU, Y. LI, AND R. YU, Three-way data resolution by alternating slice-wise diagonalization (ASD) method, J. Chemometrics, 14 (2000), pp. 15-36.
111. T. JIANG AND N. SIDIROPOULOS, Kruskal's permutation lemma and the identification of CANDECOMP/PARAFAC and bilinear models with constant modulus constraints, IEEE Trans. Signal Process., 52 (2004), pp. 2625-2636.
112. H. KAISER, The varimax criterion for analytic rotation in factor analysis, Psychometrika, 23 (1958), pp. 187-200.
113. A. KAPTEYN, H. NEUDECKER, AND T. WANSBEEK, An approach to n-mode components analysis, Psychometrika, 51 (1986), pp. 269-275.
114. d, Comput. Methods Appl. Math., 6 (2006), pp. 194-220.
115. B. N. KHOROMSKIJ AND V. KHOROMSKAIA, Low rank Tucker-type tensor approximation to classical potentials, Central European J. Math., 5 (2007), pp. 523-550.
116. H. A. L. KIERS, An alternating least squares algorithm for fitting the two- and three-way DEDICOM model and the IDIOSCAL model, Psychometrika, 54 (1989), pp. 515-521.
117. H. A. L. KIERS, TUCKALS core rotations and constrained TUCKALS modelling, Statistica Appl., 4 (1992), pp. 659-667.
118. H. A. L. KIERS, An alternating least squares algorithm for PARAFAC2 and three-way DEDICOM, Comput. Statist. Data. Anal., 16 (1993), pp. 103-118.
119. H. A. L. KIERS, Weighted least squares fitting using ordinary least squares algorithms, Psychometrika, 62 (1997), pp. 215-266.
120. H. A. L. KIERS, Joint orthomax rotation of the core and component matrices resulting from three-mode principal components analysis, J. Classification, 15 (1998), pp. 245-263.
121. H. A. L. KIERS, A three-stepalgorithm for CANDECOMP/PARAFAC analysis of large data sets with multicollinearity, J. Chemometrics, 12 (1998), pp. 255-171.
122. H. A. L. KIERS, Towards a standardized notation and terminology in multiway analysis, J. Chemometrics, 14 (2000), pp. 105-122.
123. H. A. L. KIERS AND A. DER KINDEREN, A fast method for choosing the numbers of components in Tucker3 analysis, British J. Math. Statist. Psych., 56 (2003), pp. 119-125.
124. H. A. L. KIERS AND R. A. HARSHMAN, Relating two proposed methods for speedup of algorithms for fitting two- and three-way principal component and related multilinear models, Chemometrics and Intelligent Laboratory Systems, 36 (1997), pp. 31-40.
125. H. A. L. KIERS AND Y. TAKANE, Constrained DEDICOM, Psychometrika, 58 (1993), pp. 339-355.
126. H. A. L. KIERS, J. M. F. TEN BERGE, AND R. BRO, PARAFAC2 - Part I. A direct fitting algorithm for the PARAFAC2 model, J. Chemometrics, 13 (1999), pp. 275-294.
127. H. A. L. KIERS, J. M. F. ten BERGE, AND R. ROCCI, Uniqueness of three-mode factor models with sparse cores: The 3 × 3 × 3 case, Psychometrika, 62 (1997), pp. 349-374.
128. H. A. L. KIERS, J. M. F. ten BERGE, Y. TAKANE, AND J. de LEEUW, A generalization of Takane's algorithm for DEDICOM, Psychometrika, 55 (1990), pp. 151-158.
129. H. A. L. KIERS AND I. VAN MECHELEN, Three-way component analysis: Principles and illustrative application, Psych. Methods, 6 (2001), pp. 84-110.
130. D. E. KNUTH, The Art of Computer Programming: Seminumerical Algorithms, Vol. 2, 3rded., Addison-Wesley, Reading, MA, 1997.
131. E. KOFIDIS AND P. A. REGALIA, On the best rank- 1 approximation of higher-order supersymmetric tensors, SIAM J. Matrix Anal. Appl., 23 (2002), pp. 863-884.
132. T. G. KOLDA, Orthogonal tensor decompositions, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 243-255.
133. T. G. KOLDA, A counterexample to the possibility of an extension of the Eckart-Young low-rank approximation theorem for the orthogonal rank tensor decomposition, SIAMJ. Matrix Anal. Appl., 24 (2003), pp. 762-767.
134. T. G. KOLDA, Multilinear Operators for Higher-Order Decompositions, Tech. Report SAND2006-2081, Sandia National Laboratories, Albuquerque, NM, Livermore, CA, 2006.
135. T. G. KOLDA AND B. W. BADER, The TOPHITS model for higher-order web link analysis, in Workshop on Link Analysis, Counterterrorism and Security, 2006. Available at http://www.cs.rit.edu/~amt/ linkanalysis06/accepted/21.pdf.
136. T. G. KOLDA, B. W. BADER, AND J. P. KENNY, Higher-order web link analysis using multilinear algebra, in ICDM 2005: Proceedings of the 5th IEEE International Conference on Data Mining, IEEE Computer Society Press, 2005, pp. 242-249.
137. W. P. KRIJNEN, Convergence of the sequence of parameters generated by alternating least squares algorithms, Comput. Statist. Data Anal., 51 (2006), pp. 481-489. Cited by [205].
138. P. M. KROONENBERG, Three-Mode Principal Component Analysis: Theory and Applications, DWO Press, Leiden, The Netherlands, 1983. Available at http://three-mode.leidenuniv.nl/bibliogr/kroonenbergpm thesis/index.html.
139. P. M. KROONENBERG, Applied Multiway Data Analysis, Wiley, New York, 2008.
140. P. M. KROONENBERG AND J. DE LEEUW, Principal component analysis of three-mode data by means of alternating least squares algorithms, Psychometrika, 45 (1980), pp. 69-97.
141. J. B. KRUSKAL, Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics, Linear Algebra Appl., 18 (1977), pp. 95-138.
142. J. B. KRUSKAL, Statement of Some Current Results about Three-Way Arrays, manuscript, AT & T Bell Laboratories, Murray Hill, NJ. Available at http://three-mode.leidenuniv.nl/pdf/k/kruskal1983.pdf, 1983.
143. J. B. KRUSKAL, Rank, decomposition, and uniqueness for 3-way and N-way arrays, in Multiway Data Analysis, R. Coppi and S. Bolasco, eds., North-Holland, Amsterdam, 1989, pp. 7-18.
144. J. B. KRUSKAL, R. A. HARSHMAN, AND M. E. LUNDY, How 3-MFA can cause degenerate PARAFAC solutions, among other relationships, in Multiway Data Analysis, R. Coppi and S. Bolasco, eds., North-Holland, Amsterdam, 1989, pp. 115-121.
145. J. D. LADERMAN, A noncommutative algorithm for multiplying 3 × 3 matrices using 23 multiplications, Bull. Amer. Math. Soc., 82 (1976), pp. 126-128. Cited in [24].
146. W. LANDRY, Implementing a high performance tensor library, Sci. Programming, 11 (2003), pp. 273-290.
147. J. M. LANDSBERG, The border rank of the multiplication of 2 × 2 matrices is seven, J. Amer. Math. Soc., 19 (2005), pp. 447-459.
148. J. M. LANDSBERG, Geometry and the complexity of matrix multiplication, Bull. Amer. Math. Soc. (N.S.), 45 (2008), pp. 247-284. Available at http://www.math.tamu.edu/~jml/msurvey0407.pdf.
149. A. N. LANGVILLE AND W. J. STEWART, A Kronecker product approximate precondition for SANs, Numer. Linear Algebra Appl., 11 (2004), pp. 723-752.
150. C. L. LAWSON AND R. J. HANSON, Solving Least Squares Problems, Prentice-Hall, Englewood Cliffs, NJ, 1974.
151. D. D. LEE AND H. S. SEUNG, Learning the parts of objects by non-negative matrix factorization, Nature, 401 (1999), pp. 788-791.
152. S. LEURGANS AND R. T. ROSS, Multilinear models: Applications in spectroscopy, Statist. Sci., 7 (1992), pp. 289-310.
153. J. LEVIN, Three-Mode Factor Analysis, Ph.D. thesis, University of Illinois, Urbana, 1963. Cited in [226, 140].
154. L.-H. LIM, Singular values and eigenvalues of tensors: A variational approach, in CAM-SAP2005:1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005, pp. 129-132.
155. C.-Y. LIN, Y.-C. CHUNG, AND J.-S. LIU, Efficient data compression methods for multidimensional sparse array operations based on the EKMR scheme, IEEE Trans. Comput., 52 (2003), pp. 1640-1646.
156. C.-Y. LIN, J.-S. LIU, AND Y.-C. CHUNG, Efficient representation scheme for multidimensional array operations, IEEE Trans. Comput., 51 (2002), pp. 327-345.
157. N. LIU, B. ZHANG, J. YAN, Z. CHEN, W. LIU, F. BAI, AND L. CHIEN, Text representation: From vector to tensor, in ICDM 2005: Proceedings of the 5th IEEE International Conference on Data Mining, IEEE Computer Society Press, 2005, pp. 725-728.
158. X. LIU AND N. SIDIROPOULOS, Cramér-Rao lower bounds for low-rank decomposition of multidimensional arrays, IEEE Trans. Signal Process., 49 (2001), pp. 2074-2086.
159. M. E. LUNDY, R. A. HARSHMAN, AND J. B. KRUSKAL, A two-stage procedure incorporating good features of both trilinear and quadrilinear methods, in Multiway Data Analysis, R. Coppi and S. Bolasco, eds., North-Holland, Amsterdam, 1989, pp. 123-130.
160. M. E. LUNDY, R. A. HARSHMAN, P. PAATERO, AND L. SWARTZMAN, Application of the 3-way DEDICOM Model to Skew-Symmetric Data for Paired Preference Ratings of Treatments for Chronic Back Pain, presentation at TRICAP2003, Lexington, Kentucky, 2003. Available at http://publish.uwo.ca/~harshman/tricap03.pdf.
161. M. W. MAHONEY, M. MAGGIONI, AND P. DRINEAS, Tensor-CUR decompositions for tensorbased data, in KDD '06: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, 2006, pp. 327-336.
162. C. D. M. MARTIN AND C. F. VAN LOAN, A Jacobi-type method for computing orthogonal tensor decompositions, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 1219-1232. Available from http://www.cam.cornell.edu/~carlam/academic/JACOBI3waypaper.pdf, 2006.
163. E. MARTÍNEZ-MONTES, P. A. VALDÉ S-SOSA, F. MIWAKEICHI, R. I. GOLDMAN, AND M. S. COHEN, Concurrent EEG/fMRI analysis by multiway partial least squares, NeuroImage, 22 (2004), pp. 1023-1034.
164. B. C. MITCHELL AND D. S. BURDICK, Slowly converging PARAFAC sequences: Swamps and two-factor degeneracies, J. Chemometrics, 8 (1994), pp. 155-168.
165. F. MIWAKEICHI, E. MARTÍNEZ-MONTES, P. A. VALDÉS-SOSA, N. NISHIYAMA, H. MIZUHARA, AND Y. YAMAGUCHI, Decomposing EEG data into space-time-frequency components using parallel factor analysis, NeuroImage, 22 (2004), pp. 1035-1045.
166. J. MÖCKS, Topographic components model for event-related potentials and some biophysical considerations, IEEE Trans. Biomed. Engrg., 35 (1988), pp. 482-484.
167. M. MØRUP, L. HANSEN, J. PARNAS, AND S. M. ARNFRED, Decomposing the time-frequency representation of EEG using nonnegative matrix and multi-way factorization. Available at http://www2.imm.dtu.dk/pubdb/views/edocdownload.php/4144/pdf/ imm4144.pdf, 2006.
168. M. MøRUP, L. K. HANSEN, AND S. M. ARNFRED, Algorithms for Sparse Non-negative TUCKER (also named HONMF), Tech. Report IMM4658, Technical University of Denmark, 2006.
169. M. MØRUP, L. K. HANSEN, AND S. M. ARNFRED, ERPWAVELAB: A toolbox for multi-channel analysis of time-frequency transformed event related potentials, J. Neurosci. Methods, 161 (2007), pp. 361-368.
170. M. MØRUP, 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, NeuroImage, 29 (2006), pp. 938-947.
171. M. MØRUP, M. N. SCHMIDT, AND L. K. HANSEN, Shift Invariant Sparse Coding of Image and Music Data, Tech. report, Technical University of Denmark, 2007. Cited in [6].
172. T. MURAKAMI, J.M.F. TENBERGE, and H.A.L. KIERS, A case of extreme simplicity of the core matrix in three-mode principal components analysis, Psychometrika, 63 (1998), pp. 255-261.
173. D. MUTI AND S. BOURENNANE, Multidimensional filtering based on a tensor approach, Signal Process., 85 (2005), pp. 2338-2353.
174. J. G. NAGY AND M. E. KILMER, Kronecker product approximation in three-dimensional imaging applications, IEEE Trans. Image Process., 15 (2006), pp. 604-613.
175. M. N. L. NARASIMHAN, Principles of Continuum Mechanics, John Wiley & Sons, New York, 1993.
176. C. NAVASCA, L. DE LATHAUWER, AND S. KINDERMAN, Swampreducing technique for tensor decompositions, submitted for publication (2008).
177. D. NION AND L. DE LATHAUWER, An enhanced line search scheme for complex-valued tensor decompositions. application in DS-CDMA, Signal Process., 88 (2008), pp. 749-755.
178. P. PAATERO, A weighted non-negative least squares algorithm for three-way "PARAFAC" factor analysis, Chemometrics and Intelligent Laboratory Systems, 38 (1997), pp. 223-242.
179. P. PAATERO, The multilinear engine: A table-driven, least squares program for solving multilinear problems, including the n-way parallel factor analysis model, J. Comput. Graphical Statist., 8 (1999), pp. 854-888.
180. P. PAATERO, Construction and analysis of degenerate PARAFAC models, J. Chemometrics, 14 (2000), pp. 285-299.
181. P. PAATERO AND U. TAPPER, Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values, Environmetrics, 5 (1994), pp. 111-126.
182. V. PEREYRA AND G. SCHERER, Efficient computer manipulation of tensor products with applications to multidimensional approximation, Math. Comp., 27 (1973), pp. 595-605.
183. L. QI, Eigenvalues of a real supersymmetric tensor, J. Symb. Comput., 40 (2005), pp. 1302-1324. Cited by [154].
184. L. QI, W. SUN, AND Y. WANG, Numerical multilinear algebra and its applications, Front. Math. China, 2 (2007), pp. 501-526.
185. M. RAJIH AND P. COMON, Enhanced line search: A novel method to accelerate PARAFAC, in EUSIPCO-05: Proceedings of the 13th European Signal Processing Conference, 2005. Available at http://www.eurasip. org/Proceedings/Eusipco/Eusipco2005/defevent/papers/cr1102.pdf.
186. W. S. RAYENS AND B. C. MITCHELL, Two-factor degeneracies and a stabilization of PARAFAC, Chemometrics and Intelligent Laboratory Systems, 38 (1997), p. 173.
187. R. ROCCI, A general algorithm to fit constrained DEDICOM models, Statist. Methods Appl., 13 (2004), pp. 139-150.
188. J. R. RUÍZ-TOLOSA AND E. CASTILLO, From Vectors to Tensors, Universitext, Springer, Berlin, 2005.
189. E. SANCHEZ AND B. R. KOWALSKI, Tensorial resolution: A direct trilinear decomposition, J. Chemometrics, 4 (1990), pp. 29-45.
190. B. SAVAS, Analyses and Tests of Handwritten Digit Recognition Algorithms, Master's thesis, Linköping University, Linköping, Sweden, 2003.
191. B. SAVAS AND L. ELDÉN, Handwritten digit classification using higher order singular value decomposition, Pattern
192. A. SCHÖNHAGE, Partial and total matrix multiplication, SIAM J. Comput., 10 (1981), pp. 434-455. Cited in [24, 148].
193. A. SHASHUA AND T. HAZAN, Non-negative tensor factorization with applications to statistics and computer vision, in ICML 2005: Proceedings of the 22nd International Conference on Machine Learning, 2005, pp. 792-799.
194. A. SHASHUA AND A. LEVIN, Linear image coding for regression and classification using the tensor-rank principle, in CVPR 2001: Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2001, pp. 42-49.
195. A. SHASHUA, R. ZASS, AND T. HAZAN, Multi-way clustering using super-symmetric non-negative tensor factorization, in ECCV 2006: Proceedings of the 9th European Conference on Computer Vision, Part IV, 2006, pp. 595-608.
196. N. SIDIROPOULOS, R. BRO, AND G. GIANNAKIS, Parallel factor analysis in sensor array processing, IEEE Trans. Signal Process., 48 (2000), pp. 2377-2388.
197. N. SIDIROPOULOS AND R. BUDAMPATI, Khatri-Rao space-time codes, IEEE Trans. Signal Process., 50 (2002), pp. 2396-2407.
198. N. SIDIROPOULOS, G. GIANNAKIS, AND R. BRO, Blind PARAFAC receivers for DS-CDMA systems, IEEE Trans. Signal Process., 48 (2000), pp. 810-823.
199. N. D. SIDIROPOULOS AND R. BRO, On the uniqueness of multilinear decomposition of N-way arrays, J. Chemometrics, 14 (2000), pp. 229-239.
200. A. SMILDE, R. BRO, AND P. GELADI, Multi-Way Analysis: Applications in the Chemical Sciences, Wiley, West Sussex, England, 2004.
201. A. K. SMILDE, Y. WANG, AND B. R. KOWALSKI, Theory of medium-rank second-order calibration with restricted-Tucker models, J. Chemometrics, 8 (1994), pp. 21-36.
202. A. STEGEMAN, Degeneracy in CANDECOMP/PARAFAC explained for p × p × 2 arrays of rank p +1 or higher, Psychometrika, 71 (2006), pp. 483-501.
203. A. STEGEMAN, Comparing Independent Component Analysis and the PARAFAC Model for Artificial Multi-subject fMRI Data, Tech. report, Heymans Institute for Psychological Research, University of Groningen, The Netherlands, 2007.
204. A. STEGEMAN, Degeneracy in CANDECOMP/PARAFAC and INDSCAL explained for several three-sliced arrays with a two-valued typical rank, Psychometrika, 72 (2007), pp. 601-619.
205. A. STEGEMAN AND L. DE LATHAUWER, A method to avoid diverging components in the CANDECOMP/PARAFAC model for generic I × J ×2 arrays, SIAM J. Matrix Anal. Appl., 30 (2009), pp. 1614-1638.
206. A. STEGEMAN AND N. D. SIDIROPOULOS, On Kruskal's uniqueness condition for the CANDECOMP/PARAFAC decomposition, Linear Algebra Appl., 420 (2007), pp. 540-552.
207. A. STEGEMAN, J. M. F. TEN BERGE, AND L. DE LATHAUWER, Sufficient conditions for unique-ness in CANDECOMP/PARAFAC and INDSCAL with random component matrices, Psychometrika, 71 (2006), pp. 219-229.
208. V. STRASSEN, Gaussian elimination is not optimal, Numer. Math., 13 (1969), pp. 354-356.
209. J. SUN, S. PAPADIMITRIOU, AND P. S. YU, Window-based tensor analysis on high-dimensional and multi-aspect streams, in ICDM 2006: Proceedings of the 6th IEEE Conference on Data Mining, IEEE Computer Society Press, 2006, pp. 1076-1080.
210. J. SUN, D. TAO, AND C. FALOUTSOS, Beyond streams and graphs: Dynamic tensor analysis, in KDD '06: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, 2006, pp. 374-383.
211. J.-T. SUN, H.-J. ZENG, H. LIU, Y. LU, AND Z. CHEN, CubeSVD: A novel approach to personalized Web search, in WWW 2005: Proceedings of the 14th International Conference on World Wide Web, ACM Press, 2005, pp. 382-390.
212. J. M. F. TEN BERGE, Kruskal's polynomial for 2 × 2 × 2 arrays and a generalization to 2 × n × n arrays, Psychometrika, 56 (1991), pp. 631-636.
213. J. M. F. TEN BERGE, The typical rank of tall three-way arrays, Psychometrika, 65 (2000), pp. 525-532.
214. J. M. F. TEN BERGE, Partial uniqueness in CANDECOMP/PARAFAC, J. Chemometrics, 18 (2004), pp. 12-16.
215. J. M. F. ten BERGE AND H. A. L. KIERS, Some uniqueness results for PARAFAC2, J. Chemometrics, 61 (1996), pp. 123-132.
216. J. M. F. TEN BERGE AND H. A. L. KIERS, Simplicity of core arrays in three-way principal component analysis and the typical rank of p × q × 2 arrays, Linear Algebra Appl., 294 (1999), pp. 169-179.
217. J.M.F. TENBERGE, H.A.L. KIERS, and J. DELEEUW, Explicit CANDECOMP/PARAFAC solutions for a contrived 2 × 2 × 2 array of rank three, Psychometrika, 53 (1988), pp. 579-583.
218. J. M. F. TEN BERGE AND N. D. SIDIRIOPOLOUS, On uniqueness in CANDECOMP/PARAFAC, Psychometrika, 67 (2002), pp. 399-409.
219. J. M. F. TEN BERGE, N. D. SIDIROPOULOS, AND R. ROCCI, Typical rank and INDSCAL dimensionality for symmetric three-way arrays of order I × 2 × 2 or I × 3 × 3, Linear Algebra Appl., 388 (2004), pp. 363-377.
220. G. TOMASI, Use of the properties of the Khatri-Rao product for the computation of Jacobian, Hessian, and gradient of the PARAFAC model under MATLAB, private communication, 2005.
221. G. TOMASI, Practical and Computational Aspects in Chemometric Data Analysis, Ph.D.thesis, Department of Food Science, The Royal Veterinary and Agricultural University, Frederiksberg, Denmark, 2006. Available at http://www.models.life.ku.dk/research/theses/.
222. G. TOMASI AND R. BRO, PARAFAC and missing values, Chemometrics and Intelligent Laboratory Systems, 75 (2005), pp. 163-180.
223. G. TOMASI AND R. BRO, A comparison of algorithms for fitting the PARAFAC model, Comput. Statist. Data Anal., 50 (2006), pp. 1700-1734.
224. L. R. TUCKER, Implications of factor analysis of three-way matrices for measurement of change, in Problems in Measuring Change, C. W. Harris, ed., University of Wisconsin Press, 1963, pp. 122-137. Cited in [226, 140].
225. L. R. TUCKER, The extension of factor analysis to three-dimensional matrices, in Contributions to Mathematical Psychology, H. Gulliksen and N. Frederiksen, eds., Holt, Rinehardt, & Winston, New York, 1964, pp. 110-127. Cited in [226, 140].
226. L. R. TUCKER, Some mathematical notes on three-mode factor analysis, Psychometrika, 31 (1966), pp. 279-311.
227. C. F. VAN LOAN, The ubiquitous Kronecker product, J. Comput. Appl. Math., 123 (2000), pp. 85-100.
228. M. A. O. VASILESCU, Human motion signatures: Analysis, synthesis, recognition, in ICPR 2002: Proceedings of the 16th International Conference on Pattern Recognition, IEEE Computer Society Press, 2002, p. 30456.
229. M. A. O. VASILESCU AND D. TERZOPOULOS, Multilinear analysis of image ensembles: TensorFaces, in ECCV 2002: Proceedings of the 7th European Conference on Computer Vision, Lecture Notes in Comput. Sci. 2350, Springer, 2002, pp. 447-460.
230. M. A. O. VASILESCU AND D. TERZOPOULOS, Multilinear image analysis for facial recognition, in ICPR 2002: Proceedings of the 16th International Conference on Pattern Recognition, 2002, pp. 511-514.
231. M. A. O. VASILESCU AND D. TERZOPOULOS, Multilinear subspace analysis of image ensembles, in CVPR 2003: Proceedings of the 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE Computer Society Press, 2003, pp. 93-99.
232. M. A. O. VASILESCU AND D. TERZOPOULOS, Tensortextures: Multilinear image-based rendering, ACM Trans. Graphics, 23 (2004), pp. 336-342.
233. M. A. O. VASILESCU AND D. TERZOPOULOS, Multilinear independent components analysis, in CVPR 2005: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE Computer Society Press, 2005, pp. 547-553.
234. L. VEGA-MONTOTO AND P. D. WENTZELL, Maximum likelihood parallel factor analysis (MLPARAFAC), J. Chemometrics, 17 (2003), pp. 237-253.
235. D. VLASIC, M. BRAND, H. PFISTER, AND J. POPOVÍC, Face transfer with multilinear models, ACM Trans. Graphics, 24 (2005), pp. 426-433.
236. H. WANG AND N. AHUJA, Facial expression decomposition, in ICCV 2003: Proceedings of the 9th IEEE International Conference on Computer Vision, Vol. 2, 2003, pp. 958-965.
237. H. WANG AND N. AHUJA, Compact representation of multidimensional data using tensor rank-one decomposition, in ICPR 2004: Proceedings of the 17th International Conference on Pattern Recognition, Vol. 1, 2004, pp. 44-47.
238. M. WELLING AND M. WEBER, Positive tensor factorization, Pattern Recog. Lett., 22 (2001), pp. 1255-1261.
239. B. M. WISE AND N. B. GALLAGHER, PLS Toolbox 4.0. Available at http://www.eigenvector.com, 2007.
240. B. M. WISE, N. B. GALLAGHER, AND E. B. MARTIN, Application of PARAFAC2 to fault detection and diagnosis in semiconductor etch, J. Chemometrics, 15 (2001), pp. 285-298.
241. H.-L. WU, M. SHIBUKAWA, AND K. OGUMA, An alternating trilinear decomposition algorithm with application to calibration of HPLC-DAD for simultaneous determination of overlapped chlorinated aromatic hydrocarbons, J. Chemometrics, 12 (1998), pp. 1-26.
242. E. ZANDER AND H. G. MATTHIES, Tensor product methods for stochastic problems, PAMM Proc. Appl. Math. Mech., 7 (2007), pp. 2040067-2040068.
243. R. ZASS, HUJI Tensor Library. Available at http://www.cs.huji.ac.il/~zass/html/, May 2006.
244. T. ZHANG AND G. H. GOLUB, Rank-one approximation to high order tensors, SIAMJ. Matrix Anal. Appl., 23 (2001), pp. 534-550.