21 citations · 38 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021★ 2 cited
Drop Clause: Enhancing Performance, Interpretability and Robustness of the Tsetlin Machine
Jivitesh Sharma, Rohan Yadav, Ole-Christoffer Granmo +1
In this article, we introduce a novel variant of the Tsetlin machine (TM) that randomly drops clauses, the key learning elements of a TM. In effect, TM with drop clause ignores a r…
cs.CL2021
Enhancing Interpretable Clauses Semantically using Pretrained Word Representation
Rohan Kumar Yadav, Lei Jiao, Ole-Christoffer Granmo +1
Tsetlin Machine (TM) is an interpretable pattern recognition algorithm based on propositional logic, which has demonstrated competitive performance in many Natural Language Process…