Towards a robust fuzzy clustering
Fuzzy Sets and Systems - Data analysis
Mercer kernel-based clustering in feature space
IEEE Transactions on Neural Networks
A Kernel-Based Two-Stage One-Class Support Vector Machines Algorithm
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study
Data & Knowledge Engineering
A novel robust kernel for visual learning problems
Neurocomputing
A kernel prototype-based clustering algorithm
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Regularized soft K-means for discriminant analysis
Neurocomputing
Hi-index | 0.00 |
We present a method for extracting arbitrarily shaped clusters buried in uniform noise data. The popular k-means algorithm is firstly fuzzified with addition of entropic terms to the objective function of data partitioning problem. This fuzzy clustering is then kernelized for adapting to the arbitrary shape of clusters. Finally, the Euclidean distance in this kernelized fuzzy clustering is modified to a robust one for avoiding the influence of noisy background data. This robust kernel fuzzy clustering method is shown to outperform every its predecessor: fuzzified k-means, robust fuzzified k-means and kernel fuzzified k-means algorithms.