2015
DOI: 10.1155/2015/878291
|View full text |Cite
|
Sign up to set email alerts
|

A Linear-RBF Multikernel SVM to Classify Big Text Corpora

Abstract: Support vector machine (SVM) is a powerful technique for classification. However, SVM is not suitable for classification of large datasets or text corpora, because the training complexity of SVMs is highly dependent on the input size. Recent developments in the literature on the SVM and other kernel methods emphasize the need to consider multiple kernels or parameterizations of kernels because they provide greater flexibility. This paper shows a multikernel SVM to manage highly dimensional data, providing an a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0
2

Year Published

2016
2016
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 28 publications
(16 citation statements)
references
References 41 publications
0
13
0
2
Order By: Relevance
“…the ith neuron of the hidden layer, and ∑ is the neuron of the output layer, y i (i=1, ···, m) is the ith output of RBF NN [14] . was defined as …”
Section: Discrimination Analysis Methodsmentioning
confidence: 99%
“…the ith neuron of the hidden layer, and ∑ is the neuron of the output layer, y i (i=1, ···, m) is the ith output of RBF NN [14] . was defined as …”
Section: Discrimination Analysis Methodsmentioning
confidence: 99%
“…The state-of-the-art in text classification usually applies machine learning techniques such as SVM [24]. However, SVM is not suitable for large datasets or text corpora, because the training complexity of SVM is highly dependent on the input size [25]. Comparing the processing time, SVM takes longer time than NB and k-NN during classifier training but is faster than k-NN during classification.…”
Section: ) Naïve Bayesmentioning
confidence: 99%
“…It is a linear learner in its basic form, but can be configured to learn polynomial classifiers, radial basic function (RBF) networks and three-layer sigmoid neural nets by applying appropriate kernel function. In a classification procedure carried out on big text corpora, [25] concluded that RBF and Sigmoid kernels need higher time to build model and requires additional parameters as compared to linear SVM. It is difficult to determine its parameterization with imbalanced data.…”
Section: ) Naïve Bayesmentioning
confidence: 99%
“…In general, discrimination accuracy of a Gaussian kernel is high compared to another kernel function. However, if dimension of learning data is large, a linear kernel is comparatively better than the nonlinear Gaussian kernel, and can obtain the lowest cost [21]. Therefore, we selected the linear kernel to SVM.…”
Section: Learningmentioning
confidence: 99%