The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Tensors : A brief introduction
Open accessAbstract
Tensor decompositions are at the core of many blind source separation (BSS) algorithms, either explicitly or implicitly. In particular, the canonical polyadic (CP) tensor decomposition plays a central role in the identification of underdetermined mixtures. Despite some similarities, CP and singular value decomposition (SVD) are quite different. More generally, tensors and matrices enjoy different properties, as pointed out in this brief introduction.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
A Multilinear Singular Value Decomposition
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896305696 · Cited by 4,106
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
Harshman, R. A. (1970) · Cited by 2,255
Kruskal, J. B. (1977) · Linear Algebra and its Applications · doi:10.1016/0024-3795(77)90069-6 · Cited by 1,619
On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479898346995 · Cited by 1,567
Handbook of Blind Source Separation, Independent Component Analysis and Applications
Comon, P., & Jutten, C. (2010) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 1,501
Self-citationThe Expression of a Tensor or a Polyadic as a Sum of Products
Hitchcock, F. L. (1927) · Journal of Mathematics and Physics · doi:10.1002/sapm192761164 · Cited by 1,345
Most Tensor Problems Are NP-Hard
Hillar, C. J., & Lim, L.-H. (2013) · Journal of the ACM · doi:10.1145/2512329 · Cited by 1,099
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
de Silva, V., & Lim, L.-H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/06066518x · Cited by 927
Singular Values and Eigenvalues of Tensors: A Variational Approach
Lim, L. (2006) · IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing · doi:10.1109/camap.2005.1574201 · Cited by 789
Polynomial interpolation in several variables
Gasca, M., & Sauer, T. (2000) · Advances in Computational Mathematics · doi:10.1023/a:1018981505752 · Cited by 697
Tensors: Geometry and Applications
Landsberg, J. (2011) · Graduate Studies in Mathematics · doi:10.1090/gsm/128 · Cited by 623
Symmetric Tensors and Symmetric Tensor Rank
Comon, P., Golub, G., Lim, L.-H., & Mourrain, B. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/060661569 · Cited by 544
Self-citationOn the uniqueness of multilinear decomposition ofN-way arrays
Sidiropoulos, N. D., & Bro, R. (2000) · Journal of Chemometrics · doi:10.1002/1099-128x(200005/06)14:3<229::aid-cem587>3.0.co;2-n · Cited by 525
Tensor decompositions, alternating least squares and other tales
Comon, P., Luciani, X., & de Almeida, A. L. F. (2009) · Journal of Chemometrics · doi:10.1002/cem.1236 · Cited by 457
Self-citationDe Lathauwer, L. (2006) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/040608830 · Cited by 419
Yeredor, A. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.1011195 · Cited by 397
On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
Kofidis, E., & Regalia, P. A. (2002) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479801387413 · Cited by 387
Orthogonal Tensor Decompositions
Kolda, T. G. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479800368354 · Cited by 376
A comparison of algorithms for fitting the PARAFAC model
Tomasi, G., & Bro, R. (2006) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2004.11.013 · Cited by 372
Sorber, L., Van Barel, M., & De Lathauwer, L. (2013) · SIAM Journal on Optimization · doi:10.1137/120868323 · Cited by 273
Partial and Total Matrix Multiplication
Schönhage, A. (1981) · SIAM Journal on Computing · doi:10.1137/0210032 · Cited by 259
A Decomposition for Three-Way Arrays
Leurgans, S. E., Ross, R. T., & Abel, R. B. (1993) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0614071 · Cited by 238
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2004) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s089547980139786x · Cited by 229
On Kruskal’s uniqueness condition for the Candecomp/Parafac decomposition
Stegeman, A., & Sidiropoulos, N. D. (2007) · Linear Algebra and its Applications · doi:10.1016/j.laa.2006.08.010 · Cited by 228
Rank and optimal computation of generic tensors
Strassen, V. (1983) · Linear Algebra and its Applications · doi:10.1016/0024-3795(83)80041-x · Cited by 222
Ziehe, A., Laskov, P., Nolte, G., & Müller, K. (2004) · doi:10.5555/1005332.1016784 · Cited by 218
O(n2.7799) complexity for n × n approximate matrix multiplication
Bini, D., Capovani, M., Romani, F., & Lotti, G. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90113-3 · Cited by 207
Jiang, T., & Sidiropoulos, N. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.832022 · Cited by 185
Nonnegative approximations of nonnegative tensors
Lim, L., & Comon, P. (2009) · Journal of Chemometrics · doi:10.1002/cem.1244 · Cited by 183
Self-citationDomanov, I., & Lathauwer, L. D. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/120877258 · Cited by 155
Lathauwer, L. D. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/100805510 · Cited by 136
Nonorthogonal Joint Diagonalization Free of Degenerate Solution
Li, X.-L., & Zhang, X. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.889983 · Cited by 136
Independent component analysis and (simultaneous) third-order tensor diagonalization
Lathauwer, L. D., Moor, B. D., & Vandewalle, J. P. L. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.950782 · Cited by 128
Joint Matrices Decompositions and Blind Source Separation
Chabriel, G., Kleinsteuber, M., Moreau, É., Shen, H., Tichavský, P., & Yeredor, A. (2014) · ASEP · doi:10.1109/msp.2014.2298045 · Cited by 127
Domanov, I., & Lathauwer, L. D. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/120877234 · Cited by 125
Domanov, I., Lieven, & Lathauwer, D. (2016) · Cited by 121
Eigenvectors of tensors and algorithms for Waring decomposition
Oeding, L., & Ottaviani, G. (2013) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2012.11.005 · Cited by 112
Blind Multilinear Identification
Lim, L., & Comon, P. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2291876 · Cited by 101
Self-citationQuadratic optimization for simultaneous matrix diagonalization
Vollgraf, R., & Obermayer, K. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.877673 · Cited by 99
Lickteig, T. (1985) · Linear Algebra and its Applications · doi:10.1016/0024-3795(85)90070-9 · Cited by 87
The Number of Singular Vector Tuples and Uniqueness of Best Rank-One Approximation of Tensors
Friedland, S., & Ottaviani, G. (2014) · Foundations of Computational Mathematics · doi:10.1007/s10208-014-9194-z · Cited by 81
Roemer, F., & Haardt, M. (2013) · Signal Processing · doi:10.1016/j.sigpro.2013.02.016 · Cited by 78
Computing the polyadic decomposition of nonnegative third order tensors
Royer, J., Thirion‐Moreau, N., & Comon, P. (2011) · Signal Processing · doi:10.1016/j.sigpro.2011.03.006 · Cited by 49
Self-citationStegeman, A., & Lathauwer, L. D. (2009) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/070692121 · Cited by 37
Semi-algebraic canonical decomposition of multi-way arrays and Joint Eigenvalue Decomposition
Luciani, X., & Albera, L. (2011) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2011.5947255 · Cited by 35
Tensor completion throughmultiple Kronecker product decomposition
Phan, A. H., Cichocki, A. S., Tichavský, P., et al. (2013) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2013.6638255 · Cited by 18
Cited by
Tensor Decomposition for Signal Processing and Machine Learning
Sidiropoulos, N. D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E. E., & Faloutsos, C. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2690524 · Cited by 1,617
Cichocki, A., Mandic, D., De Lathauwer, L., Zhou, G., Zhao, Q., Caiafa, C., & PHAN, H. A. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2297439 · Cited by 1,384
Multimodal Data Fusion: An Overview of Methods, Challenges, and Prospects
Lahat, D., Adali, T., & Jutten, C. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2460697 · Cited by 1,296
Tensor decomposition of EEG signals: A brief review
Cong, F., Lin, Q.-H., Kuang, L.-D., Gong, X.-F., Astikainen, P., & Ristaniemi, T. (2015) · Journal of Neuroscience Methods · doi:10.1016/j.jneumeth.2015.03.018 · Cited by 334
Boosting Crowd Counting via Multifaceted Attention
Lin, H., Ma, Z., Ji, R., Wang, Y., & Hong, X. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01901 · Cited by 257
Metadata
- Authors
- Comon, P.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2014-05
- Volume
- 31
- Issue
- 3
- Pages
- 44-53
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W2167083368
- Cited by
- 347
- References
- 49
- FWCI
- 12.32
- Type
- journal article
- Language
- en
- Open access
- green
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.