.png){kind=icon}
.png){kind=icon}
Return
An efficient unsupervised feature selection procedure through feature clustering
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2019.12.022.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Due to the scarcity of readily available labels, unsupervised feature selection (UFS) methods are widely adopted in the analysis of high-dimensional data. However, most of the existing UFS methods primarily focus on the significance of features in maintaining the data structure while ignoring the redundancy among features. Moreover, the determination of the proper number of features is another challenge. In this paper, an efficient unsupervised feature selection method through feature clustering (EUFSFC) is proposed to address the redundancy among features, and to determine the size of the final feature subset. The proposed methodology is comprised of two steps: (a) feature cluster analysis, and (b) the selection of the representative features. An extended density-based clustering algorithm is proposed to separate features into an appropriate number of disjoint clusters with no requirement for predefined cluster numbers or radii. The selection of features is performed by choosing the most representative features from those feature clusters. Experiments are conducted to show the effectiveness of the proposed feature selection method. (c) 2020 Elsevier B.V. All rights reserved.
Keywords:
Unsupervised feature selection
Feature clustering
Feature redundancy
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
7.8K
Citations:
1.6W