Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
