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

被引:64
作者
Berzal, F [1 ]
Cubero, JC [1 ]
Marín, N [1 ]
Serrano, JM [1 ]
机构
[1] Univ Granada, Dept Ciencias Comp & Intelligencia Artifical, Granada 18071, Spain
关键词
data mining; association rules; relational databases;
D O I
10.1016/S0169-023X(00)00055-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 (DHP). Experiments with real-life datasets show that TEAR outperforms Apriori, a well-known and widely used algorithm. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:47 / 64
页数:18
相关论文
共 22 条
[1]  
Aggarwal C. C., 1998, Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. PODS 1998, P18, DOI 10.1145/275487.275490
[2]  
AGGARWAL CC, 1998, B IEEE COMP SOC TECH
[3]   Parallel mining of association rules [J].
Agrawal, R ;
Shafer, JC .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1996, 8 (06) :962-969
[4]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[5]  
AGRAWAL R, 1996, P 2 INT C KNOWL DISC, P287
[6]  
AGRAWAL R, 1994, RJ9839 IBM ALM RES C
[7]  
Ali K., 1997, Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, P115
[8]  
BAYARDO RJ, 1998, SIGMOD 98, P85, DOI DOI 10.1145/276304.276313
[9]  
Brin S., 1997, SIGMOD Record, V26, P255, DOI [10.1145/253262.253327, 10.1145/253262.253325]
[10]   Maintenance of discovered association rules in large databases: Art incremental updating technique [J].
Cheung, DW ;
Han, JW ;
Ng, VT ;
Wong, CY .
PROCEEDINGS OF THE TWELFTH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, 1996, :106-114