An Ensemble Feature Ranking Algorithm for Clustering Analysis

Jaehong Yu, Hua Zhong, Seoung Bum Kim

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)462-489
Number of pages28
JournalJournal of Classification
Volume37
Issue number2
DOIs
Publication statusPublished - 2020 Jul 1

Keywords

  • Ensemble importance score
  • Random subspace method
  • Silhouette decomposition
  • Unsupervised feature ranking

ASJC Scopus subject areas

  • Mathematics (miscellaneous)
  • Psychology (miscellaneous)
  • Statistics, Probability and Uncertainty
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'An Ensemble Feature Ranking Algorithm for Clustering Analysis'. Together they form a unique fingerprint.

  • Cite this