Feature Selection for Clustering

Abstract

Clustering is an important data mining task. Data mining often concerns large and high-dimensionai data but unfortunately most of the clustering algorithms in the literature axe sensitive to largeness or high-dimensionality or both. Different features affect clusters differently, some are important for clusters while others may hinder the clustering task. An efficient way of handling it is by selecting a subset of important features. It helps in finding clusters efficiently, understanding the data better and reducing data size for efficient storage, collection and processing. The task of finding original important features for unsupervised data is largely untouched. Traditional feature selection algorithms work only for supervised data where class information is avaiilable. For unsupervised data, without class information, often principal components (PCs) Eire used, but PCs still require all features and they may be difficult to understand. Our approach: first features Eire ranked Eiccording to their importance on clustering and then a subset of important features are selected. For large data we use a scalable method using sampling. Empirical evaluation shows the effectiveness and scalability of our approach for benchmark and synthetic data sets.