# Mode Coresets for Efficient, Interpretable Tensor Decompositions: An Application to Feature Selection in fMRI Analysis

**Authors:** BEN GABRIELSON, HANLU YANG, TRUNG VU, VINCE CALHOUN, TÜLAY ADALI

PMC · DOI: 10.1109/access.2024.3517338 · IEEE access : practical innovations, open solutions · 2025-08-15

## TL;DR

This paper introduces a new efficient and interpretable tensor decomposition method using coresets, which helps in feature selection for fMRI data analysis.

## Contribution

The paper introduces a novel deterministic coreset-based Tucker decomposition method for tensor data with improved approximation and feature selection.

## Key findings

- The proposed method better approximates tensors compared to similar methods with low computational complexity.
- The method enables effective feature selection in fMRI data analysis.
- Both random and deterministic coreset approaches are evaluated on simulated and real-world data.

## Abstract

Generalizations of matrix decompositions to multidimensional arrays, called tensor decompositions, are simple yet powerful methods for analyzing datasets in the form of tensors. These decompositions model a data tensor as a sum of rank-1 tensors, whose factors provide uses for a myriad of applications. Given the massive sizes of modern datasets, an important challenge is how well computational complexity scales with the data, balanced with how well decompositions approximate the data. Many efficient methods exploit a small subset of the tensor’s elements, representing most of the tensor’s variation via a basis over the subset. These methods’ efficiencies are often due to their randomized natures; however, deterministic methods can provide better approximations, and can perform feature selection, highlighting a meaningful subset that well-represents the entire tensor. In this paper, we introduce an efficient subset-based form of the Tucker decomposition, by selecting coresets from the tensor modes such that the resulting core tensor can well-approximate the full tensor. Furthermore, our method enables a novel feature selection scheme unlike other methods for tensor data. We introduce methods for random and deterministic coresets, minimizing error via a measure of discrepancy between the coreset and full tensor. We perform the decompositions on simulated data, and perform on real-world fMRI data to demonstrate our method’s feature selection ability. We demonstrate that compared with other similar decomposition methods, our methods can typically better approximate the tensor with comparably low computational complexities.

## Full-text entities

- **Diseases:** TUCKER (MESH:C536923), COLUMN (MESH:C536342), bipolar (MESH:D001714), traumatic brain injury (MESH:D000070642), TCD (MESH:D014012), schizophrenia (MESH:D012559), ADHD (MESH:D001289), BASED SUBSET (MESH:D019292), SELECTION (MESH:D009155), RANDOMIZED (MESH:C562757), mental disorders (MESH:D001523), SIMULATED (MESH:C565484), GENERALIZED (MESH:D004829), autism (MESH:D001321)
- **Chemicals:** CPU (-)
- **Species:** Homo sapiens (human, species) [taxon 9606]

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/PMC12352452/full.md

## Figures

30 figures with captions in the complete paper: https://tomesphere.com/paper/PMC12352452/full.md

## References

124 references — full list in the complete paper: https://tomesphere.com/paper/PMC12352452/full.md

---
Source: https://tomesphere.com/paper/PMC12352452