.png){kind=icon}
返回
Mining frequent patterns from dynamic data streams with data load management
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2012.01.024.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2012 Elsevier Inc. All rights reserved.
Keyword:
Data mining
Data streams
Frequent patterns
Combinatorial approximation
Overload handling
Load shedding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.5K
被引数:
8.4K
机构
引用论文
.png){kind=icon}
An adaptive approximation method to discover frequent itemsets over sliding-window-based data streams基于滑动窗口的数据流上发现频繁项集的自适应近似方法
PREAI
分享收藏
没有更多内容
没有更多内容