A new unsupervised feature selection algorithm using similarity-based feature clustering

被引:32
|
作者
Zhu, Xiaoyan [1 ]
Wang, Yu [1 ]
Li, Yingbin [1 ]
Tan, Yonghui [1 ]
Wang, Guangtao [2 ]
Song, Qinbao [1 ]
机构
[1] Xi An Jiao Tong Univ, Sch Elect & Informat Engn, Xian, Shaanxi, Peoples R China
[2] JD AI Res, Mountain View, CA USA
基金
中国国家自然科学基金;
关键词
clustering; feature selection; feature similarity; CLASSIFICATION;
D O I
10.1111/coin.12192
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
下载
收藏
页码:2 / 22
页数:21
相关论文
共 50 条
  • [21] Topological Similarity-Based Feature Selection for Graph Classiinot signcation
    Han, Yongkoo
    Park, Kisung
    Guan, Donghai
    Halder, Sajal
    Lee, Young-Koo
    COMPUTER JOURNAL, 2015, 58 (09): : 1884 - 1893
  • [22] Unsupervised feature selection using feature similarity (vol 24, pg 301, 2002)
    Mitra, P
    Murthy, CA
    Pal, SK
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (06) : 721 - 721
  • [23] An efficient unsupervised feature selection procedure through feature clustering
    Yan, Xuyang
    Nazmi, Shabnam
    Erol, Berat A.
    Homaifar, Abdollah
    Gebru, Biniam
    Tunstel, Edward
    PATTERN RECOGNITION LETTERS, 2020, 131 : 277 - 284
  • [24] A new unsupervised feature selection method for text clustering based on genetic algorithms
    Shamsinejadbabki, Pirooz
    Saraee, Mohammad
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2012, 38 (03) : 669 - 684
  • [25] Multiview Data Clustering with Similarity Graph Learning Guided Unsupervised Feature Selection
    Li, Ni
    Peng, Manman
    Wu, Qiang
    ENTROPY, 2023, 25 (12)
  • [26] A new unsupervised feature selection method for text clustering based on genetic algorithms
    Pirooz Shamsinejadbabki
    Mohammad Saraee
    Journal of Intelligent Information Systems, 2012, 38 : 669 - 684
  • [27] Similarity Preserving Unsupervised Feature Selection based on Sparse Learning
    Zare, Hadi
    Parsa, Mohsen Ghasemi
    Ghatee, Mehdi
    Alizadeh, Sasan H.
    2020 10TH INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATIONS (IST), 2020, : 50 - 55
  • [28] Unsupervised Feature Selection Technique Based on Harmony Search Algorithm for Improving the Text Clustering
    Abualigah, Laith Mohammad
    Khader, Ahamad Tajudin
    Al-Betar, Mohammed Azmi
    2016 7TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (CSIT), 2016,
  • [29] A Clustering Based Genetic Algorithm for Feature Selection
    Rostami, Mehrdad
    Moradi, Parham
    2014 6TH CONFERENCE ON INFORMATION AND KNOWLEDGE TECHNOLOGY (IKT), 2014, : 112 - 116
  • [30] A fuzzy clustering based algorithm for feature selection
    Sun, HJ
    Wang, SR
    Mei, Z
    2002 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-4, PROCEEDINGS, 2002, : 1993 - 1998