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.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com