98 citations · 339 across the 69 of their papers we have counts for
8 papers · 1 filter
Measuring the Novelty of Natural Language Text Using the Conjunctive Clauses of a Tsetlin Machine Text Classifier
Bimal Bhattarai, Ole-Christoffer Granmo, Lei Jiao
Most supervised text classification approaches assume a closed world, counting on all classes being present in the data at training time. This assumption can lead to unpredictable…
Massively Parallel and Asynchronous Tsetlin Machine Architecture Supporting Almost Constant-Time Scaling
K. Darshana Abeyrathna, Bimal Bhattarai, Morten Goodwin +5
Using logical clauses to represent patterns, Tsetlin Machines (TMs) have recently obtained competitive performance in terms of accuracy, memory footprint, energy, and learning spee…
Closed-Form Expressions for Global and Local Interpretation of Tsetlin Machines with Applications to Explaining High-Dimensional Data
Christian D. Blakely, Ole-Christoffer Granmo
Tsetlin Machines (TMs) capture patterns using conjunctive clauses in propositional logic, thus facilitating interpretation. However, recent TM-based approaches mainly rely on inspe…
A Novel Multi-Step Finite-State Automaton for Arbitrarily Deterministic Tsetlin Machine Learning
K. Darshana Abeyrathna, Ole-Christoffer Granmo, Rishad Shafik +4
Due to the high energy consumption and scalability challenges of deep learning, there is a critical need to shift research focus towards dealing with energy consumption constraints…
On the Convergence of Tsetlin Machines for the IDENTITY- and NOT Operators
Xuan Zhang, Lei Jiao, Ole-Christoffer Granmo +1
The Tsetlin Machine (TM) is a recent machine learning algorithm with several distinct properties, such as interpretability, simplicity, and hardware-friendliness. Although numerous…
Extending the Tsetlin Machine With Integer-Weighted Clauses for Increased Interpretability
K. Darshana Abeyrathna, Ole-Christoffer Granmo, Morten Goodwin
Despite significant effort, building models that are both interpretable and accurate is an unresolved challenge for many pattern recognition problems. In general, rule-based and li…
Increasing the Inference and Learning Speed of Tsetlin Machines with Clause Indexing
Saeed Rahimi Gorji, Ole-Christoffer Granmo, Sondre Glimsdal +2
The Tsetlin Machine (TM) is a machine learning algorithm founded on the classical Tsetlin Automaton (TA) and game theory. It further leverages frequent pattern mining and resource…
A Regression Tsetlin Machine with Integer Weighted Clauses for Compact Pattern Representation
K. Darshana Abeyrathna, Ole-Christoffer Granmo, Morten Goodwin
The Regression Tsetlin Machine (RTM) addresses the lack of interpretability impeding state-of-the-art nonlinear regression models. It does this by using conjunctive clauses in prop…