DHPTID-HYBRID Algorithm: A Hybrid Algorithm for Association Rule Mining
Direct Hashing and Pruning algorithm of ARM performs well at initial passes by smaller candidate 2-itemset generation and turns out to be very powerful to facilitate initial itemset generation. Efficient pruning technique of AprioriTid algorithm is highly effective for frequent itemset generation in the later passes. Theoretical and practical studies reveals the underneath facts for the scope of improvement for both the algorithms. This paper describes a hybrid approach for association rule mining, based on coupling of best part of two well known ARM algorithms, AprioriTid and DHP with a binary approach which significantly improves the performance.
Association rule mining algorithm DHP AprioriTid binary approach coupled algorithm
Shilpa Sonawani Amrita Mishra
JSS Academy of Technical Education,Department of Computer Science & Engineering,Noida Uttar Pradesh India
国际会议
6th International Conference on Advanced Data Mining and Applications(第六届先进数据挖掘及应用国际会议 ADMA 2010)
重庆
英文
149-160
2010-11-19(万方平台首次上网日期,不代表论文的发表时间)