6533b85afe1ef96bd12b8a24

RESEARCH PRODUCT

Mining Interpretable Rules for Sentiment and Semantic Relation Analysis Using Tsetlin Machines

Morten GoodwinRupsa SahaOle-christoffer Granmo

subject

Computer sciencebusiness.industrySemantic analysis (machine learning)Sentiment analysiscomputer.software_genrePropositional calculusAutomatonComputingMethodologies_PATTERNRECOGNITIONDiscriminative modelCategorizationPattern recognition (psychology)Artificial intelligencebusinesscomputerNatural language processingInterpretability

description

Tsetlin Machines (TMs) are an interpretable pattern recognition approach that captures patterns with high discriminative power from data. Patterns are represented as conjunctive clauses in propositional logic, produced using bandit-learning in the form of Tsetlin Automata. In this work, we propose a TM-based approach to two common Natural Language Processing (NLP) tasks, viz. Sentiment Analysis and Semantic Relation Categorization. By performing frequent itemset mining on the patterns produced, we show that they follow existing expert-verified rule-sets or lexicons. Further, our comparison with other widely used machine learning techniques indicates that the TM approach helps maintain interpretability without compromising accuracy – a result we believe has far-reaching implications not only for interpretable NLP but also for interpretable AI in general.

yearjournalcountryeditionlanguage
2020-01-01
https://doi.org/10.1007/978-3-030-63799-6_5