A Fast Clustering-Based Feature Subset Selection Algorithm for High-Dimensional Data

A Fast Clustering-Based Feature Subset Selection Algorithm for High-Dimensional Data

Abstract— A Fast Clustering-Based Feature Subset Selection Algorithm for High-Dimensional Data.Feature selection involvesidentifying 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 < Final Year Projects 2016 >is proposed and experimentally evaluated. 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.