A Novel Scheme for Accelerating Support Vector Clustering
Keywords:Support vector clustering, noise elimination, centroid, semi-supervised clustering
AbstractLimited by two time-consuming steps, solving the optimization problem and labeling the data points with cluster labels, the support vector clustering (SVC) based algorithms, perform ineffectively in processing large datasets. This paper presents a novel scheme aimed at solving these two problems and accelerating the SVC. Firstly, an innovative definition of noise data points is proposed which can be applied in the design of noise elimination to reduce the size of a data set as well as to improve its separability without destroying the profile. Secondly, in the cluster labeling, a double centroids (DBC) labeling method, representing each cell of a cluster by the centroids of shape and density, is presented. This method is implemented towards accelerating this procedure and addressing the problem of labeling the original data set with irregular or imbalanced distribution. Compared with the state-of-the-art algorithms, the experimental results show that the proposed method significantly reduces the computational resources and improves the accuracy. Further analysis and experiments of semi-supervised cluster labeling confirm that the proposed DBC model is suitable for representing cells in clustering.
Download data is not yet available.
How to Cite
Ping, Y., Zhou, Y., & Yang, Y. (2012). A Novel Scheme for Accelerating Support Vector Clustering. COMPUTING AND INFORMATICS, 31(3), 613–638. Retrieved from https://www.cai.sk/ojs/index.php/cai/article/view/1011