计算机与数字工程2012，Vol.40Issue(10)：12-15,4.
基于垂直FP树的并行频繁项集挖掘
A Parallel Frequent Itemsets Mining Algorithm Based on Vertical FP-tree
摘要
Abstract
With the rapid growth of the amount of distributed data, the need for parallel and distributed data mining algorithm becomes more and more pressing. This paper presents a distributed algorithm based on vertical FP-tree called DVFP for mining frequent item. DVFP u-ses a data struct called vertical FP tree (VFP) to store the data, and data parallel and task parallel strategy are used at the same time. This paper also presents a new method to serialize VFP, which greatly reducing the time of communication. Experiments shows that DVFP algorithm has a larger advantage in flexibility and processing time with existing distributed algorithm.关键词
频繁项集挖掘/并行计算/分布式计算Key words
frequent itemsets mining/ parallel computing/ distributed computing分类
信息技术与安全科学引用本文复制引用
徐杰,李云,刘博,张晓斌..基于垂直FP树的并行频繁项集挖掘[J].计算机与数字工程,2012,40(10):12-15,4.基金项目
国家自然科学基金(61070133、61003180) （61070133、61003180）
江苏省自然科学基金(BK2010311) （BK2010311）
江苏省教育厅自然科学基金(11KJD520011)资助. （11KJD520011）
