摘要
频繁项集是挖掘流数据挖掘的基本任务。许多近似算法能够有效进行频繁项挖掘,但不能有效控制内存资源消耗。文章提出并实现了0-δ算法,能够有效控制内存消耗问题。在充分的理论分析基础上,还用翔实的实验证明了新方法的有效性。
Mining frequent items is a basic task in stream data mining. Many approximation algorithms behave well in frequent items mining,but can not control their memory consumption. 0-δ algorithm that can solve the memory consumption problem was proposed and implemented. Besides sufficient analysis in theory,some extensive tests were also presented to show this algorithm is effective and efficient.
出处
《计算机应用》
CSCD
北大核心
2004年第10期4-6,共3页
journal of Computer Applications
基金
国家 86 3计划项目 (2 0 0 2AA41 3 3 1 0 )
