Discovering Interesting Association Rules by Clustering
Lists
Only you see this
Abstract
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.
BibTeX
@inproceedings{zhao2004discovering,
author = {Yanchang Zhao and Chengqi Zhang and Shichao Zhang},
title = {{Discovering Interesting Association Rules by Clustering}},
booktitle = {Australian Conference on Artificial Intelligence},
year = {2004},
doi = {10.1007/978-3-540-30549-1\_101},
}Loading related content...