Ranking association rules by clustering through interestingness

Detalhes bibliográficos
Autor(a) principal: de Carvalho, Veronica Oliveira [UNESP]
Data de Publicação: 2018
Outros Autores: de Paula, Davi Duarte [UNESP], Pacheco, Mateus Violante [UNESP], dos Santos, Waldeilson Eder [UNESP], de Padua, Renan, Rezende, Solange Oliveira
Tipo de documento: Artigo de conferência
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.1007/978-3-030-02837-4_28
http://hdl.handle.net/11449/187266
Resumo: The association rules (ARs) post-processing step is challenging, since many patterns are extracted and only a few of them are useful to the user. One of the most traditional approaches to find rules that are of interestingness is the use of objective measures (OMs). Due to their frequent use, many of them exist (over 50). Therefore, when a user decides to apply such strategy he has to decide which one to use. To solve this problem this work proposes a process to cluster ARs based on their interestingness, according to a set of OMs, to obtain an ordered list containing the most relevant patterns. That way, the user does not need to know which OM to use/select nor to handle the output of different OMs lists. Experiments show that the proposed process behaves equal or better than as if the best OM had been used.
id UNSP_d87fcd563b2a21eccbb4da5236d9d4cb
oai_identifier_str oai:repositorio.unesp.br:11449/187266
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Ranking association rules by clustering through interestingnessAssociation rulesClusteringObjective measuresPost-processingThe association rules (ARs) post-processing step is challenging, since many patterns are extracted and only a few of them are useful to the user. One of the most traditional approaches to find rules that are of interestingness is the use of objective measures (OMs). Due to their frequent use, many of them exist (over 50). Therefore, when a user decides to apply such strategy he has to decide which one to use. To solve this problem this work proposes a process to cluster ARs based on their interestingness, according to a set of OMs, to obtain an ordered list containing the most relevant patterns. That way, the user does not need to know which OM to use/select nor to handle the output of different OMs lists. Experiments show that the proposed process behaves equal or better than as if the best OM had been used.Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Instituto de Geociências e Ciências Exatas UNESP - Univ Estadual PaulistaInstituto de Ciências Matemáticas e de Computação USP - Universidade de São PauloInstituto de Geociências e Ciências Exatas UNESP - Univ Estadual PaulistaFAPESP: 2015/08059-0Universidade Estadual Paulista (Unesp)Universidade de São Paulo (USP)de Carvalho, Veronica Oliveira [UNESP]de Paula, Davi Duarte [UNESP]Pacheco, Mateus Violante [UNESP]dos Santos, Waldeilson Eder [UNESP]de Padua, RenanRezende, Solange Oliveira2019-10-06T15:30:55Z2019-10-06T15:30:55Z2018-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject336-351http://dx.doi.org/10.1007/978-3-030-02837-4_28Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10632 LNAI, p. 336-351.1611-33490302-9743http://hdl.handle.net/11449/18726610.1007/978-3-030-02837-4_282-s2.0-85059948027Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)info:eu-repo/semantics/openAccess2025-04-03T20:03:52Zoai:repositorio.unesp.br:11449/187266Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestrepositoriounesp@unesp.bropendoar:29462025-04-03T20:03:52Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Ranking association rules by clustering through interestingness
title Ranking association rules by clustering through interestingness
spellingShingle Ranking association rules by clustering through interestingness
de Carvalho, Veronica Oliveira [UNESP]
Association rules
Clustering
Objective measures
Post-processing
title_short Ranking association rules by clustering through interestingness
title_full Ranking association rules by clustering through interestingness
title_fullStr Ranking association rules by clustering through interestingness
title_full_unstemmed Ranking association rules by clustering through interestingness
title_sort Ranking association rules by clustering through interestingness
author de Carvalho, Veronica Oliveira [UNESP]
author_facet de Carvalho, Veronica Oliveira [UNESP]
de Paula, Davi Duarte [UNESP]
Pacheco, Mateus Violante [UNESP]
dos Santos, Waldeilson Eder [UNESP]
de Padua, Renan
Rezende, Solange Oliveira
author_role author
author2 de Paula, Davi Duarte [UNESP]
Pacheco, Mateus Violante [UNESP]
dos Santos, Waldeilson Eder [UNESP]
de Padua, Renan
Rezende, Solange Oliveira
author2_role author
author
author
author
author
dc.contributor.none.fl_str_mv Universidade Estadual Paulista (Unesp)
Universidade de São Paulo (USP)
dc.contributor.author.fl_str_mv de Carvalho, Veronica Oliveira [UNESP]
de Paula, Davi Duarte [UNESP]
Pacheco, Mateus Violante [UNESP]
dos Santos, Waldeilson Eder [UNESP]
de Padua, Renan
Rezende, Solange Oliveira
dc.subject.por.fl_str_mv Association rules
Clustering
Objective measures
Post-processing
topic Association rules
Clustering
Objective measures
Post-processing
description The association rules (ARs) post-processing step is challenging, since many patterns are extracted and only a few of them are useful to the user. One of the most traditional approaches to find rules that are of interestingness is the use of objective measures (OMs). Due to their frequent use, many of them exist (over 50). Therefore, when a user decides to apply such strategy he has to decide which one to use. To solve this problem this work proposes a process to cluster ARs based on their interestingness, according to a set of OMs, to obtain an ordered list containing the most relevant patterns. That way, the user does not need to know which OM to use/select nor to handle the output of different OMs lists. Experiments show that the proposed process behaves equal or better than as if the best OM had been used.
publishDate 2018
dc.date.none.fl_str_mv 2018-01-01
2019-10-06T15:30:55Z
2019-10-06T15:30:55Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/conferenceObject
format conferenceObject
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.1007/978-3-030-02837-4_28
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10632 LNAI, p. 336-351.
1611-3349
0302-9743
http://hdl.handle.net/11449/187266
10.1007/978-3-030-02837-4_28
2-s2.0-85059948027
url http://dx.doi.org/10.1007/978-3-030-02837-4_28
http://hdl.handle.net/11449/187266
identifier_str_mv Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10632 LNAI, p. 336-351.
1611-3349
0302-9743
10.1007/978-3-030-02837-4_28
2-s2.0-85059948027
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 336-351
dc.source.none.fl_str_mv Scopus
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv repositoriounesp@unesp.br
_version_ 1851767944699183104