计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (33): 180-183.

• 数据库与信息处理 • 上一篇    下一篇

FCIM:一种新的闭模式挖掘算法

李世松1,柴晓辉2,宋顺林1   

  1. 1.江苏大学 计算机科学与通信工程学院,江苏 镇江 212013
    2.商丘师范学院 计算机科学系,河南 商丘 476000
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-11-21 发布日期:2007-11-21
  • 通讯作者: 李世松

FCIM:new frequent closed itemset mining algorithm

LI Shi-song1,CHAI Xiao-hui2,SONG Shun-lin1   

  1. 1.School of Computer Science and Telecommunication Engineering,Jiangsu University,Zhenjiang,Jiangsu 212013,China
    2.Department of Computer Science,Shangqiu Normal University,Shangqiu,Henan 476000,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-11-21 Published:2007-11-21
  • Contact: LI Shi-song

摘要: 闭模式挖掘在关联规则挖掘算法中获得了较广的应用,提出一种新的挖掘频繁闭项目集的算法,该算法可以充分利用挖掘过程中已获取的信息,直接使用FP-Tree产生闭项目集,实验结果表明该算法是有效的。

关键词: 闭模式, 关联规则, 数据挖掘

Abstract: This paper proposes a new approach to mining the frequent closed itemsets in FP-Tree,without duplicates generation and without memory conservation.The experimental performances show that this algorithm outperforms better than other state of the art algorithms.

Key words: closed pattern, Association Rule, Data Mining