Please use this identifier to cite or link to this item:

Title: MapReduce-Based Frequent Pattern Mining Framework with Multiple Item Support
Authors: Wang, Chen-Shu;Lin, Shiang-Lin;Chang, Jui-Yen
Contributors: 資訊管理學系
Keywords: Association rules;Big data;Database systems;Distributed computer systems;Frequent pattern mining;Growth algorithms;Hadoop MapReduce;Mapreduce frameworks;Multiple items;Parallel and distributed computing;Parallelizations;Real-life applications;Data mining
Date: 2017-02
Issue Date: 2017-08-03 14:16:13 (UTC+8)
Abstract: The analysis of big data mining for frequent patterns is become even more problematic. Many efficient itemset mining algorithms to set a multiple support values for each transaction which could seem feasible as real life applications. To solve problem of single support have been discovered in the past. Since, we know that parallel and distributed computing are valid approaches to deal with large datasets. In order to reduce the search space, we using MISFP-growth algorithm without the process of rebuilding and post pruning steps. Accordingly, in this paper we proposed a model to use of MapReduce framework for implement the parallelization under multi-sup values, thereby improving the overall performance of mining frequent patterns and rare items accurately and efficiently. © Springer International Publishing AG 2017.
Relation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10192 LNAI, 65-74
9th Asian Conference on Intelligent Information and Database Systems, ACIIDS 2017; Kanazawa; Japan; 3 April 2017 到 5 April 2017; 代碼 190369
Data Type: conference
DOI 連結:
Appears in Collections:[資訊管理學系] 會議論文

Files in This Item:

File Description SizeFormat

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing