Text Classification Using Support Vector Machine with Mixture of Kernel

HTML  Download Download as PDF (Size: 129KB)  PP. 55-58  
DOI: 10.4236/jsea.2012.512B012    5,453 Downloads   8,669 Views  Citations
Author(s)

ABSTRACT

Recent studies have revealed that emerging modern machine learning techniques are advantageous to statistical models for text classification, such as SVM. In this study, we discuss the applications of the support vector machine with mixture of kernel (SVM-MK) to design a text classification system. Differing from the standard SVM, the SVM-MK uses the 1-norm based object function and adopts the convex combinations of single feature basic kernels. Only a linear programming problem needs to be resolved and it greatly reduces the computational costs. More important, it is a transparent model and the optimal feature subset can be obtained automatically. A real Chinese corpus from FudanUniversityis used to demonstrate the good performance of the SVM- MK.

Share and Cite:

L. Wei, B. Wei and B. Wang, "Text Classification Using Support Vector Machine with Mixture of Kernel," Journal of Software Engineering and Applications, Vol. 5 No. 12B, 2012, pp. 55-58. doi: 10.4236/jsea.2012.512B012.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.