DHPTID-hybrid algorithm: A hybrid algorithm for association rule mining

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Sonawani, S., & Mishra, A. (2010). DHPTID-hybrid algorithm: A hybrid algorithm for association rule mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6440 LNAI, pp. 149–160). https://doi.org/10.1007/978-3-642-17316-5_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free