Berzal, F.; Cubero, J.-C.; Marín, N.; Serrano, J.-M. TBAR: An efficient method for association rule mining in relational databases. (English) Zbl 0969.68053 Data Knowl. Eng. 37, No. 1, 47-64 (2001). Summary: In this paper, we propose a new algorithm for efficient association rule mining, which we apply in order to discover interesting patterns in relational databases. Our algorithm, which is called Tree-Based Association Rule mining (TBAR), redefines the notion of item and employs an effective tree data structure. It can also use techniques such as direct hashing and pruning. Experiments with real-life datasets show that TBAR outperforms Apriori, a well-known and widely used algorithm. Cited in 1 Document MSC: 68P15 Database theory Keywords:efficient association rule mining Software:TBAR PDFBibTeX XMLCite \textit{F. Berzal} et al., Data Knowl. Eng. 37, No. 1, 47--64 (2001; Zbl 0969.68053) Full Text: DOI