4.6 Article

Convex and concave hulls for classification with support vector machine

期刊

NEUROCOMPUTING
卷 122, 期 -, 页码 198-209

出版社

ELSEVIER
DOI: 10.1016/j.neucom.2013.05.040

关键词

Convex hull; Support vector machine

向作者/读者索取更多资源

The training of a support vector machine (SVM) has the time complexity of O(n(3)) with data number n. Normal SVM algorithms are not suitable for classification of large data sets. Convex hull can simplify SVM training, however the classification accuracy becomes lower when there are inseparable points. This paper introduces a novel method for SVM classification, called convex-concave hull. After grid pre-processing, the convex hull and the concave (non-convex) hull are found by Jarvis march method. Then the vertices of the convex-concave hull are applied for SVM training. The proposed convex-concave hull SVM classifier has distinctive advantages on dealing with large data sets with higher accuracy. Experimental results demonstrate that our approach has good classification accuracy while the training is significantly faster than the other training methods. (C) 2013 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据