作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (7): 35-37. doi: 10.3969/j.issn.1000-3428.2011.07.012

• 软件技术与数据库 • 上一篇    下一篇

基于Iceberg概念格的最大频繁项集挖掘

薛安荣,王富强,李 明   

  1. (江苏大学计算机科学与通信工程学院,江苏 镇江 212013)
  • 出版日期:2011-04-05 发布日期:2011-03-31
  • 作者简介:薛安荣(1964-),男,副教授、博士,主研方向:数据挖掘,时空数据库;王富强、李 明,硕士研究生
  • 基金资助:
    国家自然科学基金资助项目(60773049);江苏大学高级人才启动基金资助项目(09JDG041)

Maximal Frequent Itemsets Mining Based on Iceberg Concept Lattice

XUE An-rong, WANG Fu-qiang, LI Ming   

  1. (School of Computer Science and Telecommunications Engineering, Jiangsu University, Zhenjiang 212013, China)
  • Online:2011-04-05 Published:2011-03-31

摘要: 最大频繁项集挖掘算法存在扫描数据集次数多和候选集规模过大等局限。基于Iceberg概念格模型,提出一种在Iceberg概念格上挖掘最大频繁项集的算法ICMFIA。该算法通过一次扫描数据集构建Iceberg概念格,利用Iceberg概念格中频繁概念之间良好的覆盖关系能快速计算出最大频繁项集所对应的最大频繁概念,所有最大频繁概念的内涵就是所求的最大频繁项集的集合。实验结果表明,该算法具有扫描数据集次数少和挖掘效率高的优点。

关键词: Iceberg概念格, 频繁概念, 最大频繁概念, 最大频繁项集

Abstract: Some existing algorithms for mining Maximal Frequent Itemset(MFI) limit in scanning data sets frequently and tremendous candidate set size, etc. Based on Iceberg concept lattice model, this paper presents a maximal frequent itemsets mining algorithm——Iceberg Concept Lattice Maxmal Frequent Itemset Algorithm(ICMFIA) in the Iceberg concept lattice. The algorithm builds the Iceberg concept lattice through scanning the data sets at a time, by using the coverage relationship between frequent concepts in the Iceberg concept lattice, it can quickly calculate the maximum frequent concepts corresponding to the maximum frequent itemsets. The intension of all maximal frequent concepts is the set of all maximal frequent itemsets. Experimental results show that ICMFIA algorithm outperforms other existing algorithms in the number of scan data sets and mining efficiency.

Key words: Iceberg concept lattice, frequent concept, maximal frequent concept, Maximal Frequent Itemset(MFI)

中图分类号: