Support Vector Clustering(全文).pdfVIP

Journal of Machine Learning Research 2 (2001) 125-137 Submitted 3/01; Published 12/01 Support Vector Clustering Asa Ben-Hur asa@ BIOwulf Technologies 2030 Addison st. suite 102, Berkeley, CA 94704, USA David Horn horn@post.tau.ac.il School of Physics and Astronomy Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv 69978, Israel Hava T. Siegelmann hava@ Lab for Information and Decision Systems MIT Cambridge, MA 02139, USA Vladimir Vapnik vlad@ ATT Labs Research 100 Schultz Dr., Red Bank, NJ 07701, USA Editor: Nello Critianini, John Shawe-Taylor and Bob Williamson 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. Keywords: Clustering, Support Vectors Machines, Gaussian Kernel 1. Introduction Clust