Ranking association rules by clustering through interestingness
Nenhuma Miniatura disponível
Data
2018-01-01
Autores
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
Título da Revista
ISSN da Revista
Título de Volume
Editor
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.
Descrição
Palavras-chave
Association rules, Clustering, Objective measures, Post-processing
Como citar
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10632 LNAI, p. 336-351.