| 注册
首页|期刊导航|计算机工程|改进的数据流频繁闭项集挖掘算法

改进的数据流频繁闭项集挖掘算法

李国栋 胡建平

计算机工程2011,Vol.37Issue(19):68-70,3.
计算机工程2011,Vol.37Issue(19):68-70,3.DOI:10.3969/j.issn.1000-3428.2011.19.021

改进的数据流频繁闭项集挖掘算法

Improved Mining Algorithm for Frequent Closed Itemsets over Data Stream

李国栋 1胡建平1

作者信息

  • 1. 天津城市建设学院电子与信息工程系,天津300384
  • 折叠

摘要

Abstract

Aiming at the problem of NewMoment algorithm frequently do leftcheck operation in the data mining process, which leads to the low efficiency of algorithm, this paper proposes an improved method called LevelMoment to improve the NewMoment algorithm which mines frequent closed itemsets over data streams. In this process, a new data structure that added in level node, called LevelCET, is proposed. On this structure, using level checking strategy and optimum frequent closed items checking strategy can quickly tap all the frequent closed itemsets over data streams. Experimental results show that the algorithm has good performance on run time and storage space.

关键词

数据流/频繁闭项集/滑动窗口/层次检测策略/最佳频繁闭项集检测策略

Key words

data stream/ frequent closed itemset/ sliding window/ level checking strategy/ optimum frequent closed itemsets checking strategy

分类

信息技术与安全科学

引用本文复制引用

李国栋,胡建平..改进的数据流频繁闭项集挖掘算法[J].计算机工程,2011,37(19):68-70,3.

基金项目

国家科技支撑计划基金资助项目(2008BAJ08B16) (2008BAJ08B16)

计算机工程

OACSCDCSTPCD

1000-3428

访问量0
|
下载量0
段落导航相关论文