Efficient implementation of SVM for large class problems

Multiclass classification is an important problem in pattern recognition. Hierarchical SVM classifiers such as DAG-SVM and BHC-SVM are popular in solving multiclass problems. However, a bottleneck with these approaches is the number of component classifiers, and the associated time and space requirements. In this paper, we describe a simple, yet effective method for efficiently storing support vectors that exploits the redundancies in them across the classifiers to obtain significant reduction in storage and computational requirements. We also present our extension to an algebraic exact simplification method for simplifying hierarchical classifier solutions.

• Type: Conference
• Year: 2008
• Where: ICPR
• Authors: Prabakaran Ilayaraja, N. V. Neeba, C. V. Jawahar
• Keywords: Component Classifiers, Computer Vision, Hierarchical Classifier Solutions, Hierarchical SVM Classifiers, ICPR 2008