There are 5 repositories under structure-learning topic.
Python package for Causal Discovery by learning the graphical structure of Bayesian networks. Structure Learning, Parameter Learning, Inferences, Sampling methods.
A Python 3 package for learning Bayesian Networks (DAGs) from data. Official implementation of the paper "DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity Characterization"
[Experimental] Global causal discovery algorithms
Official repository of the paper "Efficient Neural Causal Discovery without Acyclicity Constraints"
Scalable open-source software to run, develop, and benchmark causal discovery algorithms
Document Image Classification with Intra-Domain Transfer Learning and Stacked Generalization of Deep Convolutional Neural Networks
[AAAI 2020 Oral] Low-variance Black-box Gradient Estimates for the Plackett-Luce Distribution
Code associated with the paper "The World as a Graph: Improving El Niño Forecasting with Graph Neural Networks".
Sum-Product Network learning routines in python
Bayesian network structure learning
dagrad is a Python package that provides an extensible, modular platform for developing and experimenting with differentiable (gradient-based) structure learning methods.
Source code for the paper "Causal Modeling of Twitter Activity during COVID-19". Computation, 2020.
The source code repository for the FactorBase system
Python implementation of Bayesian Network Structure Learning using Quantum Annealing https://doi.org/10.1140/epjst/e2015-02349-9
Experiments on structure learning of Bayesian Networks with emphasis on finding causal relationship
Bayesian network analysis in R
Python implementation of "Characterizing Distribution Equivalence and Structure Learning for Cyclic and Acyclic Directed Graphs," in ICML 2020
Tractable learning of Bayesian networks from partially observed data
Code accompanying paper "Model-Augmented Conditional Mutual Information Estimation for Feature Selection" in UAI 2020
A curated list of causal structure learning research papers with implementations.
This is the official implementation of the bipartite matching experiment from the paper "Learning Randomly Perturbed Structured Predictors for Direct Loss Minimization".
Structure Learning of Gradual Bipolar Argumentation Graphs using Genetic Algorithms
[ICML 2025] R implementation of MIIC_search&score: a search-and-score algorithm for learning ancestral graphs with latent confounders, using multivariate information over ac-connected subset.
Computer Science undergraduate thesis: Uniform Generation of k-trees for Learning the Structure of Bayesian Networks (USP 2016).
Quasi-determinism screening for fast Bayesian Network Structure Learning (from T.Rahier's PhD thesis, 2018)
A silhouette-guided instance-weighted k-means algorithm that integrates silhouette scores into the clustering process to improve clustering quality.
Bayesian Network structure learning with encoding into a Quadratic Unconstrained Binary Optimisation (QUBO) problem.