政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/111629
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 109951/140887 (78%)
造访人次 : 46272453      在线人数 : 1294
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    政大機構典藏 > 商學院 > 資訊管理學系 > 會議論文 >  Item 140.119/111629


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/111629


    题名: 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
    上传时间: 2017-08-03 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
    DOI: 10.1007/978-3-319-54430-4_7
    显示于类别:[資訊管理學系] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML2761检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈