An Ensemble Feature Ranking Algorithm for Clustering Analysis
- Authors
- Yu, Jaehong; Zhong, Hua; Kim, Seoung Bum
- Issue Date
- 7월-2020
- Publisher
- SPRINGER
- Keywords
- Ensemble importance score; Random subspace method; Silhouette decomposition; Unsupervised feature ranking
- Citation
- JOURNAL OF CLASSIFICATION, v.37, no.2, pp.462 - 489
- Indexed
- SCIE
SSCI
SCOPUS
- Journal Title
- JOURNAL OF CLASSIFICATION
- Volume
- 37
- Number
- 2
- Start Page
- 462
- End Page
- 489
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/54469
- DOI
- 10.1007/s00357-019-09330-8
- ISSN
- 0176-4268
- Abstract
- Feature ranking is a widely used feature selection method. It uses importance scores to evaluate features and selects those with high scores. Conventional unsupervised feature ranking methods do not consider the information on cluster structures; therefore, these methods may be unable to select the relevant features for clustering analysis. To address this limitation, we propose a feature ranking algorithm based on silhouette decomposition. The proposed algorithm calculates the ensemble importance scores by decomposing the average silhouette widths of random subspaces. By doing so, the contribution of a feature in generating cluster structures can be represented more clearly. Experiments on different benchmark data sets examined the properties of the proposed algorithm and compared it with the existing ensemble-based feature ranking methods. The experiments demonstrated that the proposed algorithm outperformed its existing counterparts.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Industrial and Management Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.