An Efficient Algorithm For Mining Association Rules In Main Memory Systems 


Vol. 9,  No. 4, pp. 579-586, Aug.  2002
10.3745/KIPSTD.2002.9.4.579


PDF
  Abstract

This paper propose an efficient algorithm for mining association rules in the large main memory systems. To do this, the paper attempts firstly to extend the conventional algorithms such as DHP and Partition in order to be compatible to the large main memory systems and proposes secondly an algorithm to improve Partition algorithm by applying the techniques of the hash table and the bit map. The proposed algorithm is compared to the extended DHP within the experimental environments and the results show up to 65% performance improvement in comparison to the expanded DHP.

  Statistics
  Cite this article

[IEEE Style]

J. M. Lee, "An Efficient Algorithm For Mining Association Rules In Main Memory Systems," The KIPS Transactions:PartD, vol. 9, no. 4, pp. 579-586, 2002. DOI: 10.3745/KIPSTD.2002.9.4.579.

[ACM Style]

Jae Moon Lee. 2002. An Efficient Algorithm For Mining Association Rules In Main Memory Systems. The KIPS Transactions:PartD, 9, 4, (2002), 579-586. DOI: 10.3745/KIPSTD.2002.9.4.579.

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