Scalable unsupervised feature selection via weight stability
Not on the map. Why?
Abstract (arXiv)
Unsupervised feature selection is critical for improving clustering performance in high-dimensional data, where irrelevant features can obscure meaningful structure. In this work, we propose the Minkowski weighted k-means++, a novel initialisation strategy for the Minkowski Weighted k-means. Our initialisation selects centroids probabilistically using feature relevance estimates derived from the data itself. Building on this, we propose two new feature selection algorithms, FS-MWK++, which aggregates feature weights across a range of Minkowski exponents identifying stable and informative features, and SFS-MWK++, a scalable variant based on subsampling. We support our approach with a theoretical analysis, demonstrating that, under explicit assumptions on noise features and cluster structure, relevant features are assigned consistently higher weights than noise features across a range of Minkowski exponents. Our software can be found at https://github.com/xzhang4-ops1/FSMWK.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 44 references that are in the map. First posted on arXiv 6 Jun 2025.
Builds on
6 of 44 references.
References · 6
- 2019TabNet: Attentive Interpretable Tabular Learningcited by 648
- 2020Infinite Feature Selection: A Graph-based Feature Filtering Approachcited by 16
- 2021Deep Unsupervised Feature Selection by Discarding Nuisance and Correlated Featurescited by 11
- 2014A Survey on Soft Subspace Clusteringcited by 7
- 2019Unsupervised Feature Selection based on Adaptive Similarity Learning and Subspace Clusteringcited by 6
- 2020Adaptive Explicit Kernel Minkowski Weighted K-meanscited by 3
Built on by
Not cited yet.