Fast Support Vector Machine Classification of Very Large Datasets

In many classification applications, Support Vector Machines (SVMs) have proven to be highly performing and easy to handle classifiers with very good generalization abilities. However, one drawback of the SVM is its rather high classification complexity which scales linearly with the number of Support Vectors (SVs). This is due to the fact that for the classification of one sample, the kernel function has to be evaluated for all SVs. To speed up classification, different approaches have been published, most which of try to reduce the number of SVs. In our work, which is especially suitable for very large datasets, we follow a different approach: as we showed in [12], it is effectively possible to approximate large SVM problems by decomposing the original problem into linear subproblems, where each subproblem can be evaluated in (1). This approach is especially successful, when the assumption holds that a large classification problem can be split into mainly easy and only a few hard sub...

• Type: Conference
• Year: 2007
• Where: GFKL
• Authors: Janis Fehr, Karina Zapien Arreola, Hans Burkhardt
• Keywords: Data Mining, GFKL 2007, Large Classification Problem, Original Problem, Support Vectors