Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 10,301

The DOI matches its Crossref record; 137 of the 137 references it cites were found in a registry or an index.

Tensor Decompositions and Applications

Kolda, Tamara G., Bader, Brett W. · 2009 · SIAM Review

Abstract

This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or [Formula: see text]-way array. Decompositions of higher-order tensors (i.e., [Formula: see text]-way arrays with [Formula: see text]) have applications in psychometrics, chemometrics, signal processing, numerical linear algebra, computer vision, numerical analysis, data mining, neuroscience, graph analysis, and elsewhere. Two particular tensor decompositions can be considered to be higher-order extensions of the matrix singular value decomposition: CANDECOMP/PARAFAC (CP) decomposes a tensor as a sum of rank-one tensors, and the Tucker decomposition is a higher-order form of principal component analysis. There are many other tensor decompositions, including INDSCAL, PARAFAC2, CANDELINC, DEDICOM, and PARATUCK2 as well as nonnegative variants of all of the above. The N-way Toolbox, Tensor Toolbox, and Multilinear Engine are examples of software packages for working with tensors.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/07070111x

Cites

137 of 137 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 105

  1. Alexander J., 1995, J. Algebraic Geom., 4, 201
  2. 10.1016/S0169-7439(98)00010-0 · doi:10.1016/s0169-7439(98)00010-0
  3. 10.1145/1186785.1186794 · doi:10.1145/1186785.1186794
  4. 10.1137/060676489 · doi:10.1137/060676489
  5. 10.1073/pnas.112329799 · doi:10.1073/pnas.112329799
  6. 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/.
  7. 10.1016/S0169-7439(98)00011-2 · doi:10.1016/s0169-7439(98)00011-2
  8. Bro R., 2003, Psychometrika, 17, 16
  9. 10.1137/0219031 · doi:10.1137/0219031
  10. 10.1007/BF02293596 · doi:10.1007/bf02293596
  11. Chen B., 2002, EURASIP J. Appl. Signal Process., 5, 487
  12. Comon P., 2001, Mathematics in Signal Processing V, 1
  13. 10.1016/0165-1684(96)00079-5 · doi:10.1016/0165-1684(96)00079-5
  14. 10.1016/j.laa.2009.01.014 · doi:10.1016/j.laa.2009.01.014
  15. 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–745. · doi:10.1145/1060590.1060701
  16. 10.1137/060661685 · doi:10.1137/060661685
  17. 10.1016/j.sigpro.2005.12.015 · doi:10.1016/j.sigpro.2005.12.015
  18. De Lathauwer L., 1998, Mathematics in Signal Processing IV, 1
  19. 10.1137/070690730 · doi:10.1137/070690730
  20. 10.1016/j.laa.2004.01.016 · doi:10.1016/j.laa.2004.01.016
  21. Doostan A., 2007, Annual Research Briefs, 121
  22. 10.1016/j.laa.2006.08.023 · doi:10.1016/j.laa.2006.08.023
  23. 10.1137/070688316 · doi:10.1137/070688316
  24. 10.1016/S0169-7439(02)00089-8 · doi:10.1016/s0169-7439(02)00089-8
  25. 10.1007/BF01129000 · doi:10.1007/bf01129000
  26. 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. · doi:10.1049/cp:20050279
  27. Friedlander M. P., 2008, Comput. Optim. Appl., 23, 631
  28. 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.
  29. 10.1002/spe.630 · doi:10.1002/spe.630
  30. 10.1137/1.9781611971354.ch9 · doi:10.1137/1.9781611971354.ch9
  31. 10.1016/j.jco.2007.03.007 · doi:10.1016/j.jco.2007.03.007
  32. Harshman R. A., 1970, UCLA Working Papers in Phonetics, 16, 1
  33. Harshman R. A., 1972, UCLA Working Papers in Phonetics, 22, 111
  34. Harshman R. A., 1972, UCLA Working Papers in Phonetics, 22, 30
  35. 10.1002/cem.665 · doi:10.1002/cem.665
  36. 10.1287/mksc.1.2.205 · doi:10.1287/mksc.1.2.205
  37. 10.1002/cem.709 · doi:10.1002/cem.709
  38. 10.1002/cem.808 · DOI
  39. 10.1007/BF02296963 · DOI
  40. 10.1002/cem.1180070604 · doi:10.1002/cem.1180070604
  41. 10.1016/0169-7439(93)E0086-J · doi:10.1016/0169-7439(93)e0086-j
  42. 10.1016/0024-3795(78)90052-6 · doi:10.1016/0024-3795(78)90052-6
  43. 10.1002/nla.297 · doi:10.1002/nla.297
  44. 10.1002/(SICI)1099-128X(200001/02)14:1<15::AID-CEM571>3.0.CO;2-Z · doi:10.1002/(sici)1099-128x(200001/02)14:1<15::aid-cem571>3.0.co;2-z
  45. 10.1007/BF02293984 · doi:10.1007/bf02293984
  46. 10.2478/cmam-2006-0010 · doi:10.2478/cmam-2006-0010
  47. 10.2478/s11533-007-0018-0 · doi:10.2478/s11533-007-0018-0
  48. 10.1007/BF02294633 · doi:10.1007/bf02294633
  49. Kiers H. A. L., 1992, Statistica Appl., 4, 659
  50. 10.1016/0167-9473(93)90247-Q · doi:10.1016/0167-9473(93)90247-q
  51. 10.1007/s003579900033 · doi:10.1007/s003579900033
  52. 10.1002/(SICI)1099-128X(199805/06)12:3<155::AID-CEM502>3.0.CO;2-5 · doi:10.1002/(sici)1099-128x(199805/06)12:3<155::aid-cem502>3.0.co;2-5
  53. 10.1002/1099-128X(200005/06)14:3<105::AID-CEM582>3.0.CO;2-I · doi:10.1002/1099-128x(200005/06)14:3<105::aid-cem582>3.0.co;2-i
  54. 10.1348/000711003321645386 · doi:10.1348/000711003321645386
  55. 10.1016/S0169-7439(96)00074-3 · doi:10.1016/s0169-7439(96)00074-3
  56. 10.1007/BF02294580 · doi:10.1007/bf02294580
  57. 10.1007/BF02294556 · doi:10.1007/bf02294556
  58. 10.1007/BF02294748 · doi:10.1007/bf02294748
  59. 10.1137/S0895479801394465 · doi:10.1137/s0895479801394465
  60. 10.1016/j.csda.2005.09.003 · doi:10.1016/j.csda.2005.09.003
  61. 10.1002/9780470238004 · doi:10.1002/9780470238004
  62. Kruskal J. B., 1983, Statement of Some Current Results about Three-Way Arrays
  63. Kruskal J. B., 1989, Multiway Data Analysis, 115
  64. 10.1155/2003/205264 · doi:10.1155/2003/205264
  65. 10.1002/nla.344 · doi:10.1002/nla.344
  66. 10.1214/ss/1177011225 · doi:10.1214/ss/1177011225
  67. 10.1109/TC.2003.1252859 · doi:10.1109/tc.2003.1252859
  68. 10.1109/12.990130 · doi:10.1109/12.990130
  69. Lundy M. E., 1989, Multiway Data Analysis, 123
  70. 10.1137/060655924 · doi:10.1137/060655924
  71. 10.1002/cem.1180080207 · doi:10.1002/cem.1180080207
  72. 10.1007/BF02294854 · doi:10.1007/bf02294854
  73. 10.1016/j.sigpro.2004.11.029 · doi:10.1016/j.sigpro.2004.11.029
  74. 10.1109/TIP.2005.863112 · doi:10.1109/tip.2005.863112
  75. Narasimhan M. N. L., 1993, Principles of Continuum Mechanics
  76. 10.1016/j.sigpro.2007.07.024 · doi:10.1016/j.sigpro.2007.07.024
  77. Paatero P., 1999, J. Comput. Graphical Statist., 8, 854
  78. 10.1002/1099-128X(200005/06)14:3<285::AID-CEM584>3.0.CO;2-1 · doi:10.1002/1099-128x(200005/06)14:3<285::aid-cem584>3.0.co;2-1
  79. 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.
  80. 10.1016/S0169-7439(97)00033-6 · doi:10.1016/s0169-7439(97)00033-6
  81. 10.1007/s10260-004-0089-z · doi:10.1007/s10260-004-0089-z
  82. Ruíz-Tolosa J. R., 2005, From Vectors to Tensors
  83. 10.1002/cem.1180040105 · doi:10.1002/cem.1180040105
  84. B. Savas, Analyses and Tests of Handwritten Digit Recognition Algorithms. Master’s thesis, Linköping University, Linköping, Sweden, 2003.
  85. 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. · doi:10.1007/11744085_46
  86. 10.1109/78.852018 · DOI
  87. 10.1109/TSP.2002.803341 · doi:10.1109/tsp.2002.803341
  88. 10.1002/cem.1180080104 · doi:10.1002/cem.1180080104
  89. 10.1007/s11336-004-1266-6 · doi:10.1007/s11336-004-1266-6
  90. 10.1007/s11336-007-9022-3 · doi:10.1007/s11336-007-9022-3
  91. 10.1007/11336-006-1278-2 · doi:10.1007/11336-006-1278-2
  92. 10.1007/BF02294495 · doi:10.1007/bf02294495
  93. 10.1002/cem.839 · doi:10.1002/cem.839
  94. ten Berge J. M. F., 1996, J. Chemometrics, 61, 123
  95. 10.1016/S0024-3795(99)00057-9 · doi:10.1016/s0024-3795(99)00057-9
  96. 10.1007/BF02294409 · doi:10.1007/bf02294409
  97. 10.1007/BF02294992 · doi:10.1007/bf02294992
  98. 10.1016/j.laa.2004.03.009 · doi:10.1016/j.laa.2004.03.009
  99. 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/.
  100. 10.1016/j.chemolab.2004.07.003 · doi:10.1016/j.chemolab.2004.07.003
  101. 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. · doi:10.1109/cvpr.2005.240
  102. 10.1002/cem.789 · doi:10.1002/cem.789
  103. 10.1002/cem.689 · doi:10.1002/cem.689
  104. 10.1002/(SICI)1099-128X(199801/02)12:1<1::AID-CEM492>3.0.CO;2-4 · doi:10.1002/(sici)1099-128x(199801/02)12:1<1::aid-cem492>3.0.co;2-4
  105. 10.1002/pamm.200700773 · doi:10.1002/pamm.200700773

Cited by

See all 10,301

Metadata

Authors
Kolda, T. G., & Bader, B. W.
Venue
SIAM Review
Published
2009-08-05
Volume
51
Issue
3
Pages
455-500
ISSN
  • 0036-1445 (ISSN-L)
  • 1095-7200
OpenAlex
W2024165284
Cited by
10,301
References
137
FWCI
50.53
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.