On Local Pruning of Association Rules Using Directed Hypergraphs

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. The hypergraph which represents the association rules is called an Association Rules Network(ARN). We propose two operations on this network for pruning rules, prove several properties of the ARN and apply the results of our approach to two popular data sets.

• Type: Conference
• Year: 2004
• Where: ICDE
• Authors: Sanjay Chawla, Joseph G. Davis, Gaurav Pandey
• Keywords: Association Rules, Association Rules Network(ARN, Database, ICDE 2004, Local Pruning Method