Using Tsetlin Machine to discover interpretable rules in natural language processing applications

Tsetlin Machines (TM) use finite state machines for learning and propositional logic to represent patterns. The resulting pattern recognition approach captures information in the form of conjunctive clauses, thus facilitating human interpretation. In this work, we propose a TM‐based approach to thre...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Expert systems 2023-05, Vol.40 (4), p.n/a
Hauptverfasser:	Saha, Rupsa, Granmo, Ole‐Christoffer, Goodwin, Morten
Format:	Artikel
Sprache:	eng
Schlagworte:	artificial intelligence Data mining Finite state machines interpretable AI Machine learning multi‐turn dialogue analysis Natural language processing Pattern recognition rule mining semantic analysis Semantics Sentiment analysis
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!