mlsanityData to 14 Oct 2026

Unsupervised feature selection using Bayesian Tucker decomposition

arXiv 2604.14949 ↗First posted 16 Apr 2026stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

In this paper, we proposed Bayesian Tucker decomposition (BTuD) in which residual is supposed to obey Gaussian distribution analogous to linear regression. Although we have proposed an algorithm to perform the proposed BTuD, the conventional higher-order orthogonal iteration can generate Tucker decomposition consistent with the present implementation. Using the proposed BTuD, we can perform unsupervised feature selection successfully applied to various synthetic datasets, global coupled maps with randomized coupling strength, and gene expression profiles. Thus we can conclude that our newly proposed unsupervised feature selection method is promising. In addition to this, BTuD based unsupervised FE is expected to coincide with TD based unsupervised FE that were previously proposed and successfully applied to a wide range of problems.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 18 references that are in the map. First posted on arXiv 16 Apr 2026.

Builds on

1 of 18 references.

References · 1

  1. 2015Bayesian Sparse Tucker Models for Dimension Reduction and Tensor Completioncited by 8

Built on by

Not cited yet.