A study and analysis of DHP algorithm for association rules
Abstract：Association rules can be used to find useful information from data.In light of the basic idea of DHP algorithm,we illustrate and analyze the execution and the performance of DHP algorithm in this paper.From the illustration and analysis we conclude that DHP algorithm generates frequent itemsets efficiently and breaks the bottleneck of the performance of the generated 2-itemsets,the L2.Consequently,the transaction database size and database scan decrease.
Keywords：association ruleDHPtransaction database
Publication Date：2012-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：3( 30-32 )