This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2012 IEEE 12th International Conference on Data Mining Workshops
Convex-Concave Hull for Classification with Support Vector Machine
Brussels, Belgium Belgium
December 10-December 10
ISBN: 978-1-4673-5164-5
Support vector machine (SVM) is not suitable for classification on large data sets due to its training complexity. 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 a grid processing, the convex hull is used to find extreme points. Then we detect a concave (non-convex) hull, the vertices of it are used to train SVM. We applied the proposed method on several problems. Experimental results demonstrate that our approach has good classification accuracy while the training is significantly faster than other state of the art methods.
Index Terms:
Support vector machines,Training,Accuracy,Binary trees,Clustering algorithms,Vegetation,Silicon,non convex hull,SVM,convex hull
Citation:
Asdrubal Lopez-Chau, Xiaoou Li, Wen Yu, "Convex-Concave Hull for Classification with Support Vector Machine," icdmw, pp.431-438, 2012 IEEE 12th International Conference on Data Mining Workshops, 2012
Usage of this product signifies your acceptance of the Terms of Use.