| 一种基于ZBDD结构的Top—k挖掘算法 |
| |
| 引用本文： | 焦雷.一种基于ZBDD结构的Top—k挖掘算法[J].电脑与微电子技术,2011(20):3-7. |
| |
| 作者姓名： | 焦雷 |
| |
| 作者单位： | 桂林电子科技大学计算机科学与工程学院,桂林541004 |
| |
| 摘 要： | 研究微阵列数据中挖掘Top—k频繁闭合项集问题，并设计挖掘算法ZDtoP。算法采用ZBDD结构压缩存储数据集，使用自顶向下深度优先搜索策略挖掘项集长度不小于给定值min_l的Top—k频繁闭合项集，并对搜索空间进行有效修剪。通过实例证明该算法是正确有效的。
|
| 关 键 词： | 微阵列数据 Top—k频繁闭合项集 ZBDD 深度优先 |
A Top-k Mining Algorithm Based on ZBDD Structrue |
| |
| Authors: | JIAO Lei |
| |
| Affiliation: | JIAO Lei (School of Computer Science ＆ Engineering, Guilin University of Electronic Technology, Guilin 541004) |
| |
| Abstract: | 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. |
| |
| Keywords: | Microarray Data Top-k Frequent Closed Itemset Zero-Suppressed Binary Decision Diagram Depth-First |
| 本文献已被 维普 等数据库收录！ |
