1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LG2023★ 1 cited
Learning Minimalistic Tsetlin Machine Clauses with Markov Boundary-Guided Pruning
Ole-Christoffer Granmo, Per-Arne Andersen, Lei Jiao +3
A set of variables is the Markov blanket of a random variable if it contains all the information needed for predicting the variable. If the blanket cannot be reduced without losing…
cs.AI2023
Generating Bayesian Network Models from Data Using Tsetlin Machines
Christian D. Blakely
Bayesian networks (BN) are directed acyclic graphical (DAG) models that have been adopted into many fields for their strengths in transparency, interpretability, probabilistic reas…