The Community for Technology Leaders
Green Image
Issue No. 05 - May (2005 vol. 27)
ISSN: 0162-8828
pp: 801-804
Kernel Methods are algorithms that, by replacing the inner product with an appropriate positive definite function, implicitly perform a nonlinear mapping of the input data into a high-dimensional feature space. In this paper, we present a kernel method for clustering inspired by the classical K-Means algorithm in which each cluster is iteratively refined using a one-class Support Vector Machine. Our method, which can be easily implemented, compares favorably with respect to popular clustering algorithms, like K-Means, Neural Gas, and Self-Organizing Maps, on a synthetic data set and three UCI real data benchmarks (IRIS data, Wisconsin breast cancer database, Spam database).
Kernel methods, one class SVM, clustering algorithms, EM algorithm, K-Means.

F. Camastra and A. Verri, "A Novel Kernel Method for Clustering," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 27, no. , pp. 801-804, 2005.
93 ms
(Ver 3.3 (11022016))