By Topic

On local pruning of association rules using directed hypergraphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Chawla, S. ; Knowledge Manage. Res. Group, Sydney Univ., NSW, Australia ; Davis, J. ; Pandey, G.

Here 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. We further prove several properties of the ARN and apply the results of our approach to two popular data sets.

Published in:

Data Engineering, 2004. Proceedings. 20th International Conference on

Date of Conference:

30 March-2 April 2004