Unsupervised Feature Selection Algorithm Based on Dual Manifold Re-ranking
High-dimensional data is commonly encountered in numerous data analysis tasks. Feature selection techniques aim to identify the most representative features from the original high-dimensional data. Due to the absence of class label information, it is significantly more challenging to select appropriate features in unsupervised learning scenarios compared to supervised ones. Traditional unsupervised feature selection methods typically score the features of samples based on certain criteria, treating samples indiscriminately. However, these approaches fail to fully capture the internal structure of the data. The importance of different samples should vary, and there is a dual relationship between the weight of samples and features that will influence each other. Therefore, an unsupervised feature selection algorithm based on dual manifold re-ranking (DMRR) is proposed in this paper. Different similarity matrices are constructed to depict the manifold structures among samples, between samples and features, and among features themselves. Then, manifold re-ranking is performed by combining the initial scores of samples and features. By comparing DMRR with three original unsupervised feature selection algorithms and two unsupervised feature selection post-processing algorithms, experimental results confirm that the importance information of different samples and the dual relationship between sample and feature are beneficial for achieving better feature selection.
Code (0)
등록된 구현이 없습니다.
Tasks
feature selectionRe-RankingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Subject Selection on a Riemannian Manifold for Unsupervised Cross-subject Seizure Detection
Inter-subject variability between individuals poses a challenge in inter-subject brain signal analysis problems. A new algorithm for subject-selection based on clustering covariance matrices on a Riemannian manifold is p…
ClusteringEEGElectroencephalogram (EEG)Seizure Detection+1Joint Adaptive Graph and Structured Sparsity Regularization for Unsupervised Feature Selection
Feature selection is an important data preprocessing in data mining and machine learning which can be used to reduce the feature dimension without deteriorating model's performance. Since obtaining annotated data is labo…
feature selectionUnsupervised feature selection via self-paced learning and low-redundant regularization
Much more attention has been paid to unsupervised feature selection nowadays due to the emergence of massive unlabeled data. The distribution of samples and the latent effect of training a learning method using samples i…
feature selectionAdaptive Neighboring Selection Algorithm Based on Curvature Prediction in Manifold Learning
Recently manifold learning algorithm for dimensionality reduction attracts more and more interests, and various linear and nonlinear, global and local algorithms are proposed. The key step of manifold learning algorithm …
Dimensionality ReductionGOLFS: Feature Selection via Combining Both Global and Local Information for High Dimensional Clustering
It is important to identify the discriminative features for high dimensional clustering. However, due to the lack of cluster labels, the regularization methods developed for supervised feature selection can not be direct…