Discovering interesting association rules by clustering

Publication Type:
Conference Proceeding
Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), 2004, 3339 pp. 1055 - 1061
Issue Date:
Filename Description Size
Thumbnail2004001587.pdf112.19 kB
Adobe PDF
Full metadata record
There are a great many metrics available for measuring the interestingness of rules. In this paper, we design a distinct approach for identifying association rules that maximizes the interestingness in an applied context. More specifically, the interestingness of association rules is defined as the dissimilarity between corresponding clusters. In addition, the interestingness assists in filtering out those rules that may be uninteresting in applications. Experiments show the effectiveness of our algorithm. © Springer-Verlag Berlin Heidelberg 2004.
Please use this identifier to cite or link to this item: