mlsanityData to 7 Oct 2026

A Tensor SVD-based Classification Algorithm Applied to fMRI Data

arXiv 2111.00587 ↗First posted 31 Oct 2021cs.LG cs.NA math.NAcited by 5

Not on the map. Why?

Abstract (arXiv)

To analyze the abundance of multidimensional data, tensor-based frameworks have been developed. Traditionally, the matrix singular value decomposition (SVD) is used to extract the most dominant features from a matrix containing the vectorized data. While the SVD is highly useful for data that can be appropriately represented as a matrix, this step of vectorization causes us to lose the high-dimensional relationships intrinsic to the data. To facilitate efficient multidimensional feature extraction, we utilize a projection-based classification algorithm using the t-SVDM, a tensor analog of the matrix SVD. Our work extends the t-SVDM framework and the classification algorithm, both initially proposed for tensors of order 3, to any number of dimensions. We then apply this algorithm to a classification task using the StarPlus fMRI dataset. Our numerical experiments demonstrate that there exists a superior tensor-based approach to fMRI classification than the best possible equivalent matrix-based approach. Our results illustrate the advantages of our chosen tensor framework, provide insight into beneficial choices of parameters, and could be further developed for classification of more complex imaging data. We provide our Python implementation at https://github.com/elizabethnewman/tensor-fmri.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 3 of its 27 references that are in the map. First posted on arXiv 31 Oct 2021.

Builds on

3 of 27 references.

References · 3

  1. 2014Jpeg Image Compression Using Discrete Cosine Transform - A Surveycited by 11
  2. 2017Image classification using local tensor singular value decompositionscited by 3
  3. 2019Dynamic Graph Convolutional Networks Using the Tensor M-Productcited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 2; 2025: 2.

5 papers.