摘要
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.
源语言 | 英语 |
---|---|
页(从-至) | 324-327 |
页数 | 4 |
期刊 | Pattern Recognition |
卷 | 40 |
期 | 1 |
DOI | |
出版状态 | 已出版 - 1月 2007 |