Published Articles >> Table of Contents >> Abstract

Third IEEE International Conference on Data Mining (ICDM'03)   p. 701
Dimensionality Reduction Using Kernel Pooled Local Discriminant Information
Peng Zhang, Tulane University, New Orleans, LA
Jing Peng, Tulane University, New Orleans, LA
Carlotta Domeniconi, George Mason University, Fairfax, VA

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2003.1251012
Send link to a friend

Abstract
We study the use of kernel subspace methods for learning low-dimensional representations for classification. We propose a kernel pooled local discriminant subspace method and compare it against several competing techniques: generalized Fisher discriminant analysis (GDA) and kernel principal components analysis (KPCA) in classification problems. We evaluate the classification performance of the nearest-neighbor rule with each subspace representation. The experimental results demonstrate the efficacy of the kernel pooled local subspace method and the potential for substantial improvements over competing methods such as KPCA in some classification problems.
Back to Top Additional Information
Citation:  Peng Zhang, Jing Peng, Carlotta Domeniconi, "Dimensionality Reduction Using Kernel Pooled Local Discriminant Information," icdm, p. 701,  Third IEEE International Conference on Data Mining (ICDM'03),  2003