Using Tsetlin Machine to discover interpretable rules in natural language processing applications
| Autor: | Rupsa Saha, Morten Goodwin, Ole-Christoffer Granmo |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
Artificial intelligence
Computer science business.industry Natural language processing Rule mining computer.software_genre Interpretable AI Theoretical Computer Science Semantic analyses Computational Theory and Mathematics Multi-turn dialogue analyses Artificial Intelligence Control and Systems Engineering business computer VDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550 |
| Zdroj: | Expert systems e12873 |
| Popis: | 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 three common natural language processing (NLP) tasks, namely, sentiment analysis, semantic relation categorization and identifying entities in multi-turn dialogues. By performing frequent itemset mining on the TM-produced patterns, we show that we can obtain a global and a local interpretation of the learning, one that mimics existing rule-sets or lexicons. Further, we also establish that our TM based approach does not compromise on accuracy in the quest for interpretability, via comparison with some widely used machine learning techniques. Finally, we introduce the idea of a relational TM, which uses a logic-based framework to further extend the interpretability. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|