Kernel pooled local subspaces for classification

Peng Zhang, Jing Peng, Carlotta Domeniconi

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


We investigate the use of subspace analysis methods for learning low-dimensional representations for classification. We propose a kernel-pooled local discriminant subspace method and compare it against competing techniques: kernel principal component analysis (KPCA) and generalized discriminant analysis (GDA) in classification problems. We evaluate the classification performance of the nearest-neighbor rule with each subspace representation. The experimental results using several data sets demonstrate the effectiveness and performance superiority of the kernel-pooled subspace method over competing methods such as KPCA and GDA in some classification problems.

Original languageEnglish
Pages (from-to)489-502
Number of pages14
JournalIEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Issue number3
StatePublished - Jun 2005


  • Classification
  • Kernel machines
  • Nearest neighbors
  • Subspace analysis


Dive into the research topics of 'Kernel pooled local subspaces for classification'. Together they form a unique fingerprint.

Cite this