.png){kind=icon}
返回
Robust Unsupervised Feature Selection via Multi-Group Adaptive Graph Representation
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2021.3124255.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Unsupervised feature selection
multiple groups
adaptive graph constraint
alternative iterative algorithm
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
Ability of troponin I to predict cardiac events in patients admitted from the emergency department
.png){kind=icon}
PREAI
分享收藏
The changing epidemiology of paediatric brain tumours: a review from the Hospital for Sick Children
PREAI
分享收藏分享收藏
查看更多内容