Decision Trees for Mining Data Streams Based on the Gaussian Approximation

@article{Rutkowski2014DecisionTF,
  title={Decision Trees for Mining Data Streams Based on the Gaussian Approximation},
  author={Leszek Rutkowski and Maciej Jaworski and Lena Pietruczuk and Piotr Duda},
  journal={IEEE Transactions on Knowledge and Data Engineering},
  year={2014},
  volume={26},
  pages={108-119}
}
Since the Hoeffding tree algorithm was proposed in the literature, decision trees became one of the most popular tools for mining data streams. The key point of constructing the decision tree is to determine the best attribute to split the considered node. Several methods to solve this problem were presented so far. However, they are either wrongly mathematically justified (e.g., in the Hoeffding tree algorithm) or time-consuming (e.g., in the McDiarmid tree algorithm). In this paper, we… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 37 extracted citations

New Splitting Criteria for Decision Trees in Stationary Data Streams

IEEE Transactions on Neural Networks and Learning Systems • 2018
View 2 Excerpts

Locomotion activity recognition: A deep learning approach

2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC) • 2017
View 1 Excerpt

On ensemble components selection in data streams scenario with reoccurring concept-drift

2017 IEEE Symposium Series on Computational Intelligence (SSCI) • 2017
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Similar Papers

Loading similar papers…