期刊文献+

一种基于ZBDD结构的Top-k挖掘算法

A Top-k Mining Algorithm Based on ZBDD Structrue
下载PDF
导出
摘要 研究微阵列数据中挖掘Top-k频繁闭合项集问题,并设计挖掘算法ZDtop。算法采用ZBDD结构压缩存储数据集,使用自顶向下深度优先搜索策略挖掘项集长度不小于给定值min_l的Top-k频繁闭合项集,并对搜索空间进行有效修剪。通过实例证明该算法是正确有效的。 Mainly studies the microarray data in mining Top-k frequent closed itemsets and designs ZDtop mining algorithm. The algorithm uses the ZBDD structure compress store dataset and top-down depth-first search strategy to mine Top-k frequent closed itemsets of length no less than given value min_l and pruning the search space effectively. And it is proved to be correct and effi- cient by example.
作者 焦雷
出处 《现代计算机》 2011年第20期3-7,共5页 Modern Computer
关键词 微阵列数据 Top—k频繁闭合项集 ZBDD 深度优先 Microarray Data Top-k Frequent Closed Itemset Zero-Suppressed Binary Decision Diagram Depth-First
  • 相关文献

参考文献5

  • 1Pan.F., Cong,G.,Tung,A., et al. Carpenter:Finding Closed Pat-terns in Long Biological Datasets[C]. Proceedings of Sigkdd'03. Washingtong, D.C: August 2003:637-642.
  • 2H. Liu, X. Wang, J. He, et al. Top-down Mining of Frequent Closed Patterns from Very High Dimensional Data[J]. IEEE Information Sciences, 2009,179(7): 899-924.
  • 3E. Loekito,J. Bailey, Are Zero-Suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimen- sional Datasets. Proe. 6th Australasia Data Mining Confer- ence. Gold Coast, Australia, 2007:139-150.
  • 4J. Wang, J. Han, Y. Lu, P. Tzvetkov. TFP: An Efficient Algo- rithm for Mining Top-K Frequent Closed Itemsets[J]. Journal of IEEE Transaction on Knowledge and Data Engineering, 2005, 17(5): 652-664.
  • 5Minato S. Zero-Suppressed BDDS for Set Manipulation in Combinatorial Problem[R]. 30th ACM/IEEE Design Automa- tion Conference.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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