Abstract
The computational time and space complexity of support vector machine (SVM) are O(n3) and O(n2) respectively, where n is the number of training samples. It is inefficient or impracticable to train an SVM on relatively large datasets. Actually, the removal of training samples that are not support vector (SVs) has no effect on constructing the optimal hyper plane. Based on this idea, this paper proposed a sample selection method which can efficiently choose the candidate SVs from original datasets. The selected samples are used to train SVM. The experimental results show that the proposed method is effective and efficient, it can efficiently reduce the computational complexity both of time and space especially on relatively large datasets.
Sign-in/Register to access full text options 
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.
