TBAR: An efficient method for association rule mining in relational databases

In this paper, we propose a new algorithm for efficient association rule mi ning, which we apply in order to discover interesting patterns in relationa l databases. Our algorithm, which is called Tree-Based Association Rule min ing (TBAR), redefines the notion of item and employs an effective tree data structure. It can also use techniques such as Direct Hashing and Pruning ( DHP). Experiments with real-life datasets show that TEAR outperforms Aprior i, a well-known and widely used algorithm. (C) 2001 Elsevier Science B.V. A ll rights reserved.