On Local Pruning of Association Rules Using Directed Hypergraphs

  • Authors:
  • Sanjay Chawla;Joseph Davis;Gaurav Pandey

  • Affiliations:
  • -;-;-

  • Venue:
  • ICDE '04 Proceedings of the 20th International Conference on Data Engineering
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we propose an adaptive local pruningmethod for association rules. Our method exploits the exactmapping between a certain class of association rules,namely those whose consequents are singletons and backwarddirected hypergraphs (B-Graphs). The hypergraphwhich represents the association rules is called an AssociationRules Network(ARN). Here we present a simple exampleof an ARN. In the full paper we prove several propertiesof the ARN and apply the results of our approach totwo popular data sets.