A novel scalable algorithm for supervised subspace learning (2006)
| Venue: | in Proceeding of IEEE International Conference on Data Mining |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Yan06anovel,
author = {Jun Yan and Ning Liu and Benyu Zhang and Qiang Yang and Shuicheng Yan and Zheng Chen},
title = {A novel scalable algorithm for supervised subspace learning},
booktitle = {in Proceeding of IEEE International Conference on Data Mining},
year = {2006}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Subspace learning approaches aim to discover important statistical distribution on lower dimensions for high dimensional data. Methods such as Principal Component Analysis (PCA) do not make use of the class information, and Linear Discriminant Analysis (LDA) could not be performed efficiently in a scalable way. In this paper, we propose a novel highly scalable supervised subspace learning algorithm called as Supervised Kampong Measure (SKM). It assigns data points as close as possible to their corresponding class mean, simultaneously assigns data points to be as far as possible from the other class means in the transformed lower dimensional subspace. Theoretical derivation shows that our algorithm is not limited by the number of classes or the singularity problem faced by LDA. Furthermore, our algorithm can be executed in an incremental manner in which learning is done in an online fashion as data streams are received. Experimental results on several datasets, including a very large text data set RCV1, show the outstanding performance of our proposed algorithm on classification problems as compared to PCA, LDA and a popular feature selection approach, Information Gain (IG). 1.
