36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of The 2003
DOI: 10.1109/hicss.2003.1174243
|View full text |Cite
|
Sign up to set email alerts
|

Support vector machines for text categorization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
43
0
1

Year Published

2005
2005
2015
2015

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 100 publications
(44 citation statements)
references
References 4 publications
0
43
0
1
Order By: Relevance
“…[4] Figure 1: Example of SVM hyper-plane pattern [4] Naive Bayes Classification: A Naive Bayes classifier is a well-known and practical probabilistic classifier and has been employed in many applications. It assumes that all attributes (i.e., features) of the examples are independent of each other given the context of the class, i.e., an independence assumption.…”
Section: Support Vector Machinesmentioning
confidence: 99%
“…[4] Figure 1: Example of SVM hyper-plane pattern [4] Naive Bayes Classification: A Naive Bayes classifier is a well-known and practical probabilistic classifier and has been employed in many applications. It assumes that all attributes (i.e., features) of the examples are independent of each other given the context of the class, i.e., an independence assumption.…”
Section: Support Vector Machinesmentioning
confidence: 99%
“…We chose to use Support Vector Machines (SVM) for our classifier (Basu et al, 2003;Burges, 1998;Cortes and Vapnik, 1995;Joachims, 1998;Vapnik, 1995). SVMs are commonly used to solve classification problems by finding hyperplanes that best classify data while providing the widest margin possible between classes.…”
Section: Classifiermentioning
confidence: 99%
“…Categorization of news text using SVM and ANN was carried out in [2]. In the overall comparison of SVM and ANN algorithms for the data set that was used, the results for both recall and precision over all conditions indicate significantly differences in the performance of the SVM algorithm over the ANN algorithm and since SVM is a less (computationally) complex algorithm than the ANN, they concluded that SVM is preferable at least for the type of data examined, i.e., many short text documents in a relatively few well populated categories.…”
Section: Related Workmentioning
confidence: 99%