Solving the problem of selecting suitable objective measures by clustering association rules through the measures themselves

Detalhes bibliográficos
Autor(a) principal: de Carvalho, Veronica Oliveira [UNESP]
Data de Publicação: 2016
Outros Autores: 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-662-49192-8_41
http://hdl.handle.net/11449/168343
Resumo: Many objective measures (OMs) were proposed since they are frequently used to discover interesting association rules. Therefore, an important challenge is to decide which OM to use. For that, one can: (a) reduce the number of OMs to be chosen; (b) aggregate OMs’ values in only one importance value as a mean of not selecting a suitable OM. The problem with (a) is that many OMs can remain. Regarding (b), the problem is that the obtained values cannot be well understandable. This work proposes a process to solve the problem related to the identification of a suitable OM to direct the users towards the interesting patterns. The goal is to find the same interesting patterns, as if the most suitable OM had been used, also trying to reduce the exploration space to minimize the user’s effort.
id UNSP_4064c19f9c5c221699e3243cda80f984
oai_identifier_str oai:repositorio.unesp.br:11449/168343
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Solving the problem of selecting suitable objective measures by clustering association rules through the measures themselvesAssociation rulesClusteringObjective evaluation measuresPost-processingMany objective measures (OMs) were proposed since they are frequently used to discover interesting association rules. Therefore, an important challenge is to decide which OM to use. For that, one can: (a) reduce the number of OMs to be chosen; (b) aggregate OMs’ values in only one importance value as a mean of not selecting a suitable OM. The problem with (a) is that many OMs can remain. Regarding (b), the problem is that the obtained values cannot be well understandable. This work proposes a process to solve the problem related to the identification of a suitable OM to direct the users towards the interesting patterns. The goal is to find the same interesting patterns, as if the most suitable OM had been used, also trying to reduce the exploration space to minimize the user’s effort.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 PaulistaUniversidade Estadual Paulista (Unesp)Universidade de São Paulo (USP)de Carvalho, Veronica Oliveira [UNESP]de Padua, RenanRezende, Solange Oliveira2018-12-11T16:40:52Z2018-12-11T16:40:52Z2016-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject505-517http://dx.doi.org/10.1007/978-3-662-49192-8_41Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 9587, p. 505-517.1611-33490302-9743http://hdl.handle.net/11449/16834310.1007/978-3-662-49192-8_412-s2.0-84956638556Scopusreponame: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)0,295info:eu-repo/semantics/openAccess2021-10-23T21:44:31Zoai:repositorio.unesp.br:11449/168343Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T21:31:29.942800Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Solving the problem of selecting suitable objective measures by clustering association rules through the measures themselves
title Solving the problem of selecting suitable objective measures by clustering association rules through the measures themselves
spellingShingle Solving the problem of selecting suitable objective measures by clustering association rules through the measures themselves
de Carvalho, Veronica Oliveira [UNESP]
Association rules
Clustering
Objective evaluation measures
Post-processing
title_short Solving the problem of selecting suitable objective measures by clustering association rules through the measures themselves
title_full Solving the problem of selecting suitable objective measures by clustering association rules through the measures themselves
title_fullStr Solving the problem of selecting suitable objective measures by clustering association rules through the measures themselves
title_full_unstemmed Solving the problem of selecting suitable objective measures by clustering association rules through the measures themselves
title_sort Solving the problem of selecting suitable objective measures by clustering association rules through the measures themselves
author de Carvalho, Veronica Oliveira [UNESP]
author_facet de Carvalho, Veronica Oliveira [UNESP]
de Padua, Renan
Rezende, Solange Oliveira
author_role author
author2 de Padua, Renan
Rezende, Solange Oliveira
author2_role 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 Padua, Renan
Rezende, Solange Oliveira
dc.subject.por.fl_str_mv Association rules
Clustering
Objective evaluation measures
Post-processing
topic Association rules
Clustering
Objective evaluation measures
Post-processing
description Many objective measures (OMs) were proposed since they are frequently used to discover interesting association rules. Therefore, an important challenge is to decide which OM to use. For that, one can: (a) reduce the number of OMs to be chosen; (b) aggregate OMs’ values in only one importance value as a mean of not selecting a suitable OM. The problem with (a) is that many OMs can remain. Regarding (b), the problem is that the obtained values cannot be well understandable. This work proposes a process to solve the problem related to the identification of a suitable OM to direct the users towards the interesting patterns. The goal is to find the same interesting patterns, as if the most suitable OM had been used, also trying to reduce the exploration space to minimize the user’s effort.
publishDate 2016
dc.date.none.fl_str_mv 2016-01-01
2018-12-11T16:40:52Z
2018-12-11T16:40:52Z
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-662-49192-8_41
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 9587, p. 505-517.
1611-3349
0302-9743
http://hdl.handle.net/11449/168343
10.1007/978-3-662-49192-8_41
2-s2.0-84956638556
url http://dx.doi.org/10.1007/978-3-662-49192-8_41
http://hdl.handle.net/11449/168343
identifier_str_mv Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 9587, p. 505-517.
1611-3349
0302-9743
10.1007/978-3-662-49192-8_41
2-s2.0-84956638556
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)
0,295
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 505-517
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
_version_ 1808129330247630848