Skip to main navigation Skip to search Skip to main content

Kernel clustering-based discriminant analysis

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

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 languageEnglish
Pages (from-to)324-327
JournalPattern Recognition
Volume40
Issue number1
DOIs
Publication statusPublished - 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