Approximation of Frequent Itemsets with Maximum Size by One-scan for Association Rule Mining Application


The KIPS Transactions:PartD, Vol. 15, No. 4, pp. 475-484, Aug. 2008
10.3745/KIPSTD.2008.15.4.475,   PDF Download:

Abstract

Nowadays, lots of data mining applications based on continuous and online real time are increasing by the rapid growth of the data processing technique. In order to do association rule mining in that application, we have to use new techniques to find the frequent itemsets. Most of the existing techniques to find the frequent itemsets should scan the total database repeatedly. But in the application based on the continuous and online real time, it is impossible to scan the total database repeatedly. We have to find the frequent itemsets with only one scan of the data interval for that kind of application. So in this paper we propose an approximation technique which finds the maximum size of the frequent itemsets and items included in the maximum size of the frequent itemsets for the processing of association rule mining.


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]
G. S. Han, "Approximation of Frequent Itemsets with Maximum Size by One-scan for Association Rule Mining Application," The KIPS Transactions:PartD, vol. 15, no. 4, pp. 475-484, 2008. DOI: 10.3745/KIPSTD.2008.15.4.475.

[ACM Style]
Gab Soo Han. 2008. Approximation of Frequent Itemsets with Maximum Size by One-scan for Association Rule Mining Application. The KIPS Transactions:PartD, 15, 4, (2008), 475-484. DOI: 10.3745/KIPSTD.2008.15.4.475.