In this paper, a novel clustering method in the kernel space is proposed. It effectively integrates several existing algorithms to become an iterative clustering scheme, which can handle clusters with arbitrary shapes. In our proposed approach, a reasonable initial core for each of the cluster is es
A kernel-based subtractive clustering method
โ Scribed by Dae-Won Kim; KiYoung Lee; Doheon Lee; Kwang H. Lee
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 352 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0167-8655
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper the conventional subtractive clustering method is extended by calculating the mountain value of each data point based on a kernel-induced distance instead of the conventional sum-of-squares distance. The kernel function is a generalization of the distance metric that measures the distance between two data points as the data points are mapped into a high dimensional space. Use of the kernel function makes it possible to cluster data that is linearly non-separable in the original space into homogeneous groups in the transformed high dimensional space. Application of the conventional subtractive method and the kernel-based subtractive method to well-known data sets showed the superiority of the proposed approach.
๐ SIMILAR VOLUMES
The mountain method of clustering and its relative, the subtractive clustering method, are studied here. A scheme to improve the accuracy of the prototypes obtained by the mountain method is proposed. Finally the mountain circular shell method to detect circular shells by using the mountain function