The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2005 vol.27)
pp: 801-804
ABSTRACT
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).
INDEX TERMS
Kernel methods, one class SVM, clustering algorithms, EM algorithm, K-Means.
CITATION
Francesco Camastra, Alessandro Verri, "A Novel Kernel Method for Clustering", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.27, no. 5, pp. 801-804, May 2005, doi:10.1109/TPAMI.2005.88
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool