Mining frequent patterns from dynamic data streams with data load management

Authors:
Chao-Wei Li;Kuen-Fang Jea;Ru-Ping Lin;Ssu-Fan Yen;Chih-Wei Hsu
Affiliations:
Department of Computer Science and Engineering, National Chung-Hsing University, 250 Kuo-Kuang Road, Taichung 40227, Taiwan, ROC;Department of Computer Science and Engineering, National Chung-Hsing University, 250 Kuo-Kuang Road, Taichung 40227, Taiwan, ROC;Department of Computer Science and Engineering, National Chung-Hsing University, 250 Kuo-Kuang Road, Taichung 40227, Taiwan, ROC;Department of Computer Science and Engineering, National Chung-Hsing University, 250 Kuo-Kuang Road, Taichung 40227, Taiwan, ROC;Department of Computer Science and Engineering, National Chung-Hsing University, 250 Kuo-Kuang Road, Taichung 40227, Taiwan, ROC
Venue:
Journal of Systems and Software
Year:
2012

Citing 10
Cited 1

Computing Iceberg Queries Efficiently

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Finding frequent items in data streams

Theoretical Computer Science - Special issue on automata, languages and programming
DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams

ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Approximate frequency counts over data streams

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
StatStream: statistical monitoring of thousands of data streams in real time

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Mining frequent itemsets over data streams using efficient window sliding techniques

Expert Systems with Applications: An International Journal
Discovering frequent itemsets over transactional data streams through an efficient and stable approximate approach

Expert Systems with Applications: An International Journal
Sliding window-based frequent pattern mining over data streams

Information Sciences: an International Journal
An adaptive approximation method to discover frequent itemsets over sliding-window-based data streams

Expert Systems with Applications: An International Journal

Stream mining on univariate uncertain data

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the practical problem of frequent-itemset discovery in data-stream environments which may suffer from data overload. The main issues include frequent-pattern mining and data-overload handling. Therefore, a mining algorithm together with two dedicated overload-handling mechanisms is proposed. The algorithm extracts basic information from streaming data and keeps the information in its data structure. The mining task is accomplished when requested by calculating the approximate counts of itemsets and then returning the frequent ones. When there exists data overload, one of the two mechanisms is executed to settle the overload by either improving system throughput or shedding data load. From the experimental data, we find that our mining algorithm is efficient and possesses good accuracy. More importantly, it could effectively manage data overload with the overload-handling mechanisms. Our research results may lead to a feasible solution for frequent-pattern mining in dynamic data streams.