CROSS CORRELATION BASED INTER-TRANSACTION ASSOCIATION RULE MINING TECHNIQUE

被引:0
作者
Ghanem, A. M. [1 ]
Tawfik, B. [2 ]
Owis, M. I. [2 ]
机构
[1] Suez Canal Univ, Fac Informat Syst, Ismailia, Egypt
[2] Cairo Univ, Dept Biomed Engn, Giza, Egypt
来源
2008 CAIRO INTERNATIONAL BIOMEDICAL ENGINEERING CONFERENCE | 2008年
关键词
Data Mining; Inter-Transaction Association Rule Mining; Cross Correlation;
D O I
暂无
中图分类号
R318 [生物医学工程];
学科分类号
0831 ;
摘要
Several algorithms have been proposed to solve the problem of mining frequent inter-transaction itemset. However, the low efficiency of support calculation for inter-transaction itemsets is still a challenging problem that eliminates the performance of mining algorithms. This paper provides intertransaction association rule mining algorithm using effective technique for support calculations. The proposed technique is based on cross correlation and bitwise operations. The experimental results show a significant improvement of performance up to several orders of magnitude compared to First Intra Then Inter (FITI) algorithm.
引用
收藏
页码:294 / +
页数:2
相关论文
共 9 条
[1]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[2]  
Agrawal R., 1994, Proceedings of the 20th International Conference on Very Large Data Bases. VLDB'94, P487
[3]  
[Anonymous], P PYOC ACM SIGMOD IN
[4]  
GARDARIN G, 1998, SPRING 14 BAS DONN A, P157
[5]  
Han J., 2000, ACM Sigkdd Explor. Newsl, V2, P14, DOI [10.1145/380995.381002, DOI 10.1145/380995.381002]
[6]  
LEE AJT, 2007, ELSAVIER INT J INFOR, P3453
[7]   Beyond intratransaction association analysis: Mining multidimensional intertransaction association rules [J].
Lu, H ;
Feng, L ;
Han, J .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2000, 18 (04) :423-454
[8]   Efficient mining of intertransaction association rules [J].
Tung, AKH ;
Lu, HJ ;
Han, JW ;
Feng, L .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2003, 15 (01) :43-56
[9]   Scalable algorithms for association mining [J].
Zaki, MJ .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2000, 12 (03) :372-390