Crisp complexity of fuzzy classifiers

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Fernandez-Peralta, Raquel, Fumanal-Idocin, Javier, Andreu-Perez, Javier
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866915602434621440
author Fernandez-Peralta, Raquel
Fumanal-Idocin, Javier
Andreu-Perez, Javier
author_facet Fernandez-Peralta, Raquel
Fumanal-Idocin, Javier
Andreu-Perez, Javier
contents Rule-based systems are a very popular form of explainable AI, particularly in the fuzzy community, where fuzzy rules are widely used for control and classification problems. However, fuzzy rule-based classifiers struggle to reach bigger traction outside of fuzzy venues, because users sometimes do not know about fuzzy and because fuzzy partitions are not so easy to interpret in some situations. In this work, we propose a methodology to reduce fuzzy rule-based classifiers to crisp rule-based classifiers. We study different possible crisp descriptions and implement an algorithm to obtain them. Also, we analyze the complexity of the resulting crisp classifiers. We believe that our results can help both fuzzy and non-fuzzy practitioners understand better the way in which fuzzy rule bases partition the feature space and how easily one system can be translated to another and vice versa. Our complexity metric can also help to choose between different fuzzy classifiers based on what the equivalent crisp partitions look like.
format Preprint
id arxiv_https___arxiv_org_abs_2504_15791
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Crisp complexity of fuzzy classifiers
Fernandez-Peralta, Raquel
Fumanal-Idocin, Javier
Andreu-Perez, Javier
Artificial Intelligence
Rule-based systems are a very popular form of explainable AI, particularly in the fuzzy community, where fuzzy rules are widely used for control and classification problems. However, fuzzy rule-based classifiers struggle to reach bigger traction outside of fuzzy venues, because users sometimes do not know about fuzzy and because fuzzy partitions are not so easy to interpret in some situations. In this work, we propose a methodology to reduce fuzzy rule-based classifiers to crisp rule-based classifiers. We study different possible crisp descriptions and implement an algorithm to obtain them. Also, we analyze the complexity of the resulting crisp classifiers. We believe that our results can help both fuzzy and non-fuzzy practitioners understand better the way in which fuzzy rule bases partition the feature space and how easily one system can be translated to another and vice versa. Our complexity metric can also help to choose between different fuzzy classifiers based on what the equivalent crisp partitions look like.
title Crisp complexity of fuzzy classifiers
topic Artificial Intelligence
url https://arxiv.org/abs/2504.15791