Introduction to statistical pattern recognition (2nd ed.)
Introduction to statistical pattern recognition (2nd ed.)
The nature of statistical learning theory
The nature of statistical learning theory
An introduction to support Vector Machines: and other kernel-based learning methods
An introduction to support Vector Machines: and other kernel-based learning methods
Neural Networks: A Comprehensive Foundation
Neural Networks: A Comprehensive Foundation
Choosing Multiple Parameters for Support Vector Machines
Machine Learning
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Learning by local kernel polarization
Neurocomputing
Feature selection for SVM via optimization of kernel polarization with Gaussian ARD kernels
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Kernels are key components of pattern recognition mechanisms. We propose a universal kernel optimality criterion, which is independent of the classifier to be used. Defining data polarization as a process by which points of different classes are driven to geometrically opposite locations in a confined domain, we propose selecting the kernel parameter values that polarize the data in the associated feature space. Conversely, the kernel is said to be polarized by the data. Kernel polarization gives rise to an unconstrained optimization problem. We show that complete kernel polarization yields consistent classification by kernel-sum classifiers. Tested on real-life data, polarized kernels demonstrate a clear advantage over the Euclidean distance in proximity classifiers. Embedded in a support vectors classifier, kernel polarization is found to yield about the same performance as exhaustive parameter search.