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

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

de Carvalho, V. O., de Padua, R., & Rezende, S. O. (2016). Solving the problem of selecting suitable objective measures by clustering association rules through the measures themselves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9587, pp. 505–517). Springer Verlag. https://doi.org/10.1007/978-3-662-49192-8_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free