1. NCCU Academic Hub
  2. 學術產出
  3. College of Commerce
  4. Proceedings
  5. Item

學術產出-Proceedings

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 MapReduce-Based Frequent Pattern Mining Framework with Multiple Item Support
作者 Wang, Chen-Shu;Lin, Shiang-Lin;Chang, Jui-Yen
林湘霖
貢獻者 資訊管理學系
關鍵詞 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
日期 2017-02
上傳時間 3-Aug-2017 14:16:13 (UTC+8)
摘要 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.
關聯 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
資料類型 conference
DOI http://dx.doi.org/10.1007/978-3-319-54430-4_7
dc.contributor 資訊管理學系zh_Tw
dc.creator (作者) Wang, Chen-Shu;Lin, Shiang-Lin;Chang, Jui-Yenen_US
dc.creator (作者) 林湘霖zh_TW
dc.date (日期) 2017-02en_US
dc.date.accessioned 3-Aug-2017 14:16:13 (UTC+8)-
dc.date.available 3-Aug-2017 14:16:13 (UTC+8)-
dc.date.issued (上傳時間) 3-Aug-2017 14:16:13 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/111629-
dc.description.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.en_US
dc.format.extent 211 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10192 LNAI, 65-74en_US
dc.relation (關聯) 9th Asian Conference on Intelligent Information and Database Systems, ACIIDS 2017; Kanazawa; Japan; 3 April 2017 到 5 April 2017; 代碼 190369en_US
dc.subject (關鍵詞) 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 miningen_US
dc.title (題名) MapReduce-Based Frequent Pattern Mining Framework with Multiple Item Supporten_US
dc.type (資料類型) conference
dc.identifier.doi (DOI) 10.1007/978-3-319-54430-4_7
dc.doi.uri (DOI) http://dx.doi.org/10.1007/978-3-319-54430-4_7