Adaptive Dimension Reduction Using Discriminant Analysis and K-Means Clustering
Abstract
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. Relations among PCA, LDA, K -means are clarified. Extensive experimental results on real-world datasets show the effectiveness of our approach.
Cite
Text
Ding and Li. "Adaptive Dimension Reduction Using Discriminant Analysis and K-Means Clustering." International Conference on Machine Learning, 2007. doi:10.1145/1273496.1273562Markdown
[Ding and Li. "Adaptive Dimension Reduction Using Discriminant Analysis and K-Means Clustering." International Conference on Machine Learning, 2007.](https://mlanthology.org/icml/2007/ding2007icml-adaptive/) doi:10.1145/1273496.1273562BibTeX
@inproceedings{ding2007icml-adaptive,
title = {{Adaptive Dimension Reduction Using Discriminant Analysis and K-Means Clustering}},
author = {Ding, Chris H. Q. and Li, Tao},
booktitle = {International Conference on Machine Learning},
year = {2007},
pages = {521-528},
doi = {10.1145/1273496.1273562},
url = {https://mlanthology.org/icml/2007/ding2007icml-adaptive/}
}