Robust Unsupervised Feature Selection via Multi-Group Adaptive Graph Representation

Unsupervised feature selection can play an important role in addressing the issue of processing massive unlabelled high-dimensional data in the domain of machine learning and data mining. This paper presents a novel unsupervised feature selection method, referred to as Multi-Group Adaptive Graph Rep...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on knowledge and data engineering Jg. 35; H. 3; S. 3030 - 3044
Hauptverfasser: You, Mengbo, Yuan, Aihong, Zou, Min, He, Dongjian, Li, Xuelong
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.03.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Adaptation models
adaptive graph constraint
alternative iterative algorithm
Clustering
Data mining
Data models
Faces
Feature extraction
Feature selection
Graph representations
Graphical representations
Iterative algorithms
Iterative methods
Machine learning
multiple groups
Optimization
Similarity
Source code
Sparse matrices
Unsupervised feature selection
ISSN:1041-4347, 1558-2191
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Unsupervised feature selection can play an important role in addressing the issue of processing massive unlabelled high-dimensional data in the domain of machine learning and data mining. This paper presents a novel unsupervised feature selection method, referred to as Multi-Group Adaptive Graph Representation (MGAGR). Different from existing methods, the relationship between features is explored via the global similarity matrix, which is reconstructed by local similarities of multiple groups. Specifically, the similarity of a feature compared to other features can be represented by the linear combination of all the local similarities. The local similarity of a representative group is given a large weight to reconstruct the global similarity. Besides, an iterative algorithm is given to solve the optimization problem, in which the global similarity matrix, its corresponding reconstruction weights and the self-representation matrix are iteratively improved. Experimental results on 8 benchmark datasets demonstrates that the proposed method outperforms the state-of-the-art unsupervised feature selection methods in terms of clustering performance. The source code is available at: https://github.com/misteru/MGAGR .
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1041-4347
1558-2191
DOI:10.1109/TKDE.2021.3124255