计算机工程与应用Issue(22)：154-157,171,5.DOI:10.3778/j.issn.1002-8331.1312-0411
矩阵与前缀树方法挖掘频繁项集
Algorithm of matrix and Prefix-tree for mining frequent itemsets
摘要
Abstract
Traditional algorithm of frequent itemsets mining’s execution efficiency is low. MPFI algorithm based on matrix and Prefix-tree is raised for frequent itemsets mining. It can quickly mining frequent itemsets of transaction database. MPFI algorithm only scan transaction database once, builds vertical binary matrix. Binary vector for frequent itemsets information and Prefix-tree data structure for compression storage of frequent itemsets is applied in the algorithm, without candidate itemsets. According to theoretical analysis and experimental results, MPFI algorithm can effectively improve the efficiency of frequent itemsets mining.关键词
频繁项集/矩阵/二进制/前缀树Key words
frequent itemsets/matrix/binary/Prefix-tree分类
信息技术与安全科学引用本文复制引用
丁邦旭,黄永青..矩阵与前缀树方法挖掘频繁项集[J].计算机工程与应用,2015,(22):154-157,171,5.基金项目
安徽省高校省级自然科学研究项目（No.KJ2013Z327）；教育部人文社会科学研究青年基金项目（No.11YJC630074）；安徽省自然科学基金项目（No.1208085MG121）。 （）
