3 citations · 4 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.AI2022★ 3 cited
Logic-based AI for Interpretable Board Game Winner Prediction with Tsetlin Machine
Charul Giri, Ole-Christoffer Granmo, Herke van Hoof +1
Hex is a turn-based two-player connection game with a high branching factor, making the game arbitrarily complex with increasing board sizes. As such, top-performing algorithms for…