The Community for Technology Leaders
2013 IEEE 29th International Conference on Data Engineering (ICDE) (2004)
Boston, Massachusetts
Mar. 30, 2004 to Apr. 2, 2004
ISSN: 1063-6382
ISBN: 0-7695-2065-0
pp: 832
Joseph Davis , University of Sydney
Sanjay Chawla , University of Sydney
Gaurav Pandey , IIT Kanpur, India
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.
INDEX TERMS
null
CITATION
Joseph Davis, Sanjay Chawla, Gaurav Pandey, "On Local Pruning of Association Rules Using Directed Hypergraphs", 2013 IEEE 29th International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 832, 2004, doi:10.1109/ICDE.2004.1320063
90 ms
(Ver 3.3 (11022016))