Efficient Algorithms for Mining Association Rules Under the Interactive Environments 


Vol. 8,  No. 4, pp. 339-346, Aug.  2001
10.3745/KIPSTD.2001.8.4.339


PDF
  Abstract

A problem for mining association rules under the interactive environments is to mine repeatedly association rules with the different minimum support. This problem includes all subproblems except on the facts that mine repeatedly association rules with the same database. This paper proposed the efficient algorithms to improve the performance by using the information of the candidate large itemsets which calculate the previous association rules. The proposed algorithms were compared with the conventional algorithm with respect to the execution time. The comparisons show that the proposed algorithms achieve 10~30% more gain than the conventional algorithm.

  Statistics
  Cite this article

[IEEE Style]

J. M. Lee, "Efficient Algorithms for Mining Association Rules Under the Interactive Environments," The KIPS Transactions:PartD, vol. 8, no. 4, pp. 339-346, 2001. DOI: 10.3745/KIPSTD.2001.8.4.339.

[ACM Style]

Jae Moon Lee. 2001. Efficient Algorithms for Mining Association Rules Under the Interactive Environments. The KIPS Transactions:PartD, 8, 4, (2001), 339-346. DOI: 10.3745/KIPSTD.2001.8.4.339.

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