Abstract

This paper presents the SECu-SVM algorithm for solving classification problems. It allows for a significant acceleration of the standard SVM implementations by transferring the most time-consuming computations from the standard CPU to the Graphics Processor Units (GPU). In addition, highly efficient Sliced EllR-T sparse matrix format was used for storing the dataset in GPU memory, which requires a very low memory footprint and is also well adapted to parallel processing. Performed experiments demonstrate an acceleration of 4–100 times over LibSVM. Moreover, in the majority of cases the SECu-SVM is less time-consuming than the best sparse GPU implementations and allows for handling significantly larger classification datasets.

Full Text
Paper version not known

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 call

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.