Measuring the Novelty of Natural Language Text Using the Conjunctive Clauses of a Tsetlin Machine Text Classifier
Not on the map. Why?
Abstract (arXiv)
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 behaviour during operation, whenever novel, previously unseen, classes appear. Although deep learning-based methods have recently been used for novelty detection, they are challenging to interpret due to their black-box nature. This paper addresses interpretable open-world text classification, where the trained classifier must deal with novel classes during operation. To this end, we extend the recently introduced Tsetlin machine (TM) with a novelty scoring mechanism. The mechanism uses the conjunctive clauses of the TM to measure to what degree a text matches the classes covered by the training data. We demonstrate that the clauses provide a succinct interpretable description of known topics, and that our scoring mechanism makes it possible to discern novel topics from the known ones. Empirically, our TM-based approach outperforms seven other novelty detection schemes on three out of five datasets, and performs second and third best on the remaining, with the added benefit of an interpretable propositional logic-based representation.
Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Nov 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 8; 2022: 0; 2023: 3; 2024: 3; 2025: 0; 2026: 1.
15 papers.
Sort:
- 2021Explainable Tsetlin Machine framework for fake news detection with credibility score assessmentcited by 23
- 2021Coalesced Multi-Output Tsetlin Machines with Clause Sharingcited by 22
- 2021On the Convergence of Tsetlin Machines for the XOR Operatorcited by 16
- 2023Building Concise Logical Patterns by Constraining Tsetlin Machine Clause Sizecited by 14
- 2021Enhancing Interpretable Clauses Semantically using Pretrained Word Representationcited by 10
- 2021Word-level Human Interpretable Scoring Mechanism for Novel Text Detection Using Tsetlin Machinescited by 10
- 2021A Relational Tsetlin Machine with Applications to Natural Language Understandingcited by 8
- 2024An Optimized Toolbox for Advanced Image Processing with Tsetlin Machine Compositescited by 6
- 2021On the Convergence of Tsetlin Machines for the AND and the OR Operatorscited by 4
- 2021Self-timed Reinforcement Learning using Tsetlin Machinecited by 2
- 2023An FPGA Architecture for Online Learning using the Tsetlin Machinecited by 1
- 2023Contracting Tsetlin Machine with Absorbing Automatacited by 1
- 2026Autonomous Collaborative Learning Among an Ensemble of Tsetlin Machines with Consensus-Based Inference22 Jul 2026
- 2024Pruning Literals for Highly Efficient Explainability at Word Level7 Nov 2024
- 2024An Optimized Toolbox for Advanced Image Processing with Tsetlin Machine Composites2 Jun 2024
- 2024The Sparse Tsetlin Machine: Sparse Representation with Active Literals3 May 2024
- 2023Contracting Tsetlin Machine with Absorbing Automata17 Oct 2023
- 2023An FPGA Architecture for Online Learning using the Tsetlin Machine1 Jun 2023
- 2023Building Concise Logical Patterns by Constraining Tsetlin Machine Clause Size19 Jan 2023
- 2021On the Convergence of Tsetlin Machines for the AND and the OR Operators17 Sep 2021
- 2021Self-timed Reinforcement Learning using Tsetlin Machine2 Sep 2021
- 2021Coalesced Multi-Output Tsetlin Machines with Clause Sharing17 Aug 2021
- 2021Explainable Tsetlin Machine framework for fake news detection with credibility score assessment19 May 2021
- 2021Word-level Human Interpretable Scoring Mechanism for Novel Text Detection Using Tsetlin Machines10 May 2021
- 2021Explainable Tsetlin Machine framework for fake news detection with credibility score assessmentcited by 23
- 2021Coalesced Multi-Output Tsetlin Machines with Clause Sharingcited by 22
- 2021On the Convergence of Tsetlin Machines for the XOR Operatorcited by 16
- 2023Building Concise Logical Patterns by Constraining Tsetlin Machine Clause Sizecited by 14
- 2021Enhancing Interpretable Clauses Semantically using Pretrained Word Representationcited by 10
- 2021Word-level Human Interpretable Scoring Mechanism for Novel Text Detection Using Tsetlin Machinescited by 10
- 2021A Relational Tsetlin Machine with Applications to Natural Language Understandingcited by 8
- 2024An Optimized Toolbox for Advanced Image Processing with Tsetlin Machine Compositescited by 6
- 2021On the Convergence of Tsetlin Machines for the AND and the OR Operatorscited by 4
- 2021Self-timed Reinforcement Learning using Tsetlin Machinecited by 2
- 2023An FPGA Architecture for Online Learning using the Tsetlin Machinecited by 1
- 2023Contracting Tsetlin Machine with Absorbing Automatacited by 1
12 most cited of 15 All 15 (JSON)
- 2026Autonomous Collaborative Learning Among an Ensemble of Tsetlin Machines with Consensus-Based Inference22 Jul 2026
- 2024Pruning Literals for Highly Efficient Explainability at Word Level7 Nov 2024
- 2024An Optimized Toolbox for Advanced Image Processing with Tsetlin Machine Composites2 Jun 2024
- 2024The Sparse Tsetlin Machine: Sparse Representation with Active Literals3 May 2024
- 2023Contracting Tsetlin Machine with Absorbing Automata17 Oct 2023
- 2023An FPGA Architecture for Online Learning using the Tsetlin Machine1 Jun 2023
- 2023Building Concise Logical Patterns by Constraining Tsetlin Machine Clause Size19 Jan 2023
- 2021On the Convergence of Tsetlin Machines for the AND and the OR Operators17 Sep 2021
- 2021Self-timed Reinforcement Learning using Tsetlin Machine2 Sep 2021
- 2021Coalesced Multi-Output Tsetlin Machines with Clause Sharing17 Aug 2021
- 2021Explainable Tsetlin Machine framework for fake news detection with credibility score assessment19 May 2021
- 2021Word-level Human Interpretable Scoring Mechanism for Novel Text Detection Using Tsetlin Machines10 May 2021
12 newest of 15 All 15 (JSON)