Efficient Algorithms for Mining Association Rules Under the Interactive Environments


The KIPS Transactions:PartD, Vol. 8, No. 4, pp. 339-346, Aug. 2001
10.3745/KIPSTD.2001.8.4.339,   PDF Download:

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
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


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.