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 language | English |
---|---|
Pages | 832 |
Number of pages | 1 |
Publication status | Published - 2004 |
Externally published | Yes |
Event | Proceedings - 20th International Conference on Data Engineering - ICDE 2004 - Boston, MA., United States Duration: 30 Mar 2004 → 2 Apr 2004 |
Conference
Conference | Proceedings - 20th International Conference on Data Engineering - ICDE 2004 |
---|---|
Country/Territory | United States |
City | Boston, MA. |
Period | 30/03/04 → 2/04/04 |