Skip to content
Open access

Explorations on Improving Interpretability of Decision Making Processes of Rule-Based Classifiers

Jul 2026 · Algorithms · Vol 19, pp. 593 · 0 citations · 50 references
Computer Science

TL;DR

This paper presents an illustrative example for the exploratory research methodology where the sets of rules are induced in the continuous input domain, but next, they are transformed by discretisation procedures, which results in a simplified representation of the data and knowledge patterns learnt.

Abstract

Rule-based classifiers are often preferred over other types of learners due to the transparent mode in which decisions are made. Each decision rule includes in its premise conditions on attributes. When they are satisfied, the conclusion part of the rule comes into play and leads to assigning an object to a specific class. Following the classification process is relatively straightforward but can become more complex when the cardinality of rule set is high. Furthermore, when rules are induced from continuous data, the conditions listed belong to this domain as well, which makes them less general. This paper presents an illustrative example for the exploratory research methodology where the sets of rules are induced in the continuous input domain, but next, they are transformed by discretisation procedures, which results in a simplified representation of the data and knowledge patterns learnt. In addition, the rule sets are also filtered based on rankings obtained for variants of the transformed data. The processing results in reduced decision algorithms with categorical conditions. This simplification is advantageous in and of itself, but the experiments carried out on datasets in the stylometric domain show that it can also lead to enhanced performance of rule-based classifiers.

Read PDF

Similar papers

Open access Sep 2026

ON THE IMPACT OF WEIGHTING INFORMATIVE FEATURES IN THE DECISION-MAKING PROCESS

The article serves as a methodological and educational note, viewing decision-making as a multi-stage process, encompassing phases of data preparation and normalization, weighing informa- tive features, executing machine learning algorithms, and analyzing results. The work aims to show that assigning weights to informa...

M. Tatur, J. Chen, A. Kruykov · 0 citations

INDUCING KNOWLEDGE

Unknown authors · 2 citations
Open access Sep 2026

Comparative analysis of decision tree-based machine learning algorithms: a trade-off between accuracy and interpretability

A comparative analysis of decision tree (DT)-based machine learning (ML) algorithms using 11 publicly available datasets from the knowledge extraction based on evolutionary learning (KEEL) repository shows a definite trade-off between accuracy and interpretability.

Alwatben Batoul Rashed, Aeshah A. Almutairi, Mansir Abubakar et al. · 0 citations
Sep 2026

A Knowledge-Data Design of Fuzzy Rule-Based Models.

Machine learning (ML) models, including rule-based architectures dominant in the technology of fuzzy sets, are constructed with the aid of intensive usage of data. Quite often, knowledge about the system/problem is available and offers some tangible benefits to the construction of the models. The relevance of knowledge...

Witold Pedrycz · 0 citations
Aug 2026

Weighted Optimal Classification Forests

WOCFs complement existing methods such as CART (Classification and Regression Trees), optimal classification trees, random forests and XGBoost and provide nontrivial improvement in interpretability and usability of the trained model in terms of counterfactual explanation.

Víctor Blanco, Alberto Japón, Justo Puerto et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.