Name
Abstract | ||
|---|---|---|
We present a novel clustering method using the approach of support vector machines. Data points are mapped by means of a Gaussian kernel to a high dimensional feature space, where we search for the minimal enclosing sphere. This sphere, when mapped back to data space, can separate into several components, each enclosing a separate cluster of points. We present a simple algorithm for identifying these clusters. The width of the Gaussian kernel controls the scale at which the data is probed while the soft margin constant helps coping with outliers and overlapping clusters. The structure of a dataset is explored by varying the two parameters, maintaining a minimal number of support vectors to assure smooth cluster boundaries. We demonstrate the performance of our algorithm on several datasets. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.4249/scholarpedia.5187 | Scholarpedia |
Keywords | DocType | Volume |
support vector clustering,high dimensional feature space,gaussian kernel,support vector,overlapping cluster,data space,data point,smooth cluster boundary,support vectors machines,separate cluster,minimal number,simple algorithm,clustering | Journal | 3 |
Issue | Citations | PageRank |
6 | 185 | 14.71 |
References | Authors | |
7 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Asa Ben-Hur | 1 | 1405 | 110.73 |
| David Horn | 2 | 254 | 29.05 |
| Hava T. Siegelmann | 3 | 980 | 145.09 |
| Vladimir Vapnik | 4 | 16075 | 3397.91 |