计算机工程2011，Vol.37Issue(2)：60-62,3.DOI:10.3969/j.issn.1000-3428.2011.02.021
微阵列数据中Top-k频繁闭合项集挖掘
Top-k Frequent Closed Item Set Mining in Microarray Data
摘要
Abstract
Most previous mining frequent closed item sets require the specification of a minimum support threshold in microarry data. However, it is difficult for users to provide an appropriate minimum support threshold in practice. Aiming at this problem, this paper presents a top-k frequent closed item set and an algorithm in microarray data. The algorithm uses top-down breadth-first search strategy to mining top-k frequent closed item set of length no less than given value min_l and pruning the search space effectively to improve the search speed. Experimental result shows that the time performance of this algorithm outperforms the CARPENTER algorithm in most cases.关键词
微阵列数据/top-k频繁闭合项集/自顶向下/宽度优先Key words
microarray data/ top-k frequent closed item set/ top-down/ breadth-first分类
信息技术与安全科学引用本文复制引用
史建军,缪裕青..微阵列数据中Top-k频繁闭合项集挖掘[J].计算机工程,2011,37(2):60-62,3.基金项目
国家留学基金资助项目 （）
