摘要
研究微阵列数据中挖掘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