2015
DOI: 10.1016/j.knosys.2015.07.008
|View full text |Cite
|
Sign up to set email alerts
|

A novel semantic smoothing kernel for text classification with class-based weighting

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0
2

Year Published

2017
2017
2021
2021

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(29 citation statements)
references
References 53 publications
0
27
0
2
Order By: Relevance
“…Even though vector space document representation model has proved to be very simple and commonly used in the domain of text classification, it however has some limitations [6,7,150]. The main limitation of this model is the ignorance of dependencies of terms, i.e.…”
Section: Background and Motivationmentioning
confidence: 99%
“…Even though vector space document representation model has proved to be very simple and commonly used in the domain of text classification, it however has some limitations [6,7,150]. The main limitation of this model is the ignorance of dependencies of terms, i.e.…”
Section: Background and Motivationmentioning
confidence: 99%
“…The work in [19] proposed a text feature selection method based on "TongYiCi Cilin" to reduce data's feature dimensions while ensuring data integrity and classification accuracy. A semantic kernel is used with SVM for text classification to improve the accuracy in [20,21]. What is more, there are some other work in [22][23][24] that presents some excellent ideas, which is worth learning and reference when we are dealing with large-scale text classification.…”
Section: Synonym Mergingmentioning
confidence: 99%
“…Different choices of matrix S lead to different variants of semantic kernels, such as latent semantic kernel [9], domain kernel [11] and class weighting kernel [14].…”
Section: Exponential Kernelmentioning
confidence: 99%
“…POLITICS) and a set of hand tagged examples is provided for training. Pioneered by [3], kernel methods [4] such as support vector machine (SVM) [5] have been heavily used for text categorization tasks, typically showing good results [6][7][8][9][10][11][12][13][14][15][16][17]. Basically, kernel methods work by mapping the data from the input space into a high-dimensional (possibly infinite) feature space, which is usually chosen to be a reproducing kernel Hilbert space (RKHS), and then building linear algorithms in the feature space to implement nonlinear counterparts in the input space.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation