BA-Trees
Tree transformer
Transforms random forests into minimal-size trees with the same prediction function across the entire feature space.
Born-Again Tree Ensembles: Transforms a random forest into a single, minimal-size, tree with exactly the same prediction function in the entire feature space (ICML 2020).
64 stars
4 watching
5 forks
Language: C++
last commit: over 1 year ago
Linked from 2 awesome lists
jphall663/awesome-machine-learning-interpretability
benedekrozemberczki/awesome-decision-tree-papersRelated projects:
| Repository | Description | Stars |
|---|---|---|
 mljs/random-forest | A JavaScript implementation of a random forest algorithm for classification and regression tasks. | 61 |
 eliavw/mercs-v5 | An implementation of a multi-directional ensemble learning method for classification and regression tasks using decision trees | 4 |
 serengil/chefboost | A Python library providing a lightweight framework for building decision trees with categorical feature support | 463 |
 masatoi/cl-random-forest | An implementation of Random Forest for multiclass classification and univariate regression in Common Lisp. | 60 |
 rgf-team/rgf | A collection of implementations and wrappers for a tree ensemble machine learning method | 379 |
 coder-spirit/beautiful-tree | A lightweight JavaScript library to generate SVG images of trees. | 17 |
 florentavellaneda/inferdt | This C++ project provides an implementation of decision tree algorithms for classification tasks | 7 |
 doubleplusplus/incremental_decision_tree-cart-random_forest | An implementation of incremental decision tree algorithms and ensemble methods for efficient machine learning on streaming data | 100 |
 weecology/deeptreeattention | An implementation of a deep learning model for tree species classification from hyperspectral images | 120 |
 karpathy/forestjs | An implementation of a Random Forest algorithm for binary classification in JavaScript. | 300 |
 raphaelcampos/stacking-bagged-boosted-forests | This project presents a novel approach to classification using Random Forests and stacking techniques | 6 |
 changebo/vine_mcts | This project provides a Python implementation of a method to learn the structure of copulas using Monte Carlo Tree Search. | 5 |
 ryanbressler/cloudforest | A high-performance ensemble learning framework for decision trees in Go. | 740 |
 begeekmyfriend/bplustree | A minimal B+Tree indexing structure implementation for efficient key-value storage | 1,866 |
 imbs-hl/ranger | A fast implementation of random forests suitable for high-dimensional data in C++ | 780 |