期刊文献+

CLOSET^+:基于CLOSET的改进算法

CLOSET^+:Improved Algorithm Based on CLOSET
下载PDF
导出
摘要 分析了用各种不同的方法挖掘频繁闭合模式的优缺点,以及在什么时候该采取什么样的策略以取得较好的表现。提出了一个CLOSET+算法,该算法不仅综合了其他算法的优点,而且还提出了新的思想和算法。 This article analysed pros and cons of the various strategies for efficient frequent closed itemset mining, and what and how can pick and integrate the best strategies to achieve higher performance in general cases? Finally, it develops a winning algorithm CLOSET^+ . CLOSET^+ integrates the advantages of the previously proposed effective strategies as well as some ones newly developed here,
出处 《计算机应用研究》 CSCD 北大核心 2006年第11期43-46,共4页 Application Research of Computers
基金 国家自然科学基金重大研究计划项目(90104005)
关键词 关联规则 FP-TREE 频繁闭合项目集 Association Rules FP-tree Frequent Closed Itemsets
  • 相关文献

参考文献8

  • 1R Agrawal, R Srikant. Fast Algorithms for Mining Association Rules[C]. VLDB, 1994.478-499. 被引量:1
  • 2J Pei, J Han, R Mao. CLOSET: An Efficient Algorithm for Mining Frequent Closed hemsets[ C]. DMKD,2000.11-20. 被引量:1
  • 3D Burdick, M Calimlim, J Gehrke. MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases[ C]. ICDE,2001. 被引量:1
  • 4J Han, J Pei, Y Yin. Mining Frequent Patterns without Candidate Generation [ C ]. SIGMOD,2000. 被引量:1
  • 5N Pasquier, Y Bastide, R Taouil,et al. Discovering Frequent Closed Itemsets for Association Rules[ C]. ICDT, 1999. 398-416. 被引量:1
  • 6M Zaki, C Hsiao. CHARM: An Efficient Algorithm for Closed Itemset Mining[C]. SDM, 2002.457-473. 被引量:1
  • 7Mohammed J Zaki, Karam Gouda. Fast Vertical Mining Using Diffsets[ C]. KDD,2003. 326-355. 被引量:1
  • 8R J Bayardo. Efficiently Mining Long Patterns from Databases [ C ].SIGMOD, 1998.85-93. 被引量:1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部