This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Fast Clustering-Based Feature Subset Selection Algorithm for High-Dimensional Data
Jan. 2013 (vol. 25 no. 1)
pp. 1-14
Qinbao Song, Dept. of Comput. Sci. & Technol., Xi'an Jiaotong Univ., Xian, China
Jingjie Ni, Dept. of Comput. Sci. & Technol., Xi'an Jiaotong Univ., Xian, China
Guangtao Wang, Dept. of Comput. Sci. & Technol., Xi'an Jiaotong Univ., Xian, China
Feature selection involves identifying a subset of the most useful features that produces compatible results as the original entire set of features. A feature selection algorithm may be evaluated from both the efficiency and effectiveness points of view. While the efficiency concerns the time required to find a subset of features, the effectiveness is related to the quality of the subset of features. Based on these criteria, a fast clustering-based feature selection algorithm (FAST) is proposed and experimentally evaluated in this paper. The FAST algorithm works in two steps. In the first step, features are divided into clusters by using graph-theoretic clustering methods. In the second step, the most representative feature that is strongly related to target classes is selected from each cluster to form a subset of features. Features in different clusters are relatively independent, the clustering-based strategy of FAST has a high probability of producing a subset of useful and independent features. To ensure the efficiency of FAST, we adopt the efficient minimum-spanning tree (MST) clustering method. The efficiency and effectiveness of the FAST algorithm are evaluated through an empirical study. Extensive experiments are carried out to compare FAST and several representative feature selection algorithms, namely, FCBF, ReliefF, CFS, Consist, and FOCUS-SF, with respect to four types of well-known classifiers, namely, the probability-based Naive Bayes, the tree-based C4.5, the instance-based IB1, and the rule-based RIPPER before and after feature selection. The results, on 35 publicly available real-world high-dimensional image, microarray, and text data, demonstrate that the FAST not only produces smaller subsets of features but also improves the performances of the four types of classifiers.
Index Terms:
pattern clustering,data handling,graph theory,MST,fast clustering based feature subset selection algorithm,high dimensional data,feature selection,FAST,graph theoretic clustering methods,minimum spanning tree,Clustering algorithms,Complexity theory,Markov processes,Prediction algorithms,Correlation,Accuracy,Partitioning algorithms,graph-based clustering,Feature subset selection,filter method,feature clustering
Citation:
Qinbao Song, Jingjie Ni, Guangtao Wang, "A Fast Clustering-Based Feature Subset Selection Algorithm for High-Dimensional Data," IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 1, pp. 1-14, Jan. 2013, doi:10.1109/TKDE.2011.181
Usage of this product signifies your acceptance of the Terms of Use.