Oct 2026· Tsinghua Science and Technology· 0 citations
TL;DR
Extensive experiments demonstrate that USMF outperforms existing state-of-the-art unsupervised feature selection methods in terms of Clustering Accuracy (ACC) and Normalized Mutual Information (NMI).
Abstract
Previous unsupervised feature selection methods typically model global data distributions and local geometric structures separately or via parallel constraints. Such decoupled modeling often leads to structural inconsistencies due to the lack of a unified representation of sample relationships. Moreover, existing local structure-based methods generally rely on predefined and fixed adjacency graphs, which often contain noise and redundancy, further degrading the learning performance. To address these issues, this paper proposes a novel Unified Structural Matrix Framework (USMF) for unsupervised feature selection. Specifically, a dynamically learnable, non-negative, symmetric structure matrix is introduced to consistently capture both global and local structural relationships within a single variable. This matrix preserves the global data structure via a trace-maximizing term, similar to weighted principal component analysis, while maintaining local geometric relationships via weighted distance constraints in the embedding space. Furthermore, a Frobenius norm (F-norm) consistency constraint is introduced to preserve neighborhood information and stabilize structure learning. Concurrently, an l2;1-norm regularization is imposed on the projection matrix to achieve effective feature selection. An alternating optimization algorithm is designed to solve the proposed model. Extensive experiments on multiple public datasets demonstrate that USMF outperforms existing state-of-the-art unsupervised feature selection methods in terms of Clustering Accuracy (ACC) and Normalized Mutual Information (NMI).
The quality of unsupervised manifold learning relies fundamentally on the underlying neighborhood graph. Standard linear methods utilizing a single affinity matrix often fail to capture the multiscale complexity of high-dimensional data. While multi-view algorithms integrate complementary information, additional views...
Qi-Rui Huang, Xuan S. Yang, Yang Zhao et al.· Proceedings of the 35th ACM...· 0 citations
Visualizing and interpreting the dependence structure in relational data often benefits from geometric representations via low-dimensional Euclidean embeddings. However, existing approaches are typically restricted to specific response types, rely on burdensome high-dimensional nonconvex optimization, or lack uniform t...
Multi-view clustering aims to learn a consistent clustering structure by utilizing complementary information across different feature views, but balancing discriminative representation learning and computational efficiency remains challenging. Existing anchor-based tensor methods exploit high-order cross-view correlati...
To address the insufficient stability of the feature space in class-incremental learning, this paper proposes a Dynamic Topology-Preserving Multi-Label Class-Incremental Learning (DTP-MLCIL) method. Specifically, a Neural Gas (NG) network is introduced to construct and maintain an adaptive topological skeleton of the f...
A prototype-learning framework that addresses a common limitation of proximity-based methods: the need to specify proximity weights in advance, by extending the convex-clustering framework and implementing a self-representation matrix learned from the prototype-level representation.
Dahyun Jeong, Yun-Jin Choi· Proceedings of the 35th ACM...· 0 citations
Unsupervised feature selection is difficult when relevance must be inferred without labels, and redundancy, outliers, and sample-localized geometry can distort marginal criteria. This study presents Geometry-Supported Residual Feature Selection (GSR-FS), a fully label-blind algorithm and open-source Python library that...
D. Galiatsatos, P. Galiatsatou· Algorithms· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.