Support Vector Clustering
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.
Code (1)
Tasks
ClusteringSimilar Papers 제목 키워드 기반
An Investigation on Support Vector Clustering for Big Data in Quantum Paradigm
The support vector clustering algorithm is a well-known clustering algorithm based on support vector machines using Gaussian or polynomial kernels. The classical support vector clustering algorithm works well in general,…
ClusteringEnsemble-driven support vector clustering: From ensemble learning to automatic parameter estimation
Support vector clustering (SVC) is a versatile clustering technique that is able to identify clusters of arbitrary shapes by exploiting the kernel trick. However, one hurdle that restricts the application of SVC lies in …
ClusteringEnsemble Learningparameter estimationAccelerate Support Vector Clustering via Spectrum-Preserving Data Compression
This paper proposes a novel framework for accelerating support vector clustering. The proposed method first computes much smaller compressed data sets while preserving the key cluster properties of the original data sets…
ClusteringData CompressionA Rapid Pattern-Recognition Method for Driving Types Using Clustering-Based Support Vector Machines
A rapid pattern-recognition approach to characterize driver's curve-negotiating behavior is proposed. To shorten the recognition time and improve the recognition of driving styles, a k-means clustering-based support vect…
ClusteringRamp-based Twin Support Vector Clustering
Traditional plane-based clustering methods measure the cost of within-cluster and between-cluster by quadratic, linear or some other unbounded functions, which may amplify the impact of cost. This letter introduces a ram…
Clustering