计算机科学 ›› 2009, Vol. 36 ›› Issue (2): 175-178.
• • 上一篇 下一篇
出版日期:
发布日期:
基金资助:
Online:
Published:
摘要: 提出了一种快速挖掘频繁闭项集并构建其格的算法Q-CFIsL。该算法引入了preC(X)的概念,使用preC(X)加快了包容检测和建格的速度。实验表明,对于真实数据集以及合成数据集,Q-CFIsL的性能都优于当前最新的同类算法CHARM-L。
关键词: 关联规则 频繁闭项集 频繁闭项集格
Abstract: A fast algorithm Q-CFIsL for mining closed frequent itemsets and building their lattice was presented. It introduced prec(X),which can make the subsumption cheching and latiice building more efficiently. Experimental results show that Q-CFIsL outperforms
Key words: Association rule, Closed frequent itemset, Closed frequent itemset lattice
. Q—CFIsL:挖掘频繁闭项集并构建其格的快速算法[J]. 计算机科学, 2009, 36(2): 175-178. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2009/V36/I2/175
Cited