An Unsupervised Attribute Clustering Algorithm for Unsupervised Feature Selection

摘要

The curse of dimensionality refers to the problem that one faces when analyzing datasets with thousands or hundreds of thousands of attributes. This problem is usually tackled by different feature selection methods which have been shown to effectively reduce computation time, improve prediction performance, and facilitate better understanding of datasets in various application areas. These methods can be classified into filter methods, wrapper methods and embedded methods. All of these feature selection methods require class label information to perform their tasks. Hence, when such information is unavailable, the feature selection problem can be very challenging. In order to overcome the above challenges, we propose an unsupervised feature selection method which is called Unsupervised Attribute Clustering Algorithm (UACA) involved in several steps: i) calculate the value of Maximal Information Coefficient for each pair of attributes to construct an attributes distance matrix; ii) cluster all attributes using optimal k-mode clustering method to find out k modes attributes as features of each cluster. For evaluating the performance of the proposed algorithm, classification problems with different classifiers were tested to validate the method and compare with other methods. The results of data experiments exhibit the proposed unsupervised algorithm which is comparable with classical feature selection methods and even outperforms some supervised learning algorithm.