Feature Selection for Unsupervised Learning
Jennifer Dy, Carla E. Brodley · 2004
In this paper, we identify two issues involved in developing an automated feature subset selection algorithm for unlabeled data: the need for finding the number of clusters in conjunction with feature selection, and the need for normalizing the bias of feature selection criteria with respect to dimension. We explore the feature selection problem and these issues through FSSEM (Feature Subset Selection using Expectation-Maximization (EM) clustering) and through two different performance criteria for evaluating candidate feature subsets: scatter separability and maximum likelihood. We present proofs on the dimensionality biases of these feature criteria, and present a cross-projection normalization scheme that can be applied to any criterion to ameliorate these biases. Our experiments show the need for feature selection, the need for addressing these two issues, and the effectiveness of our proposed solutions.
Cited by 885 works. doi:10.5555/1005332.1016787
Authors
References
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- Pattern classification and scene analysis
- A new look at the statistical model identification
- Estimating the Dimension of a Model
- Introduction to Modern Information Retrieval
- Pattern Recognition and Neural Networks
- Artificial intelligence: a modern approach
- UCI Repository of machine learning databases
- Algorithms for Clustering Data
- Applied Multivariate Statistical Analysis.