On hard and fuzzy c-means clustering with conditionally positive definite kernel

Author(s):  
Yuchi Kanzawa ◽  
Yasunori Endo ◽  
Sadaaki Miyamoto
Author(s):  
Yuchi Kanzawa ◽  
◽  
Yasunori Endo ◽  
Sadaaki Miyamoto ◽  

In this paper, we investigate three types of c-means clustering algorithms with a conditionally positive definite (cpd) kernel. One is based on hard c-means and two are based on standard and entropy-regularized fuzzy c-means. First, based on a cpd kernel describing a squared Euclidean distance between data in feature space, these algorithms are derived from revised optimization problems of the conventional kernel c-means. Next, based on the relationship between the positive definite (pd) kernel and cpd kernel, the revised dissimilarity between a datum and a cluster center in the feature space is shown. Finally, it is shown that a cpd kernel c-means algorithm and a kernel c-means algorithm with a pd kernel derived from the cpd kernel are essentially identical to each other. Explicit mapping for a cpd kernel is also described geometrically.


2019 ◽  
Vol 8 (4) ◽  
pp. 9548-9551

Fuzzy c-means clustering is a popular image segmentation technique, in which a single pixel belongs to multiple clusters, with varying degree of membership. The main drawback of this method is it sensitive to noise. This method can be improved by incorporating multiresolution stationary wavelet analysis. In this paper we develop a robust image segmentation method using Fuzzy c-means clustering and wavelet transform. The experimental result shows that the proposed method is more accurate than the Fuzzy c-means clustering.


IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Eman Elkhateeb ◽  
Hassan Soliman ◽  
Ahmed Atwan ◽  
Mohammed Elmogy ◽  
Kyung-Sup Kwak ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document