Clustering Incomplete Data Using Kernel-Based Fuzzy C-means Algorithm
Neural Processing Letters
Kernel Methods for Pattern Analysis
Kernel Methods for Pattern Analysis
Adaptive Quasiconformal Kernel Nearest Neighbor Classification
IEEE Transactions on Pattern Analysis and Machine Intelligence
A kernel optimization method based on the localized kernel Fisher criterion
Pattern Recognition
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study
Data & Knowledge Engineering
Semi-supervised fuzzy clustering: A kernel-based approach
Knowledge-Based Systems
A new Kernelized hybrid c-mean clustering model with optimized parameters
Applied Soft Computing
Accelerated max-margin multiple kernel learning
Applied Intelligence
Hi-index | 0.01 |
Choosing appropriate values for kernel parameters is one of the key problems in many kernel-based methods because the values of these parameters have significant impact on the performances of these methods. In this paper, a novel approach is proposed to learn the kernel parameters in kernel minimum distance (KMD) classifier, where the values of the kernel parameters are computed through optimizing an objective function designed for measuring the classification reliability of KMD. Experiments on both artificial and real-world datasets show that the proposed approach works well on learning kernel parameters of KMD.