An Efficient Hashing Mechanism of the DHP Algorithm for Mining Association Rules 


Vol. 13,  No. 5, pp. 651-660, Oct.  2006
10.3745/KIPSTD.2006.13.5.651


PDF
  Abstract

Algorithms for mining association rules based on the Apriori algorithm use the hash tree data structure for storing and counting supports of the candidate frequent itemsets and the most part of the execution time is consumed for searching in the hash tree. The DHP(Direct Hashing and Pruning) algorithm makes efforts to reduce the number of the candidate frequent itemsets to save searching time in the hash tree. For this purpose, the DHP algorithm does preparative simple counting supports of the candidate frequent itemsets. At this time, the DHP algorithm uses the direct hash table to reduce the overhead of the preparative counting supports. This paper proposes and evaluates an efficient hashing mechanism for the direct hash table H2 which is for pruning in phase 2 and the hash tree Ck, which is for counting supports of the candidate frequent itemsets in all phases. The results showed that the performance improvement due to the proposed hashing mechanism was 82.2% on the maximum and 18.5% on the average compared to the conventional method using a simple mod operation.

  Statistics
  Cite this article

[IEEE Style]

H. B. Lee, "An Efficient Hashing Mechanism of the DHP Algorithm for Mining Association Rules," The KIPS Transactions:PartD, vol. 13, no. 5, pp. 651-660, 2006. DOI: 10.3745/KIPSTD.2006.13.5.651.

[ACM Style]

Hyung Bong Lee. 2006. An Efficient Hashing Mechanism of the DHP Algorithm for Mining Association Rules. The KIPS Transactions:PartD, 13, 5, (2006), 651-660. DOI: 10.3745/KIPSTD.2006.13.5.651.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals