2008 IEEE International Conference on Networking, Sensing and Control 2008
DOI: 10.1109/icnsc.2008.4525474
|View full text |Cite
|
Sign up to set email alerts
|

Efficient, Accurate Internet Traffic Classification using Discretization in Naive Bayes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 1 publication
0
1
0
Order By: Relevance
“…Discretization has already been shown to work well for Naive Bayes and SVM in multiple areas of various pattern classification problems, since it does not make assumptions about the form of the probability distribution from which the quantitative feature values were drawn, particularly for Naive Bayes [24,11,51,33,5]. This paper empirically confirms that the entropy-based discretization (and even the simplest Equal-Interval-Width discretization, though the results are omitted due to lack of space) does the same for traffic classification as well, with ports and the sizes of the first few consecutive packets in a single-directional flow.…”
Section: Conclusion: Why Discretization?mentioning
confidence: 99%
“…Discretization has already been shown to work well for Naive Bayes and SVM in multiple areas of various pattern classification problems, since it does not make assumptions about the form of the probability distribution from which the quantitative feature values were drawn, particularly for Naive Bayes [24,11,51,33,5]. This paper empirically confirms that the entropy-based discretization (and even the simplest Equal-Interval-Width discretization, though the results are omitted due to lack of space) does the same for traffic classification as well, with ports and the sizes of the first few consecutive packets in a single-directional flow.…”
Section: Conclusion: Why Discretization?mentioning
confidence: 99%