Abstract

This paper mainly deals with the problem of short text classification. There are two main contributions. Firstly, we introduce a framework of deep uniform kernel mapping support vector machine (DUKMSVM). The significant merit of this framework is that by expressing the kernel mapping function explicitly with a deep neural network, it is in essence an explicit kernel mapping instead of the traditional kernel function, and it allows better flexibility in dealing with various applications by applying different neural network structures. Secondly, to validate the effectiveness of this framework and to improve the performance of short text classification, we explicitly express the kernel mapping using bidirectional recurrent neural network (BRNN), and propose a deep bidirectional recurrent kernel mapping support vector machine (DRKMSVM) for short text classification. Experimental results on five public short text classification datasets indicate that in terms of classification accuracy, precision, recall rate and F1-score, the DRKMSVM achieves the best performance with the average values of accuracy, precision, recall rate, and F1-score of 87.23%, 86.99%, 86.13% and 86.51% respectively compared to traditional SVM, convolutional neural network (CNN), Naive Bayes (NB), and Deep Neural Mapping Support Vector Machine (DNMSVM) which applies multi-layer perceptron for kernel mapping.

Highlights

  • With the rapid increase of communication on the internet, a large amount of textual data has been generated

  • Considering the advantages of bidirectional recurrent neural network (BRNN), we extended Deep Neural Mapping Support Vector Machine (DNMSVM) to a framework of deep uniform kernel mapping support vector machine (DUKMSVM), and propose a short text classification based on deep recurrent kernel mapping support vector machine (DRKMSVM)

  • In order to verify the effectiveness of DRKMSVM in short text classification, we conducted experiments on 5 public short text datasets and made comparisons with other well-known methods, including DNMSVM, convolutional neural network (CNN), SVM with radial basis function kernel (RBF-SVM) and Naive Bayes (NB)

Read more

Summary

Introduction

With the rapid increase of communication on the internet, a large amount of textual data has been generated. By using TF-IDF as the weighting function, and using semi-supervised learning algorithm for iterative training, this method can improve the performance of traditional SVM method Among these methods, SVM achieves better results than other models in the light of short text classification [11,24]. To solve the kernel learning problem existing in SVM, and considering the mapping ability of deep neural networks, Li et al [34] introduce a short text classification method based on DNMSVM. Learn W j and b j for every RBM of h j−1 and h j ,1 ≤ j ≤ r ; Stage Two: Fine-tuning

14. End For
Representing the Short Text with Word Vector
Representing Kernel Mapping with BRNN
Classifying with SVM
Experimental Results
Datasets
Influence of the Structure of Recurrent Network on DRKMSVM
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call