Abstract | ||
---|---|---|
Although the kernel-based fuzzy c-means (KFCM) algorithm utilizing a kernel-based distance measure between patterns and cluster prototypes outperforms the standard fuzzy c-means clustering for some complex distributed data, it is quite sensitive to selected kernel parameters. In this paper, we propose the stretched kernel-based fuzzy clustering method with optimized kernel parameter. The kernel parameters are updated in accordance with the gradient method to further optimize the objective function during each iteration process. To solve the local minima problem of the objective function, a function stretching technique is applied to detect the global minimum. Experiments on both synthetic and real-world datasets show that the stretched KFCM algorithm with optimized kernel parameters has better performance than other algorithms. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1007/978-3-642-40705-5_5 | PARTIALLY SUPERVISED LEARNING, PSL 2013 |
Keywords | Field | DocType |
Kernel fuzzy c-means, Kernel parameter, Optimization, Stretching technique | Gradient method,Kernel (linear algebra),Fuzzy clustering,Pattern recognition,Computer science,Fuzzy logic,Maxima and minima,Artificial intelligence,Cluster analysis,Variable kernel density estimation,Iteration process | Conference |
Volume | Issue | ISSN |
8193 | null | 0302-9743 |
Citations | PageRank | References |
1 | 0.39 | 5 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Chunhong Lu | 1 | 77 | 1.06 |
Zhaomin Zhu | 2 | 81 | 2.50 |
Xiaofeng Gu | 3 | 113 | 14.72 |