Abstract
Support Vector Machine is gaining popularity as a data mining technique. As it is being extended and applied to more industrial applications, performance limitation will be a real concern when dealing with real commercial activities where the data set can be very huge and quick analysis turnaround is required for quick business decision making. This issue needs to be addressed in order for SVM to become a viable and practical commercial data mining tool. In this paper we will present, evaluate and compare the performance of one particular parallel SVM training algorithm based on MP1 programming. This parallel version of SMO algorithm is proposed to speed up SVM training. One performance model based on generalized Arndahl's formulation is applied to analyze the scalability in terms of problem size and complexity. Further, it is used to provide some guideline to determine the best algorithmlarchitecture combination.
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 callMore From: WIT Transactions on Information and Communication Technologies
Disclaimer: 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.
