一种基于排序的基因表达数据频繁闭合模式挖掘算法

摘要

频繁闭合模式是频繁模式的无损压缩，因此采用频繁闭合模式的挖掘来代替频繁模式挖掘，可以适当的压缩计算和存储开销。文中针对已有的面向基因表达数据集频繁闭合模式挖掘算法CARPENTER多次扫描数据集转置表带来巨大开销的缺陷，提出了基于排序的频繁闭合模式挖掘算法SFCP。在真实数据集上的实验结果表明，该算法效率比CARPENTER算法高。%Frequent closed pattern is the non-loss compression of frequent pattern. Insteading of mining frequent pattern, we mining frequent closed pattern for less time and memory waste. For the sake of avoiding the numerous computing overhead caused by passing the transposed table of dataset many times, we proposed a new algorithm SFCP. Several experiments on real-life gene expression datasets showed that SFCP was faster than latter.