20th International Conference on Data Engineering (ICDE'04) Boston, Massachusetts March 30-April 02 ISBN: 0-7695-2065-0
In this paper we propose an adaptive local pruning method for association rules. Our method exploits the exact mapping between a certain class of association rules, namely those whose consequents are singletons and backward directed hypergraphs (B-Graphs). The hypergraph which represents the association rules is called an Association Rules Network(ARN). Here we present a simple example of an ARN. In the full paper we prove several properties of the ARN and apply the results of our approach to two popular data sets.
Citation:
Sanjay Chawla, Joseph Davis, Gaurav Pandey, "On Local Pruning of Association Rules Using Directed Hypergraphs," icde, pp.832, 20th International Conference on Data Engineering (ICDE'04), 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||