Abstract
Of all the active learning research, the study on the active learning algorithm for SVM is much less. In this paper, based on K-Nearest Neighbors (KNN), we propose a new SVM active learning algorithm. The algorithm first collects the potential informative samples to form a potential informative sample set, and then in this sample set, based on KNN it evaluates the sparseness for each sample. The sample that locates at a sparser region is taken as an informative one, and is selected for training. Experimental results show that the proposed algorithm can greatly improve the classification performance, and can efficiently accelerate the convergence of the classifier.
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.
