Abstract
In this paper, a kernelized version of clustering-based discriminant analysis is proposed that we name KCDA. The main idea is to first map the original data into another high-dimensional space, and then to perform clustering-based discriminant analysis in the feature space. Kernel fuzzy c-means algorithm is used to do clustering for each class. A group of tests on two UCI standard benchmarks have been carried out that prove our proposed method is very promising. © 2006 Pattern Recognition Society.
| Original language | English |
|---|---|
| Pages (from-to) | 324-327 |
| Journal | Pattern Recognition |
| Volume | 40 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 2007 |
Research Keywords
- Clustering-based discriminant analysis (CDA)
- Kernel clustering-based discriminant analysis (KCDA)
- Kernel fuzzy c-means
- Kernel linear discriminant analysis (KLDA)
- Linear discriminant analysis (LDA)
Fingerprint
Dive into the research topics of 'Kernel clustering-based discriminant analysis'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver