Parameter-free entropy-regularized multi-view clustering with hierarchical feature selection
Kristina P. Sinaga, Sara Colantonio, Miin-Shen Yang

TL;DR
This paper introduces a parameter-free, entropy-regularized multi-view clustering framework with hierarchical feature selection, achieving high accuracy, efficiency, and automatic view and feature importance determination across diverse datasets.
Contribution
It proposes novel algorithms that replace manual parameters with entropy regularization, enabling adaptive cross-view consensus and hierarchical feature selection with convergence guarantees.
Findings
Outperforms 15 state-of-the-art methods on five benchmarks.
Achieves up to 97% computational efficiency gains.
Reduces feature dimensionality to 0.45% of original size.
Abstract
Multi-view clustering faces critical challenges in automatically discovering patterns across heterogeneous data while managing high-dimensional features and eliminating irrelevant information. Traditional approaches suffer from manual parameter tuning and lack principled cross-view integration mechanisms. This work introduces two complementary algorithms: AMVFCM-U and AAMVFCM-U, providing a unified parameter-free framework. Our approach replaces fuzzification parameters with entropy regularization terms that enforce adaptive cross-view consensus. The core innovation employs signal-to-noise ratio based regularization () for principled feature weighting with convergence guarantees, coupled with dual-level entropy terms that automatically balance view and feature contributions. AAMVFCM-U extends this with hierarchical dimensionality…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
