incremental_decision_tree-CART-Random_Forest

Decision Tree Library

An implementation of incremental decision tree algorithms and ensemble methods for efficient machine learning on streaming data

incremental CART decision tree, based on the hoeffding tree i.e. very fast decision tree (VFDT), which is proposed in this paper "Mining High-Speed Data Streams" by Domingos & Hulten (2000). And a newly extended model "Extremely Fast Decision Tree" (EFDT) by Manapragada, Webb & Salehi (2018). Added new implementation of Random Forest

GitHub

100 stars
7 watching
28 forks
Language: Python
last commit: almost 6 years ago
Linked from 1 awesome list


Backlinks from these awesome lists:

Related projects:

RepositoryDescriptionStars
florentavellaneda/inferdtThis C++ project provides an implementation of decision tree algorithms for classification tasks7
greenfish77/gaenariA C++ library implementing incremental decision tree learning with support for concept drift and online learning to improve model accuracy over time.26
serengil/chefboostA Python library providing a lightweight framework for building decision trees with categorical feature support463
bensadeghi/decisiontree.jlA Julia package implementing popular machine learning algorithms8
johnstonskj/rml-decisiontreesAn implementation of decision trees for classification in Racket machine learning.4
xiyanghu/osdtA Python implementation of an algorithm for constructing decision trees with regularization and various bounding functions to accelerate the search process.101
igrigorik/decisiontreeAn implementation of the ID3 algorithm for building decision trees1,438
aia-uclouvain/pydl8.5An algorithm for inferring optimal binary decision trees in C++ and wrapped by a Python interface62
tensorflow/decision-forestsProvides tools and APIs for training, serving, and interpreting decision forest models in TensorFlow.666
kaurao/hddtAn R implementation of Hellinger distance decision tree algorithm.10
rgf-team/rgfA collection of implementations and wrappers for a tree ensemble machine learning method379
sjia1/odt-with-noisy-outcomesAn implementation of an optimal decision tree algorithm with noisy outcomes, specifically tailored to simulate real-world decision-making under uncertainty0
mljs/random-forestA JavaScript implementation of a random forest algorithm for classification and regression tasks.61
masatoi/cl-random-forestAn implementation of Random Forest for multiclass classification and univariate regression in Common Lisp.60
imbs-hl/rangerA fast implementation of random forests suitable for high-dimensional data in C++780