Patent Classification Using Parallel Min-Max Modular Support Vector Machine

The patent classification problem has a very large scale dataset. Traditional classifiers cannot efficiently solve the problem. In this work, we introduce an improved parallel Min-Max Modular Support Vector Machine (M-3-SVM) to solve the problem. Both theoretical analysis and experimental results show that M-3-SVM has much less training time than standard SVMlight. The experimental results also show that M-3-SVM can achieve higher F-1 measure than SVMlight while predicting. Since the original M-3-SVM costs too much time while predicting, in this work, we also introduce two pipelined parallel classifier selection algorithms to speed up the prediction process. Results on the patent classification experiments show that these two algorithms are pretty effective and scalable.