On local pruning of association rules using directed hypergraphs

Sanjay Chawla, Joseph Davis, Gaurav Pandey

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

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
Title of host publicationProceedings - International Conference on Data Engineering
Pages832
Number of pages1
Volume20
Publication statusPublished - 2004
Externally publishedYes
EventProceedings - 20th International Conference on Data Engineering - ICDE 2004 - Boston, MA., United States
Duration: 30 Mar 20042 Apr 2004

Other

OtherProceedings - 20th International Conference on Data Engineering - ICDE 2004
CountryUnited States
CityBoston, MA.
Period30/3/042/4/04

Fingerprint

Association rules

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Chawla, S., Davis, J., & Pandey, G. (2004). On local pruning of association rules using directed hypergraphs. In Proceedings - International Conference on Data Engineering (Vol. 20, pp. 832)

On local pruning of association rules using directed hypergraphs. / Chawla, Sanjay; Davis, Joseph; Pandey, Gaurav.

Proceedings - International Conference on Data Engineering. Vol. 20 2004. p. 832.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chawla, S, Davis, J & Pandey, G 2004, On local pruning of association rules using directed hypergraphs. in Proceedings - International Conference on Data Engineering. vol. 20, pp. 832, Proceedings - 20th International Conference on Data Engineering - ICDE 2004, Boston, MA., United States, 30/3/04.
Chawla S, Davis J, Pandey G. On local pruning of association rules using directed hypergraphs. In Proceedings - International Conference on Data Engineering. Vol. 20. 2004. p. 832
Chawla, Sanjay ; Davis, Joseph ; Pandey, Gaurav. / On local pruning of association rules using directed hypergraphs. Proceedings - International Conference on Data Engineering. Vol. 20 2004. pp. 832
@inproceedings{c25f53ee1a3848599906f6a74c01d571,
title = "On local pruning of association rules using directed hypergraphs",
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.",
author = "Sanjay Chawla and Joseph Davis and Gaurav Pandey",
year = "2004",
language = "English",
volume = "20",
pages = "832",
booktitle = "Proceedings - International Conference on Data Engineering",

}

TY - GEN

T1 - On local pruning of association rules using directed hypergraphs

AU - Chawla, Sanjay

AU - Davis, Joseph

AU - Pandey, Gaurav

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=2442574771&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2442574771&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:2442574771

VL - 20

SP - 832

BT - Proceedings - International Conference on Data Engineering

ER -