Determining the maximum length of logical rules in a classifier and visual comparison of results
Autor(a) principal: | |
---|---|
Data de Publicação: | 2020 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10316/106446 https://doi.org/10.1016/j.mex.2020.100846 |
Resumo: | Supervised learning problems can be faced by using a wide variety of approaches supported in machine learning. In recent years there has been an increasing interest in using the evolutionary computation paradigm as the classifier search method, helping the technique of applied machine learning. In this context, the knowledge representation in form of logical rules has been one of the most accepted machine learning approaches, because of its level of expressiveness. This paper proposes an evolutionary framework for rule-based classifier induction and is based on the idea of sequential covering. We introduce genetic programming as the search method for classification-rules. From this approach, we have given results on subjects as maximum rule length, number of rules needed in a classifier and the rule intersection problem. The experiments developed on benchmark clinical data resulted in a methodology to follow in the learning method evaluation. Moreover, the results achieved compared to other methods have shown that our proposal can be very useful in data analysis and classification coming from the medical domain.•The method is based on genetic programming techniques to find rules holding each class in a dataset.•The method is approached to solve the problem of rule intersection from different classes.•The method states the maximum length of a rule to generalize. |
id |
RCAP_7db3758bf0fd4ae0a46d85463758c120 |
---|---|
oai_identifier_str |
oai:estudogeral.uc.pt:10316/106446 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Determining the maximum length of logical rules in a classifier and visual comparison of resultsMachine learningLogical rule inductionData miningSupervised learningEvolutionary computationSupervised learning problems can be faced by using a wide variety of approaches supported in machine learning. In recent years there has been an increasing interest in using the evolutionary computation paradigm as the classifier search method, helping the technique of applied machine learning. In this context, the knowledge representation in form of logical rules has been one of the most accepted machine learning approaches, because of its level of expressiveness. This paper proposes an evolutionary framework for rule-based classifier induction and is based on the idea of sequential covering. We introduce genetic programming as the search method for classification-rules. From this approach, we have given results on subjects as maximum rule length, number of rules needed in a classifier and the rule intersection problem. The experiments developed on benchmark clinical data resulted in a methodology to follow in the learning method evaluation. Moreover, the results achieved compared to other methods have shown that our proposal can be very useful in data analysis and classification coming from the medical domain.•The method is based on genetic programming techniques to find rules holding each class in a dataset.•The method is approached to solve the problem of rule intersection from different classes.•The method states the maximum length of a rule to generalize.This work has been carried out under the iCIS project ( CENTRO-07-ST24-FEDER-0 020 03 ), which has been co-financed by QREN, in the scope of the Mais Centro Program and European Union’s FEDER. This work has also been partially supported by the Interreg V-A Spain-Portugal Program (PocTep) and the European Regional Development Fund (ERDF) under the IOTEC project (Grant 0123 IOTEC 3 E). This work has also been supported by the Virtual-Ledgers: Virtual-Ledgers-Tecnologías DLT/Blockchain y Cripto-IOT Project, Junta de Castilla (SA267P18) y León and Project La desigualdad económica en la España contemporánea y sus efectos en los mercados, las empresas y el acceso a los recursos naturales y la tierra, Ministerio de Economía y Competitividad (MEIC HAR2016-75010-R). ReferencesElsevier2020info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/106446http://hdl.handle.net/10316/106446https://doi.org/10.1016/j.mex.2020.100846eng2215-0161Castellanos-Garzón, José A.Costa, ErnestoJaimes, José Luis S.Corchado, Juan M.info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-04-06T10:20:06Zoai:estudogeral.uc.pt:10316/106446Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:22:53.950907Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Determining the maximum length of logical rules in a classifier and visual comparison of results |
title |
Determining the maximum length of logical rules in a classifier and visual comparison of results |
spellingShingle |
Determining the maximum length of logical rules in a classifier and visual comparison of results Castellanos-Garzón, José A. Machine learning Logical rule induction Data mining Supervised learning Evolutionary computation |
title_short |
Determining the maximum length of logical rules in a classifier and visual comparison of results |
title_full |
Determining the maximum length of logical rules in a classifier and visual comparison of results |
title_fullStr |
Determining the maximum length of logical rules in a classifier and visual comparison of results |
title_full_unstemmed |
Determining the maximum length of logical rules in a classifier and visual comparison of results |
title_sort |
Determining the maximum length of logical rules in a classifier and visual comparison of results |
author |
Castellanos-Garzón, José A. |
author_facet |
Castellanos-Garzón, José A. Costa, Ernesto Jaimes, José Luis S. Corchado, Juan M. |
author_role |
author |
author2 |
Costa, Ernesto Jaimes, José Luis S. Corchado, Juan M. |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Castellanos-Garzón, José A. Costa, Ernesto Jaimes, José Luis S. Corchado, Juan M. |
dc.subject.por.fl_str_mv |
Machine learning Logical rule induction Data mining Supervised learning Evolutionary computation |
topic |
Machine learning Logical rule induction Data mining Supervised learning Evolutionary computation |
description |
Supervised learning problems can be faced by using a wide variety of approaches supported in machine learning. In recent years there has been an increasing interest in using the evolutionary computation paradigm as the classifier search method, helping the technique of applied machine learning. In this context, the knowledge representation in form of logical rules has been one of the most accepted machine learning approaches, because of its level of expressiveness. This paper proposes an evolutionary framework for rule-based classifier induction and is based on the idea of sequential covering. We introduce genetic programming as the search method for classification-rules. From this approach, we have given results on subjects as maximum rule length, number of rules needed in a classifier and the rule intersection problem. The experiments developed on benchmark clinical data resulted in a methodology to follow in the learning method evaluation. Moreover, the results achieved compared to other methods have shown that our proposal can be very useful in data analysis and classification coming from the medical domain.•The method is based on genetic programming techniques to find rules holding each class in a dataset.•The method is approached to solve the problem of rule intersection from different classes.•The method states the maximum length of a rule to generalize. |
publishDate |
2020 |
dc.date.none.fl_str_mv |
2020 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10316/106446 http://hdl.handle.net/10316/106446 https://doi.org/10.1016/j.mex.2020.100846 |
url |
http://hdl.handle.net/10316/106446 https://doi.org/10.1016/j.mex.2020.100846 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
2215-0161 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799134117244174336 |