Fast support vector clustering
نویسندگان
چکیده
منابع مشابه
Fast Support Vector Data Description Using K-Means Clustering
Support Vector Data Description (SVDD) has a limitation for dealing with a large data set in which computational load drastically increases as training data size becomes large. To handle this problem, we propose a new fast SVDDmethod using K-means clustering method. Our method uses divide-and-conquer strategy; trains each decomposed subproblems to get support vectors and retrains with the suppo...
متن کامل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...
متن کاملSupport Vector Clustering Preliminary Experiments
In this document we present the results of some preliminary experiments using Support Vector Clustering (SVC). The experiments were conducted both over synthetic data sets and over real-world data sets taken from UCI Repository of Machine Learning Database.
متن کاملFast Multilevel Support Vector Machines
Solving different types of optimization models (including parameters fitting) for support vector machines on largescale training data is often an expensive computational task. This paper proposes a multilevel algorithmic framework that scales efficiently to very large data sets. Instead of solving the whole training set in one optimization process, the support vectors are obtained and gradually...
متن کاملCone Cluster Labeling for Support Vector Clustering
Clustering forms natural groupings of data points that maximize intra-cluster similarity and minimize intercluster similarity. Support Vector Clustering (SVC) is a clustering algorithm that can handle arbitrary cluster shapes. One of the major SVC challenges is a cluster labeling performance bottleneck. We propose a novel cluster labeling algorithm that relies on approximate coverings both in f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vietnam Journal of Computer Science
سال: 2016
ISSN: 2196-8888,2196-8896
DOI: 10.1007/s40595-016-0068-y