Data mining with decision trees and decision rules
Future Generation Computer Systems - Special double issue on data mining
Machine learning in automated text categorization
ACM Computing Surveys (CSUR)
One-class svms for document classification
The Journal of Machine Learning Research
Radius margin bounds for support vector machines with the RBF kernel
Neural Computation
Applications of support vector machines to speech recognition
IEEE Transactions on Signal Processing
IEEE Transactions on Neural Networks
A multi-faceted approach to query intent classification
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Hi-index | 0.00 |
Two multi-label text classification algorithms are proposed. Firstly, one-against-rest method is used to train sub-classifiers. For the text to be classified, the sub-classifiers are used to obtain the membership vector, and then confirm the classes of the text. Secondly, hyper-sphere support vector machine is used to obtain the smallest hyper-spheres in feature space that contains most texts of the class, which can divide the class texts from others. For the text to be classified, the distances from it to the centre of every hypersphere are used to confirm the classes of the text. The experimental results show that the algorithms have high performance on recall, precision, and F1.