Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2003
DOI: 10.1145/956750.956813
|View full text |Cite
|
Sign up to set email alerts
|

Accurate decision trees for mining high-speed data streams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
95
1
1

Year Published

2005
2005
2021
2021

Publication Types

Select...
4
4
1

Relationship

1
8

Authors

Journals

citations
Cited by 217 publications
(97 citation statements)
references
References 5 publications
0
95
1
1
Order By: Relevance
“…These results contradict those reported by Gama et al [3,4], whose conclusion was that Naive Bayes leaves are always better on the LED data. They used a hold out test set and quoted the final accuracy attained.…”
Section: Resultscontrasting
confidence: 92%
“…These results contradict those reported by Gama et al [3,4], whose conclusion was that Naive Bayes leaves are always better on the LED data. They used a hold out test set and quoted the final accuracy attained.…”
Section: Resultscontrasting
confidence: 92%
“…The decision tree classifier has been shown in a number of empirical studies to be one popular choice for a data stream environment Gama et al (2003), Kargupta & Park (2004) and Bifet et al (2009). This is due to two important reasons.…”
Section: Advantages Of the Fourier Classifier Over The Decision Tree mentioning
confidence: 99%
“…This approach can outperform both a standalone decision tree as well as a standalone classifier [141]. In further research on functional leaves the authors of [142] show that, for incremental learning models, naïve Bayes classifiers used as functional leaves improve the accuracy over the majority class approach. However, this cannot be a rule of thumb.…”
Section: Hoeffding Option Trees With Functional Leavesmentioning
confidence: 99%