An efficient clustering scheme using support vector methods

doi:10.1016/j.patcog.2006.03.012

An efficient clustering scheme using support vector methods

2006-08-01

15

PRE

AI

S

Shirish Shevade

DOI：10.1016/j.patcog.2006.03.012

原文链接

原文求助

摘要

En 中文

Support vector clustering involves three steps-solving an optimization problem, identification of clusters and tuning of hyper-parameters. In this paper, we introduce a pre-processing step that eliminates data points from the training data that are not crucial for clustering. Pre-processing is efficiently implemented using the R*-tree data structure. Experiments on real-world and synthetic datasets show that pre-processing drastically decreases the run-time of the clustering algorithm. Also, in many cases reduction in the number of support vectors is achieved. Further, we suggest an improvement for the step of identification of clusters. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Keyword:

clustering

support vector machines

R*-tree

An efficient clustering scheme using support vector methods

摘要

AI总结

期刊

机构

引用论文