| 一种基于后缀项表的并行闭频繁项集挖掘算法 |
| |
| 引用本文： | 唐颖峰,陈世平.一种基于后缀项表的并行闭频繁项集挖掘算法[J].计算机应用研究,2014,31(2):373-377. |
| |
| 作者姓名： | 唐颖峰 陈世平 |
| |
| 作者单位： | 1. 上海理工大学 管理学院, 上海 200093; 2. 上海对外经贸大学 教务处, 上海 201620 |
| |
| 基金项目： | 国家自然科学基金资助项目（61170277）; 上海市教委科研创新重点项目（12zz137）; 上海市一流学科建设项目（S1205YLXK） |
| |
| 摘 要： | 对现有的基于MapReduce的并行频繁项集挖掘算法进行了研究, 提出一种基于后缀项表的并行闭频繁项集挖掘算法, 通过后缀项表的引入及以闭频繁项集挖掘的形式, 减少组分间的数据传送量, 提高挖掘效率。实验表明, 该算法可以有效缩短平均挖掘时间, 对于高维大数据具有较好的性能。
|
| 关 键 词： | 频繁项集挖掘 并行挖掘算法 MapReduce 闭频繁项集 后缀项表 |
Parallel closed frequent itemset mining algorithm with postfix-table |
| |
| TANG Ying-feng,CHEN Shi-ping.Parallel closed frequent itemset mining algorithm with postfix-table[J].Application Research of Computers,2014,31(2):373-377. |
| |
| Authors: | TANG Ying-feng CHEN Shi-ping |
| |
| Affiliation: | 1. Business School, University of Shanghai for Science & Technology, Shanghai 200093, China; 2. Academic Affairs Section, Shanghai University of International Business & Economics, Shanghai 201620, China |
| |
| Abstract: | Based on current frequent itemsets mining using parallel FP-Growth algorithm with MapReduce framework, this paper proposed a parallel closed frequent itemsets mining algorithm with a postfix-table based on MapReduce framework. The algorithm generated closed frequent itemsets instead of all frequent itemsets. With a postfix-table structure, the algorithm could reduce the amount of data transfer between mappers and reducers efficiently. The experimental results show that the algorithm can shorten mining time efficiently. The algorithm has good performance especially in long- transction mode. |
| |
| Keywords: | frequent itemsets mining parallel mining algorithm MapReduce closed frequent itemsets postfix-table |
|
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
