awesome-repositories.com
Blog
MCP
awesome-repositories.com

Entdecke die besten Open-Source-Repositories mit KI-gestützter Suche.

EntdeckenKuratierte SuchenOpen-Source-AlternativenSelf-hosted SoftwareBlogSitemap
ProjektMCP-ServerÜber unsRanking-MethodikPresse
RechtlichesDatenschutzAGB
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

60 Repos

Awesome GitHub RepositoriesDecision Trees

Models that use tree-like structures to map observations to target values.

Distinguishing note: No existing candidates provided; decision trees are a fundamental supervised learning model.

Explore 60 awesome GitHub repositories matching artificial intelligence & ml · Decision Trees. Refine with filters or upvote what's useful.

Awesome Decision Trees GitHub Repositories

Finde die besten Repos mit KI.Wir suchen mit KI nach den am besten passenden Repositories.
  • exacity/deeplearningbook-chineseAvatar von exacity

    exacity/deeplearningbook-chinese

    37,285Auf GitHub ansehen↗

    This project is a comprehensive Chinese translation of a technical deep learning textbook, providing an educational resource on the theory and implementation of neural networks. It functions as a collaborative technical translation project designed to make complex academic AI literature accessible to non-English speakers. The project utilizes a community-driven translation model that integrates external suggestions and pull requests to refine linguistic accuracy and reduce bias. It employs standardized terminology mapping to ensure a uniform vocabulary throughout the translated content. To i

    Explains how decision trees partition input space into regions to map observations to outputs.

    TeX
    Auf GitHub ansehen↗37,285
  • eriklindernoren/ml-from-scratchAvatar von eriklindernoren

    eriklindernoren/ML-From-Scratch

    31,918Auf GitHub ansehen↗

    This project is an educational toolkit that provides implementations of fundamental machine learning algorithms built from scratch. By avoiding high-level library abstractions, it serves as a pedagogical reference for understanding the mathematical foundations and core mechanics of supervised learning, unsupervised learning, and reinforcement learning models. The repository distinguishes itself through a modular approach to model construction, allowing users to build custom neural networks by chaining independent functional blocks. It covers a wide range of techniques, including gradient-base

    Builds decision-based models by repeatedly splitting datasets into subsets based on feature thresholds.

    Pythondata-miningdata-sciencedeep-learning
    Auf GitHub ansehen↗31,918
  • ageron/handson-ml2Avatar von ageron

    ageron/handson-ml2

    29,938Auf GitHub ansehen↗

    This project provides a collection of practical machine learning code examples, including implementations for supervised, unsupervised, and reinforcement learning algorithms. It features deep learning model implementations for convolutional, recurrent, and generative architectures, alongside specific examples of reinforcement learning agents that maximize rewards in simulated environments. The repository includes dedicated data preprocessing pipelines for sanitization, feature scaling, and dimensionality reduction. It also provides implementations for a wide range of specific models, such as

    Implements classification and regression trees to partition data based on feature thresholds.

    Jupyter Notebook
    Auf GitHub ansehen↗29,938
  • dmlc/xgboostAvatar von dmlc

    dmlc/xgboost

    28,471Auf GitHub ansehen↗

    XGBoost is a distributed machine learning library for implementing scalable gradient boosting decision trees used for regression, classification, and ranking. It functions as a predictive model framework and a cross-language toolkit, providing a core implementation with native bindings for Python, R, Java, Scala, and C++. The system is designed as a GPU-accelerated library that utilizes CUDA and NCCL to speed up the training of decision tree ensembles. It operates as a distributed framework capable of scaling training and prediction across multi-node clusters and GPU environments to process m

    Uses histogram-based binning of continuous features to accelerate the search for optimal split points.

    C++distributed-systemsgbdtgbm
    Auf GitHub ansehen↗28,471
  • ageron/handson-mlAvatar von ageron

    ageron/handson-ml

    25,608Auf GitHub ansehen↗

    This is a machine learning educational repository consisting of a collection of notebooks and code examples. It provides practical implementations of diverse machine learning algorithms and workflows, ranging from traditional scientific computing to deep learning. The project features specific implementations of Scikit-Learn models, such as decision trees, random forests, and support vector machines, as well as TensorFlow examples for building neural networks, convolutional layers, and recurrent architectures. It also includes tutorials on reinforcement learning development and the creation o

    Implements supervised learning models using tree-like structures to predict target categories.

    Jupyter Notebook
    Auf GitHub ansehen↗25,608
  • slundberg/shapAvatar von slundberg

    slundberg/shap

    25,535Auf GitHub ansehen↗

    SHAP is a machine learning explainer that uses a game-theoretic framework to estimate the contribution of each feature to a model prediction. It provides a set of tools for quantifying how individual input features push a specific output away from a baseline value. The project includes specialized explainers for different architectures, including high-speed implementations for decision trees and ensemble models, linearization algorithms for deep learning networks, and covariance integration for linear models. It also features a model-agnostic interpretability tool that uses a kernel method to

    Computes exact feature contributions by traversing decision tree paths and weighting average changes in expected value.

    Jupyter Notebook
    Auf GitHub ansehen↗25,535
  • serengil/deepfaceAvatar von serengil

    serengil/deepface

    22,226Auf GitHub ansehen↗

    Deepface is a comprehensive deep learning library for facial recognition and demographic analysis. It provides a modular pipeline that handles the entire lifecycle of facial processing, including detection, geometric alignment, and the transformation of facial images into high-dimensional numerical vector embeddings for identity verification and similarity comparison. The library distinguishes itself through a model ensemble approach, which combines predictions from multiple pre-trained neural networks to improve classification accuracy and reduce bias. It also integrates advanced security fe

    Determines optimal distance cutoffs for classification tasks by training decision trees on verification results.

    Pythonage-predictionarcfacedeep-learning
    Auf GitHub ansehen↗22,226
  • lightgbm-org/lightgbmAvatar von lightgbm-org

    lightgbm-org/LightGBM

    18,460Auf GitHub ansehen↗

    LightGBM is a gradient boosting framework used to train decision tree ensembles for classification, regression, and ranking tasks. It functions as a distributed machine learning library and a decision tree ensemble implementation that utilizes leaf-wise growth and histogram-based feature binning. The framework is distinguished by its ability to offload heavy computations to CUDA or OpenCL devices for GPU acceleration and its capacity to parallelize training across multiple nodes using sockets, MPI, or Dask. It includes a specialized categorical feature processor that optimizes partitions for

    Implements a high-performance gradient boosting decision tree ensemble using leaf-wise growth and histogram binning.

    C++
    Auf GitHub ansehen↗18,460
  • microsoft/lightgbmAvatar von microsoft

    microsoft/LightGBM

    18,096Auf GitHub ansehen↗

    LightGBM is a high-performance machine learning framework designed for constructing gradient-boosted decision tree ensembles. It provides a platform for training classification, regression, and ranking models, with a focus on memory efficiency and large-scale distributed computing. The framework distinguishes itself through specialized algorithmic strategies, including leaf-wise tree growth and histogram-based decision learning, which prioritize convergence speed. It optimizes memory usage by bundling mutually exclusive features and employs gradient-based sampling to reduce training complexit

    Accelerates the search for optimal split points by discretizing continuous feature values into bins.

    C++data-miningdecision-treesdistributed
    Auf GitHub ansehen↗18,096
  • nlp-love/ml-nlpAvatar von NLP-LOVE

    NLP-LOVE/ML-NLP

    17,725Auf GitHub ansehen↗

    This project is a machine learning algorithm reference and implementation guide that provides theoretical foundations and code for supervised learning, deep learning, and natural language processing. It serves as a comprehensive toolkit for implementing predictive models and a technical reference for algorithm engineering. The project focuses on ensemble learning frameworks, including the construction of decision trees, random forests, and gradient boosting models. It also functions as a probabilistic graphical model library and an NLP algorithm reference, with specific implementations for se

    Implements decision tree construction using standard splitting algorithms like ID3, C4.5, and CART.

    Jupyter Notebookdeep-learningmachine-learningnlp
    Auf GitHub ansehen↗17,725
  • ddbourgin/numpy-mlAvatar von ddbourgin

    ddbourgin/numpy-ml

    16,275Auf GitHub ansehen↗

    This library is a collection of machine learning algorithms and neural network components implemented from scratch using only NumPy. It serves as an educational toolkit for constructing and experimenting with machine learning architectures, emphasizing a modular approach where algorithms are organized into self-contained, object-oriented classes. The project distinguishes itself by relying exclusively on array-oriented programming to perform mathematical operations, ensuring that all computations are vectorized for performance. By utilizing a standardized interface for forward and backward pa

    Supports classification and regression tasks through random forests and gradient-boosted models for predictive analysis on structured data.

    Pythonattentionbayesian-inferencegaussian-mixture-models
    Auf GitHub ansehen↗16,275
  • microsoft/ai-eduAvatar von microsoft

    microsoft/ai-edu

    14,065Auf GitHub ansehen↗

    ai-edu is a comprehensive AI education curriculum and machine learning courseware collection. It provides theoretical tutorials, deep learning lab exercises, and project blueprints designed to teach artificial intelligence fundamentals through a combination of study and practical implementation. The project focuses on a learning-by-doing approach, guiding users from Python programming and neural network basics to advanced topics. It includes specialized instructional content on distributed AI training, MLOps educational guides for model quantization and pruning, and detailed frameworks for im

    Includes tools for rendering the internal splitting logic and structure of decision tree models.

    HTML
    Auf GitHub ansehen↗14,065
  • rasbt/python-machine-learning-bookAvatar von rasbt

    rasbt/python-machine-learning-book

    12,614Auf GitHub ansehen↗

    This project is an educational resource providing practical code examples and implementations of machine learning algorithms using the Python language. It serves as a guide for constructing predictive pipelines, clustering models, and dimensionality reduction within the Scikit-Learn ecosystem. The repository includes comprehensive demonstrations for supervised and unsupervised learning, as well as detailed examples for implementing neural networks and deep architectures. It also provides practical guidance on exporting model parameters to JSON and wrapping trained models in web APIs for produ

    Provides implementations of decision trees that maximize information gain using Gini impurity or entropy.

    Jupyter Notebook
    Auf GitHub ansehen↗12,614
  • cpfl/autowareAvatar von CPFL

    CPFL/Autoware

    11,716Auf GitHub ansehen↗

    Autoware is a modular autonomous driving stack and open-source platform for advanced driver assistance systems. It functions as an integrated operating environment that manages the full pipeline from sensor data processing to vehicle actuation, utilizing the ROS 2 robotics framework for distributed communication and hardware abstraction. The system provides a comprehensive software architecture to enable autonomous driving across various vehicle platforms. It coordinates perception, planning, and control systems to operate vehicles without human intervention. The platform covers several core

    Implements a hierarchical behavior tree to determine driving maneuvers based on environmental conditions.

    Dockerfile
    Auf GitHub ansehen↗11,716
  • jack-cherish/machine-learningAvatar von Jack-Cherish

    Jack-Cherish/Machine-Learning

    10,333Auf GitHub ansehen↗

    This project is a collection of supervised and unsupervised machine learning algorithms implemented from scratch using Python. It serves as an educational resource for studying model training, parameter optimization, and the implementation of core predictive models. The library provides a variety of supervised learning tools, including linear and logistic regression, decision trees, and support vector machines. It also features unsupervised learning capabilities for discovering patterns in unlabeled datasets through clustering algorithms. Broad capability areas include ensemble learning thro

    Implements recursive-partitioning decision trees using information gain and squared error minimization.

    Pythonadaboostadaboost-algorithmdecision-tree
    Auf GitHub ansehen↗10,333
  • egametang/etAvatar von egametang

    egametang/ET

    9,813Auf GitHub ansehen↗

    ET is a C# game server framework and distributed actor model runtime designed for large-scale multiplayer environments. It provides a comprehensive toolkit for building distributed game backends, incorporating a multiplayer network transport layer and a specialized suite for game AI and pathfinding. The framework is distinguished by its use of a distributed actor model to scale processing across multiple threads and servers, utilizing isolated actors for state management and messaging. It features a unified codebase architecture that allows shared logic between the server and client, enabling

    Provides visual editors for behavior trees to define complex quest flows and skill triggers.

    C#actorc-sharpdotnet
    Auf GitHub ansehen↗9,813
  • joelgrus/data-science-from-scratchAvatar von joelgrus

    joelgrus/data-science-from-scratch

    9,636Auf GitHub ansehen↗

    This project is a collection of foundational machine learning algorithms and data science tools implemented in Python. It focuses on building the logic of these tools using basic programming primitives rather than relying on specialized libraries. The implementation covers several core domains, including a linear algebra library for matrix and vector operations, a statistical analysis toolkit for probability and hypothesis testing, and a framework for map-reduce distributed processing. It also includes implementations for natural language processing, graph theory for network analysis, and var

    Constructs tree-based models using splits and leaves to classify data attributes.

    Python
    Auf GitHub ansehen↗9,636
  • o3de/o3deAvatar von o3de

    o3de/o3de

    8,954Auf GitHub ansehen↗

    This project is an open-source 3D game engine designed for building high-fidelity games, simulations, and cinematic environments. It functions as a robotics simulation platform with native integration for ROS 2 to model robot controllers and sensors. The engine features a multi-threaded Forward+ physically based renderer that supports hardware-accelerated ray tracing and global illumination. The system is built on a modular extension architecture using Gems to add or replace features without modifying core binaries. It includes a native SDK for AWS cloud integration, enabling IAM authenticati

    Provides visually scripted behavior trees to control complex agent actions, logic, and pathfinding.

    C++3d-graphics3d-graphics-engineanimation
    Auf GitHub ansehen↗8,954
  • catboost/catboostAvatar von catboost

    catboost/catboost

    8,808Auf GitHub ansehen↗

    CatBoost is a gradient boosting machine learning library used to train decision tree ensembles for regression, classification, and ranking tasks. It functions as a high-performance framework that provides a categorical data processor for transforming non-numeric features, a distributed trainer for large-scale datasets, and GPU acceleration to speed up model construction. The library distinguishes itself through native handling of categorical data and text features, removing the need for manual encoding. It includes a specialized model interpretability tool that leverages SHAP values and featu

    Controls decision tree complexity through adjustments to depth, growing policies, and split counts.

    C++big-datacatboostcategorical-features
    Auf GitHub ansehen↗8,808
  • ljpzzz/machinelearningAvatar von ljpzzz

    ljpzzz/machinelearning

    8,706Auf GitHub ansehen↗

    This project is a machine learning implementation library featuring a collection of code examples that implement supervised, unsupervised, and reinforcement learning algorithms from scratch. It provides a comprehensive set of toolkits for core machine learning components, including a natural language processing toolkit, a reinforcement learning framework, and suites for data dimensionality reduction and pattern mining. The library includes specialized implementations for reinforcement learning, such as Q-Learning, Deep Q-Networks, and Actor-Critic agents. The natural language processing capab

    Implements decision tree classifiers that split features based on information gain.

    Jupyter Notebookalgorithmsmachinelearningreinforcementlearning
    Auf GitHub ansehen↗8,706
Vorherige123Nächste
  1. Home
  2. Artificial Intelligence & ML
  3. Decision Trees

Unter-Tags erkunden

  • Behavior Trees3 Sub-TagsHierarchical structures used to manage complex task logic and decision-making in autonomous agents. **Distinct from Decision Trees:** Distinct from Decision Trees: Behavior Trees manage task execution and state transitions, whereas Decision Trees are primarily used for classification or regression.
  • Classification TreesDecision trees specialized for predicting discrete categories through binary splits. **Distinct from Decision Trees:** Distinct from Decision Trees: specializes in categorical classification rather than general mapping to target values.
  • Decision Rule Classifiers1 Sub-TagClassifiers that determine labels by applying sets of conditional logic rules to input vectors. **Distinct from Decision Stumps:** Distinct from Decision Stumps (single-level trees) by covering general set-based rule application for classification.
  • Decision StumpsOne-level decision trees used as weak learners in ensemble methods. **Distinct from Decision Trees:** Distinct from Decision Trees: restricted to a single split (depth of 1).
  • Decision Tree InductionThe process of training decision trees using algorithms like C4.5 or ID3. **Distinct from Decision Trees:** Distinguishes the act of training/inducing the tree from the general concept of the decision tree model.
  • Ensemble MethodsPredictive models that combine multiple decision trees to improve accuracy and robustness. **Distinct from Decision Trees:** Distinct from Decision Trees: focuses on the aggregation of multiple trees (Random Forests, Gradient Boosting) rather than single tree structures.
  • Histogram-Based LearningTechniques for discretizing continuous features into bins to accelerate split point searching in decision trees. **Distinct from Decision Trees:** Distinct from general decision trees: focuses on the specific histogram-based optimization for split point selection.
  • Hoeffding Bound SplittersSplits decision tree nodes only when statistical evidence from the stream meets a confidence threshold using the Hoeffding bound. **Distinct from Decision Trees:** Distinct from Decision Trees: focuses on the Hoeffding bound splitting mechanism for incremental tree growth, not general decision tree models.
  • ID3 Algorithm ImplementationsDecision tree classifiers built using the ID3 algorithm that compute information gain at each split. **Distinct from Decision Trees:** Distinct from Decision Trees: specifically implements the ID3 algorithm with information gain, not general tree construction.
  • IncrementalDecision trees that grow incrementally from streaming data using Hoeffding bounds and stochastic gradient updates. **Distinct from Decision Trees:** Distinct from Decision Trees: focuses on incremental growth from streaming data rather than batch-trained static trees.
  • Incremental Decision Tree LearnersGrows decision trees one sample at a time using the Hoeffding bound or stochastic gradient optimization, handling concept drift and missing values. **Distinct from Decision Trees:** Distinct from Decision Trees: focuses on incremental growth per observation rather than batch training on static datasets.
  • Minimax2 Sub-TagsTree structures used to recursively simulate moves and determine mathematically optimal actions in games. **Distinct from Decision Trees:** Specializes Decision Trees for adversarial game-state evaluation rather than supervised classification.
  • Model Logic VisualizationGraphical representations of the decision rules and paths used by a model to reach a conclusion. **Distinct from Decision Trees:** Focuses on the visual output of the decision logic rather than the model architecture itself
  • Pruning TechniquesMethods for reducing model complexity by removing unnecessary branches from decision trees. **Distinct from Decision Trees:** Distinct from Decision Trees: focuses specifically on the post-training process of removing nodes to prevent overfitting.
  • Regression TreesDecision trees specifically designed to predict continuous numerical values rather than discrete classes. **Distinct from Decision Trees:** Distinct from Decision Trees: specializes in predicting continuous variables by minimizing squared error.
  • Rule Set GenerationThe process of extracting explicit, interpretable decision rules from tree-based models. **Distinct from Decision Trees:** Focuses on the transformation of a trained model into a set of rules, not the model construction itself.
  • Simple Decision Tree Learners1 Sub-TagFast decision tree models using gain ratio or mean squared error for splitting criteria. **Distinct from Decision Trees:** Distinct from Decision Trees: focuses on a simplified, fast variant using gain ratio or MSE, not general tree building.
  • Status CodeLogic trees used to map header values to HTTP status codes. **Distinct from Decision Trees:** Distinct from Decision Trees: focuses on a rule-based implementation for protocol resolution rather than ML-based target value mapping.
  • Tree PruningTechniques for removing low-information nodes from decision trees to prevent overfitting. **Distinct from Decision Trees:** Distinct from Decision Trees: focuses specifically on the post-training complexity reduction process.
  • Tree Structure ConfigurationsSettings for controlling the complexity of decision trees, including depth and split counts. **Distinct from Decision Trees:** Focuses on the hyperparameters that shape the tree structure, not the general model type.
  • Tree VisualizersTools for rendering the splitting logic and structure of decision tree models. **Distinct from Decision Trees:** Distinct from general decision trees: specifically focuses on the visualization of the trained tree structure.
  • Tree-Based ExplainersHigh-performance implementations of attribution algorithms optimized for decision trees and ensembles. **Distinct from Decision Trees:** Focuses on the explanation tool for trees rather than the tree model itself
  • Tree-Path Attribution1 Sub-TagAlgorithms that traverse decision tree paths to aggregate feature contributions based on expected value changes. **Distinct from Decision Trees:** Specifically for feature attribution via tree traversal, not general decision tree modeling
  • Verification Threshold Optimizers1 Sub-TagTools for determining optimal distance cutoffs using decision trees on verification results. **Distinct from Decision Trees:** Focuses on threshold optimization for verification, distinct from general decision tree classification.