Text categorization is widely used in applications such as spam filtering, identification of document genre, authorship attribution, and automated essay grading. The rapid growth in the amount of text data gives rise to the urgent need for fast text classification algorithms. In this paper, we propose a GPU based SVM solver for large scale text datasets. Using Platt’s Sequential Minimal Optimization algorithm, we achieve a speedup of 5–40 times over LibSVM running on a high-end traditional processor. Prediction time based on the paralleled string kernel computing scheme shows 5–90 times faster performance than the CPU based implementation.
Swipe to navigate through the chapters of this book
Please log in to get access to this content
To get access to this content you need the following product:
- Fast Implementation of String-Kernel-Based Support Vector Classifiers by GPU Computing
- Springer Berlin Heidelberg
- Sequence number