%0 Journal Article %1 citeulike:823163 %A Chang, Joong H. %A Lee, Won S. %D 2006 %J Information and Software Technology %K citeulike data, frequent, itemsets, mining, streams %N 7 %P 606--618 %R 10.1016/j.infsof.2005.06.004 %T Finding frequent itemsets over online data streams %U http://dx.doi.org/10.1016/j.infsof.2005.06.004 %V 48 %X Conventional data mining methods for finding frequent itemsets require considerable computing time to produce their results from a large data set. Due to this reason, it is almost impossible to apply them to an analysis task in an online data stream where a new transaction is continuously generated at a rapid rate. An algorithm for finding frequent itemsets over an online data stream should support flexible trade-off between processing time and mining accuracy. Furthermore, the most up-to-date resulting set of frequent itemsets should be available quickly at any moment. To satisfy these requirements, this paper proposes a data mining method for finding frequent itemsets over an online data stream. The proposed method examines each transaction one-by-one without any candidate generation process. The count of an itemset that appears in each transaction is monitored by a lexicographic tree resided in main memory. The current set of monitored itemsets in an online data stream is minimized by two major operations: delayed-insertion and pruning. The former is delaying the insertion of a new itemset in recent transactions until the itemset becomes significant enough to be monitored. The latter is pruning a monitored itemset when the itemset turns out to be insignificant. The number of monitored itemsets can be flexibly controlled by the thresholds of these two operations. As the number of monitored itemsets is decreased, frequent itemsets in the online data stream are more rapidly traced while they are less accurate. The performance of the proposed method is analyzed through a series of experiments in order to identify its various characteristics.

@article{citeulike:823163, abstract = {{Conventional data mining methods for finding frequent itemsets require considerable computing time to produce their results from a large data set. Due to this reason, it is almost impossible to apply them to an analysis task in an online data stream where a new transaction is continuously generated at a rapid rate. An algorithm for finding frequent itemsets over an online data stream should support flexible trade-off between processing time and mining accuracy. Furthermore, the most up-to-date resulting set of frequent itemsets should be available quickly at any moment. To satisfy these requirements, this paper proposes a data mining method for finding frequent itemsets over an online data stream. The proposed method examines each transaction one-by-one without any candidate generation process. The count of an itemset that appears in each transaction is monitored by a lexicographic tree resided in main memory. The current set of monitored itemsets in an online data stream is minimized by two major operations: delayed-insertion and pruning. The former is delaying the insertion of a new itemset in recent transactions until the itemset becomes significant enough to be monitored. The latter is pruning a monitored itemset when the itemset turns out to be insignificant. The number of monitored itemsets can be flexibly controlled by the thresholds of these two operations. As the number of monitored itemsets is decreased, frequent itemsets in the online data stream are more rapidly traced while they are less accurate. The performance of the proposed method is analyzed through a series of experiments in order to identify its various characteristics.}}, added-at = {2017-09-08T10:52:59.000+0200}, author = {Chang, Joong H. and Lee, Won S.}, biburl = {https://www.bibsonomy.org/bibtex/24a7ff47656a48557c87a1f4cc66f6ecb/fernand0}, citeulike-article-id = {823163}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.infsof.2005.06.004}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6V0B-4GV2NG2-1/2/fca5f714532c1663a3ca3b9973a433eb}, doi = {10.1016/j.infsof.2005.06.004}, interhash = {28a85a32cb44ff3c06ee93fb2bdb898e}, intrahash = {4a7ff47656a48557c87a1f4cc66f6ecb}, journal = {Information and Software Technology}, keywords = {citeulike data, frequent, itemsets, mining, streams}, month = jul, number = 7, pages = {606--618}, posted-at = {2006-08-31 16:10:23}, priority = {0}, timestamp = {2017-09-08T10:53:23.000+0200}, title = {{Finding frequent itemsets over online data streams}}, url = {http://dx.doi.org/10.1016/j.infsof.2005.06.004}, volume = 48, year = 2006 }