Busca avançada
Ano de início
Entree
(Referência obtida automaticamente do Web of Science, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores.)

Preventing the generation of inconsistent sets of crisp classification rules

Texto completo
Autor(es):
Miranda, Thiago Zafalon [1] ; Sardinha, Diorge Brognara [1] ; Cerri, Ricardo [1]
Número total de Autores: 3
Afiliação do(s) autor(es):
[1] Univ Fed Sao Carlos, Dept Comp, Rodovia Washington Luiz, Km 235, BR-13565905 Sao Carlos, SP - Brazil
Número total de Afiliações: 1
Tipo de documento: Artigo Científico
Fonte: EXPERT SYSTEMS WITH APPLICATIONS; v. 165, MAR 1 2021.
Citações Web of Science: 0
Resumo

In recent years, the interest in interpretable classification models has grown. One of the proposed ways to improve the interpretability of a classification model based on collections of crisp rules is to use sets (unordered collections) instead of lists (ordered collections). One of the problems associated with sets is that multiple rules may cover a single instance but predict different classes for it, thus requiring a conflict resolution strategy. In this work, we propose two algorithms capable of finding feature-space regions inside which any created rule would be consistent with the already existing rules, preventing inconsistencies from arising. Our algorithms, named CFSGS and CFSBE, do not generate classification rules nor classification models but are instead meant to enhance algorithms that do so, such as Learning Classifier Systems. We analyzed both algorithms from a theoretical perspective and conducted experiments with a proof of concept evolutionary algorithm that employs CFSBE. The experiments suggest that using CFSBE as an embedded tool does incur a computational overhead, but such cost is not prohibitive. (AU)

Processo FAPESP: 16/50457-5 - Multi-objective evolutionary methods for hierarchical and multi-label classification
Beneficiário:Ricardo Cerri
Modalidade de apoio: Auxílio à Pesquisa - Regular