On local pruning of association rules using directed hypergraphs

Sanjay Chawla, Joseph Davis, Gaurav Pandey

Research output: Contribution to conferencePaperpeer-review

16 Scopus citations

Abstract

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.

Original languageEnglish
Pages832
Number of pages1
StatePublished - 2004
Externally publishedYes
EventProceedings - 20th International Conference on Data Engineering - ICDE 2004 - Boston, MA., United States
Duration: Mar 30 2004Apr 2 2004

Conference

ConferenceProceedings - 20th International Conference on Data Engineering - ICDE 2004
Country/TerritoryUnited States
CityBoston, MA.
Period03/30/0404/2/04

Fingerprint

Dive into the research topics of 'On local pruning of association rules using directed hypergraphs'. Together they form a unique fingerprint.

Cite this