Nonnegative approximations of nonnegative tensors

Journal of Chemometrics

Volumn 23, Issue 7-8, 2009, Pages 432-441

  Lim, Lek Heng ^a   Comon, Pierre ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITÉ CÔTE D'AZUR   (France)

Author keywords

CANDECOMP; Low rank tensor approximations; Nonnegative hypermatrices; Nonnegative tensor decompositions; Nonnegative tensor rank; Nonnegative tensors; PARAFAC; Probabilistic latent semantic indexing; Tensor Br gman divergence; Tensor norm

Indexed keywords

DECOMPOSITION; SEMANTICS;

CANDECOMP; LOW-RANK TENSOR APPROXIMATIONS; NON NEGATIVES; NON-NEGATIVE TENSOR DECOMPOSITIONS; NONNEGATIVE HYPERMATRIX; NONNEGATIVE TENSOR; NONNEGATIVE TENSOR RANK; PARAFAC; PROBABILISTIC LATENT SEMANTIC INDEXING; TENSOR BRÈGMAN DIVERGENCE; TENSOR NORM; TENSOR RANKS;

TENSORS;

EID: 70349696077     PISSN: 08869383     EISSN: 1099128X     Source Type: Journal    
DOI: 10.1002/cem.1244     Document Type: Article

References (37)

1. Harshman RA. Foundations of the PARAFAC procedure: models and conditions for an explanatory multi-modal factor analysis. UCLA Working Papers in Phonetics 1970; 16: 1-84.
2. Deerwester S, Dumais S, Furnas GW, Landauer TK, Harshman R. Indexing by latent semantic analysis. J. Amer. Soc. Inform. Sci. 1990; 41(6): 391-407.
3. 2.7799) complexity for n × n approximate matrix multiplication. Inform. Process. Lett. 1979; 8(5): 234-235.
4. Kruskal JB, Harshman RA, Lundy ME. How 3-MFA data can cause degenerate PARAFAC solutions, among other relationships, pp. 115-122, in Reference [37].
5. Hitchcock FL. The expression of a tensor or a polyadic as a sum of products. J. Math. Phys. 1927; 6(1): 164-189.
6. Hitchcock FL. Multiple invariants and generalized rank of a p-way matrix or tensor. J. Math. Phys. 1927; 7(1): 39-79.
7. Bürgisser P, Clausen M, Shokrollahi MA. Algebraic Complexity Theory (Grundlehren der mathematischen Wissenschaften), vol. 315. Springer-Verlag: Berlin, Germany, 1996.
8. Strassen V. Gaussian elimination is not optimal. Numer. Math. 1969; 13: 354-356.
9. Carroll JD, Chang JJ. Analysis of individual differences in multidimensional scaling via n-way generalization of Eckart-Young decomposition. Psychometrika 1970; 35(3): 283-319.
10. Eckart C, Young G. The approximation of one matrix by another of lower rank. Psychometrika 1936; 1(3): 211-218.
11. Bro R, de Jong S. A fast non-negativity constrained least squares algorithm. J. Chemometrics 1997; 11(5): 393-401.
12. Bro R, Sidiropoulos N. Least squares algorithms under unimodality and non-negativity constraints. J. Chemometrics 1998; 12 (4): 223-247.
13. Carroll JD, De Soete G, Pruzansky S. Fitting of the latent class model via iteratively reweighted least squares CANDECOMP with nonnegativity constraints, pp. 463-472, in Reference [37].
14. Krijnen WP, Ten Berge JMF. Contrastvrije oplossingen van het CANDECOMP/PARAFAC-model. Kwantitatieve Methoden 1991; 12(37): 87-96.
15. Paatero P. A weighted non-negative least squares algorithm for three-way PARAFAC factoranalysis. Chemometrics Intell. Lab. Syst. 1997; 38(2): 223-242.
16. Paatero P, Tapper U. Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values. Environmetrics 1994; 5(2): 111-126.
17. Lee DD, Seung HS. Learning the parts of objects by nonnegative matrix factorization. Nature 1999; 401: 788-791.
18. Shashua A, Hazan T. Non-negative tensor factorization with applications to statistics and computer vision. Proc. Int. Conf. Mach. Learn. (ICML'05) 2005; 22: 792-799.
19. Lim L-H. Optimal solutions to nonnegative PARAFAC /multilinear NMF always exist. Workshop on Tensor Decompositions and Applications, Centre International de rencontres Mathématiques, Luminy, France, August 29-September 2, 2005.
20. Gelfand IM, Kapranov MM, Zelevinsky AV. Discriminants, Resultants, and Multidimensional Determinants. Birkhäuser Publishing: Boston, MA, 1994.
21. de Silva V, Lim L-H. Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM J. Matrix Anal. Appl. 2008; 30(3): 1084-1127.
22. Hofmann T. Probabilistic Latent Semantic Indexing. Proc. Annual Int. SIGIR Conf. Res. Develop. Inform. Retrieval (SIGIR'99) 1999; 22: 50-57.
23. Garcia LD, Stillman M, Sturmfels B. Algebraic geometry of Bayesian networks. J. Symbolic Comput. 2005; 39(3-4): 331-355.
24. Gaussier E, Goutte C. Relation between PLSA and NMF and implications. Proc. Annual Int. SIGIR Conf. Res. Develop. Inform. Retrieval (SIGIR'05) 2005; 28: 601-602.
25. Comon P, Golub G, Lim L-H, Mourrain B. Symmetric tensors and symmetric tensor rank. SIAM J. Matrix Anal. Appl. 2008; 30(3): 1254-1279.
26. Bini D, Lotti G, Romani F. Approximate solutions for the bilinear form computational problem. SIAM J. Comput. 1980; 9(4): 692-697.
27. Paatero P. Construction and analysis of degenerate PARAFAC models. J. Chemometrics 2000; 14(1): 285-299.
28. Knuth DE. The Art of Computer Programming: Seminumerical Algorithms (3rd edn), vol. 2. Addision Wesley: Reading, MA, 1998.
29. Brinkhuis J, Tikhomirov V. Optimization: Insights and Applications. Princeton University Press: Princeton, NJ, 2005.
30. Stegeman A. Low-rank approximation of generic p × q × 2 arrays and diverging components in the CANDECOMP/PARAFAC model. SIAM J. Matrix Anal. Appl. 2008; 30(3): 988-1007.
31. Brègman L. A relaxation method of finding a common point of convex sets and its application to the solution of problems in convex programming. U.S.S.R. Comput. Math. and Math. Phys. 1967; 7(3): 620-631.
32. Dhillon IS, Tropp JA. Matrix nearness problems using Brègman divergences. SIAM J. Matrix Anal. Appl. 2007; 29(4): 1120-1146.
33. Iusem AN. "Bregman distance" and "Bregman function". In Encyclopaedia of Mathematics, Hazewinkel M(ed.) Kluwer: Dordrecht, Netherlands, 1997; 152-154.
34. Kullback S, Leibler RA. On information and sufficiency. Ann. Math. Statistics 1951; 22(1): 79-86.
35. Comon P. Independent component analysis: a new concept? Signal Process. 1994; 36(3): 287-314.
36. Harshman RA, Lundy ME. Data preprocessing and the extended PARAFAC model. In Research Methods for Multimode Data Analysis, Law HG, Snyder CW, Hattie JA, McDonald RP (eds)Praeger: New York, 1984; 216-281.
37. Coppi R, Bolasco S (eds). Multiway Data Analysis. Elsevier Science: Amsterdam, Netherlands, 1989.