计算机工程与应用2011，Vol.47Issue(21)：133-136,4.DOI:10.3778/j.issn.1002-8331.2011.21.035
矩阵约束下的频繁项集挖掘方法研究
Matrix constrained frequent itemsets mining method
摘要
Abstract
Association analysis techniques in data mining are aimed at discovering interesting association among a large number of data itemsets, and the core problem is to find frequent itemsets.In traditional association mining algorithm based on matrix,the matrix size is related to the transaction database size.Thus memory bottlenecks still exist in dealing with very large transaction databases.This paper presents a frequent itemsets discovery algorithm to solve this problem.In the pre-min-ing and post-validating matrix constrained algorithm the matrix size is independent of the transaction database size.Experimen-tal results show that this algorithm improves the speed of frequent itemsets mining.关键词
数据挖掘/关联分析/频繁项集Key words
data mining/association analysis/frequent itemsets分类
信息技术与安全科学引用本文复制引用
范黎林,林卫..矩阵约束下的频繁项集挖掘方法研究[J].计算机工程与应用,2011,47(21):133-136,4.基金项目
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60873104) （the National Natural Science Foundation of China under Grant No.60873104）
河南省科技攻关计划项目(No.092102210316). （No.092102210316）
