상세정보
학술대회
Soft Geodesic Kernel K-Means
- 발행일
- 200704
- 출처
- International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2007, pp.II429-II432
- 협약과제
- 06MC1700, 멀티코아 CPU 및 MPU기반 크롯플랫폼 게임기술 개발, 양광호
- 초록
- In this paper we present a kernel method for data clustering, where the soft k-means is carried, out in a feature space, instead of input data space, leading to soft kernel k-means. We also incorporate a geodesic kernel into the soft kernel k-means, in order to take the data manifold structure into account. The method is referred to as soft geodesic kernel k-means. In contrast to k-means, our method, is able to identify clusters that are not linearly separable. In addition, soft responsibilities as well as geodesic kernel, improve the clustering performance, compared to kernel k-means. Numerical experiments with toy data sets and real-world data sets (UCI and document clustering), confirm the useful behavior of the proposed method. © 2007 IEEE.
- KSP 제안 키워드
- Clustering performance, Data clustering, Data manifold, Data sets, Data space, Feature space, Kernel K-means, Manifold structure, Numerical experiments, Real-world data, document clustering