Adaptive dimension reduction using discriminant analysis and K-means clustering

We combine linear discriminant analysis (LDA) and K-means clustering into a coherent framework to adaptively select the most discriminative subspace. We use K-means clustering to generate class labels and use LDA to do subspace selection. The clustering process is thus integrated with the subspace selection process and the data are then simultaneously clustered while the feature subspaces are selected. We show the rich structure of the general LDA-Km framework by examining its variants and their relationships to earlier approaches. Extensive experimental results on real-world datasets show the effectiveness of our approach.

• Type: Conference
• Year: 2007
• Where: ICML
• Authors: Chris H. Q. Ding, Tao Li
• Keywords: Clustering Process, Discriminative Subspace, ICML 2007, Machine Learning, Subspace Selection Process