K-means Derived Unsupervised Feature Selection using Improved ADMM
Feature selection is important for high-dimensional data analysis and is non-trivial in unsupervised learning problems such as dimensionality reduction and clustering. The goal of unsupervised feature selection is finding a subset of features such that the data points from different clusters are well separated. This paper presents a novel method called K-means Derived Unsupervised Feature Selection (K-means UFS). Unlike most existing spectral analysis based unsupervised feature selection methods, we select features using the objective of K-means. We develop an alternating direction method of multipliers (ADMM) to solve the NP-hard optimization problem of our K-means UFS model. Extensive experiments on real datasets show that our K-means UFS is more effective than the baselines in selecting features for clustering.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDimensionality Reductionfeature selectionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Scalable unsupervised feature selection via weight stability
Unsupervised feature selection is critical for improving clustering performance in high-dimensional data, where irrelevant features can obscure meaningful structure. In this work, we introduce the Minkowski weighted $k$-…
feature selectionUnsupervised Feature Selection for the k-means Clustering Problem
We present a novel feature selection algorithm for the $k$-means clustering problem. Our algorithm is randomized and, assuming an accuracy parameter $\epsilon \in (0,1)$, selects and appropriately rescales in an unsuperv…
Clusteringfeature selectionUnsupervised Feature Analysis with Class Margin Optimization
Unsupervised feature selection has been always attracting research attention in the communities of machine learning and data mining for decades. In this paper, we propose an unsupervised feature selection method seeking …
ClusteringFeature Correlationfeature selectionExtending Contrastive Learning to Unsupervised Coreset Selection
Self-supervised contrastive learning offers a means of learning informative features from a pool of unlabeled data. In this paper, we delve into another useful approach -- providing a way of selecting a core-set that is …
Contrastive LearningAdaptive Collaborative Sot Label Learning for Unsupervised Multi-view Feature Selection
Unsupervised multi-view feature selection aims to select informative features with multi-view features and unsupervised learning. It is a challenging problem due to the absence of explicit semantic supervision. Recently…
feature selectiongraph constructionPseudo Label