As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Local SVM is a lazy learner combining k-nearest neighbor search and support vector machine classifier. We propose an improved implementation of local SVM which utilizes tree structure for efficient nearest neighbor search and a method to avoid unnecessary SVM training in areas far from decision boundary. The proposed lazy learner has great advantage on cross-validation efficiency while maintaining comparable accuracy to traditional SVM. The proposed method also enables us to conduct leave-one-out cross-validation which is previously considered too time-consuming to be practical on large dataset.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.