The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
A New Truncation Strategy for the Higher-Order Singular Value Decomposition
Open accessAbstract
We present an alternative strategy for truncating the higher-order singular value decomposition (T-HOSVD). An error expression for an approximate Tucker decomposition with orthogonal factor matrices is presented, leading us to propose a novel truncation strategy for the HOSVD, which we refer to as the sequentially truncated higher-order singular value decomposition (ST-HOSVD). This decomposition retains several favorable properties of the T-HOSVD, while reducing the number of operations required to compute the decomposition and practically always improving the approximation error. Three applications are presented, demonstrating the effectiveness of ST-HOSVD. In the first application, ST-HOSVD, T-HOSVD, and higher-order orthogonal iteration (HOOI) are employed to compress a database of images of faces. On average, the ST-HOSVD approximation was only $0.1\%$ worse than the optimum computed by HOOI, while cutting the execution time by a factor of $20$. In the second application, classification of handwritten digits, ST-HOSVD achieved a speedup factor of $50$ over T-HOSVD during the training phase, and reduced the classification time and storage costs, while not significantly affecting the classification error. The third application demonstrates the effectiveness of ST-HOSVD in compressing results from a numerical simulation of a partial differential equation. In such problems, ST-HOSVD inevitably can greatly improve the running time. We present an example wherein the 2 hour $45$ minute calculation of T-HOSVD was reduced to just over one minute by ST-HOSVD, representing a speedup factor of $133$, while even improving the memory consumption.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
Anderson, E., Bai, Z., Bischof, C., Blackford, L. S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719604 · Cited by 4,435
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
Oseledets, I. V. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090752286 · Cited by 2,636
Parameterisation of a stochastic model for human face identification
Samaria, F. S., & Harter, A. C. (2002) · Proceedings of 1994 IEEE Workshop on Applications of Computer Vision · doi:10.1109/acv.1994.341300 · Cited by 2,593
Numerical Methods for Large Eigenvalue Problems: Revised Edition
Saad, Y. (2011) · doi:10.1137/1.9781611970739 · Cited by 2,364
Applied numerical linear algebra
(1998) · Choice Reviews Online · doi:10.5860/choice.35-3919 · Cited by 2,170
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
The ubiquitous Kronecker product
Loan, C. F. V. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00393-9 · Cited by 981
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
Principal Component Analysis of Three-Mode Data by Means of Alternating Least Squares Algorithms
Kroonenberg, P. M., & de Leeuw, J. (1980) · Psychometrika · doi:10.1007/bf02293599 · Cited by 724
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
Handwritten digit recognition: benchmarking of state-of-the-art techniques
Liu, C.-L., Nakashima, K., Sako, H., & Fujisawa, H. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(03)00085-2 · Cited by 543
Hierarchical Singular Value Decomposition of Tensors
Grasedyck, L. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090764189 · Cited by 508
Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
Oseledets, I. V., & Tyrtyshnikov, E. E. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/090748330 · Cited by 459
A New Scheme for the Tensor Representation
Hackbusch, W., & Kühn, S. (2009) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-009-9094-9 · Cited by 453
Rank-One Approximation to High Order Tensors
Zhang, T., & Golub, G. H. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479899352045 · Cited by 430
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
Multilinear subspace analysis of image ensembles
Vasilescu, M. A. O., & Terzopoulos, D. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211457 · Cited by 375
CubeSVD: a novel approach to personalized Web search
Sun, J.-T., Zeng, H.-J., Liu, H., Lu, Y., & Chen, Z. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060803 · Cited by 338
Multiple Invariants and Generalized Rank of a P‐Way Matrix or Tensor
Hitchcock, F. L. (1928) · Journal of Mathematics and Physics · doi:10.1002/sapm19287139 · Cited by 338
Tag recommendations based on tensor dimensionality reduction
Symeonidis, P., Nanopoulos, A., & Manolopoulos, Y. (2008) · Proceedings of the 2008 ACM conference on Recommender systems · doi:10.1145/1454008.1454017 · Cited by 310
Multilinear image analysis for facial recognition
Vasilescu, M. A. O., & Terzopoulos, D. (2003) · Object recognition supported by user interaction for service robots · doi:10.1109/icpr.2002.1048350 · Cited by 229
Discrimination of speech from nonspeech based on multiscale spectro-temporal Modulations
Mesgarani, N., Slaney, M., & Shamma, S. A. (2006) · IEEE Transactions on Audio, Speech and Language Processing · doi:10.1109/tsa.2005.858055 · Cited by 224
Handwritten digit classification using higher order singular value decomposition
Savas, B., & Eldén, L. (2006) · Pattern Recognition · doi:10.1016/j.patcog.2006.08.004 · Cited by 207
Facial expression decomposition
Wang, H., & Ahuja (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238452 · Cited by 195
TensorTextures: multilinear image-based rendering
Vasilescu, M. A. O., & Terzopoulos, D. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015725 · Cited by 167
Omberg, L., Golub, G. H., & Alter, O. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0709146104 · Cited by 149
Ishteva, M. K., Absil, P.-A., Huffel, S. V., & Lathauwer, L. D. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090764827 · Cited by 120
Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
Savas, B., & Lim, L. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090763172 · Cited by 116
Text Representation: From Vector to Tensor
Liu, N., Zhang, B., Yan, J., et al. (2006) · Proceedings · doi:10.1109/icdm.2005.144 · Cited by 70
Differential-geometric Newton method for the best rank-(R 1, R 2, R 3) approximation of tensors
Ishteva, M. K., Lathauwer, L. D., Absil, P.-A., & Huffel, S. V. (2008) · Numerical Algorithms · doi:10.1007/s11075-008-9251-2 · Cited by 53
Multi-way modelling of high-dimensionality electroencephalographic data
Estienne, F., Matthijs, N., Massart, D. L., Ricoux, P., & Leibovici, D. (2001) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(01)00140-x · Cited by 41
Global effects of DNA replication and DNA replication origin activity on eukaryotic gene expression
Omberg, L., Meyerson, J. R., Kobayashi, K., Drury, L. S., Diffley, J. F. X., & Alter, O. (2009) · Molecular Systems Biology · doi:10.1038/msb.2009.70 · Cited by 39
Higher order singular value decomposition in quantum chemistry
Bell, F., Lambrecht, D. S., & Head‐Gordon, M. (2010) · Molecular Physics · doi:10.1080/00268976.2010.523713 · Cited by 33
On the Best Low Multilinear Rank Approximation of Higher-order Tensors*
Ishteva, M. K., Absil, P.-A., Huffel, S. V., & Lathauwer, L. D. (2010) · Springer eBooks · doi:10.1007/978-3-642-12598-0_13 · Cited by 30
Recursive decomposition of multidimensional tensors
Oseledets, I. V., & Tyrtyshnikov, E. E. (2009) · Doklady Mathematics · doi:10.1134/s1064562409040036 · Cited by 22
Tucker compression and local optima
Ishteva, M. K., Absil, P.-A., Huffel, S. V., & Lathauwer, L. D. (2010) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2010.06.006 · Cited by 17
Cited by
A literature survey of low‐rank tensor approximation techniques
Grasedyck, L., Kressner, D., & Tobler, C. (2013) · GAMM-Mitteilungen · doi:10.1002/gamm.201310004 · Cited by 577
Metadata
- Authors
- Vannieuwenhoven, N., Vandebril, R., & Meerbergen, K.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2012-01
- Volume
- 34
- Issue
- 2
- Pages
- A1027-A1052
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2055913665
- Cited by
- 277
- References
- 42
- FWCI
- 1.89
- 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.