A new unsupervised feature selection algorithm using similarity‐based feature clustering. (3rd October 2018)

• Record Type: Journal Article
• Authors: Zhu, Xiaoyan; Wang, Yu; Li, Yingbin; Tan, Yonghui; Wang, Guangtao; Song, Qinbao
• Is Part Of: Computational intelligence. Volume 35:Number 1(2019)
• Page Start: 2
• Page End: 22
• Publication Date: 2018-10-03
• Subjects: clustering -- feature selection -- feature similarity; Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/coin.12192
• Languages: English
• ISSNs: 0824-7935

Abstract

Abstract: Unsupervised feature selection is an important problem, especially for high‐dimensional data. However, until now, it has been scarcely studied and the existing algorithms cannot provide satisfying performance. Thus, in this paper, we propose a new unsupervised feature selection algorithm using similarity‐based feature clustering, Feature Selection‐based Feature Clustering (FSFC). FSFC removes redundant features according to the results of feature clustering based on feature similarity. First, it clusters the features according to their similarity. A new feature clustering algorithm is proposed, which overcomes the shortcomings of K‐means. Second, it selects a representative feature from each cluster, which contains most interesting information of features in the cluster. The efficiency and effectiveness of FSFC are tested upon real‐world data sets and compared with two representative unsupervised feature selection algorithms, Feature Selection Using Similarity (FSUS) and Multi‐Cluster‐based Feature Selection (MCFS) in terms of runtime, feature compression ratio, and the clustering results of K‐means. The results show that FSFC can not only reduce the feature space in less time, but also significantly improve the clustering performance of K‐means.