While explicit mapping is generally unknown for kernel data analysis, its inner product should be known. Although we proposed a kernel fuzzy c-means algorithm for data with tolerance, cluster centers and tolerance in higher dimensional space have not been seen. Contrary to this common assumption, explicit mapping has been introduced and the situation of kernel fuzzy c-means in higher dimensional space has been described via kernel principal component analysis using explicit mapping. In this paper, cluster centers and the tolerance of kernel fuzzy c-means for data with olerance are described via kernel principal component analysis using explicit mapping.
|ジャーナル||Journal of Advanced Computational Intelligence and Intelligent Informatics|
|出版ステータス||Published - 2012 1月|
ASJC Scopus subject areas
- コンピュータ ビジョンおよびパターン認識