8 citations · 20 across the 16 of their papers we have counts for
3 papers · 1 filter
Pruning Literals for Highly Efficient Explainability at Word Level
Rohan Kumar Yadav, Bimal Bhattarai, Abhik Jana +2
Designing an explainable model becomes crucial now for Natural Language Processing(NLP) since most of the state-of-the-art machine learning models provide a limited explanation for…
Exploring State Space and Reasoning by Elimination in Tsetlin Machines
Ahmed K. Kadhim, Ole-Christoffer Granmo, Lei Jiao +1
The Tsetlin Machine (TM) has gained significant attention in Machine Learning (ML). By employing logical fundamentals, it facilitates pattern learning and representation, offering…
Exploring Effects of Hyperdimensional Vectors for Tsetlin Machines
Vojtech Halenka, Ahmed K. Kadhim, Paul F. A. Clarke +5
Tsetlin machines (TMs) have been successful in several application domains, operating with high efficiency on Boolean representations of the input data. However, Booleanizing compl…