English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52343/87441 (60%)
Visitors : 9116450      Online Users : 319
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/92459

    Title: A Search Space Reduced Algorithm for Mining Frequent Patterns
    Authors: Yen, Show-Jane;Wang, Chiu-Kuang;Ouyang, Liang-Yuh
    Contributors: 淡江大學企業管理學系;淡江大學管理科學學系
    Keywords: data mining;frequent pattern;frequent itemset;FP-tree;transaction database
    Date: 2012-01
    Issue Date: 2013-10-14 16:21:06 (UTC+8)
    Publisher: 臺北市:中央研究院資訊科學研究所
    Abstract: Mining frequent patterns is to discover the groups of items appearing always together excess of a user specified threshold. Many approaches have been proposed for mining frequent patterns by applying the FP-tree structure to improve the efficiency of the FP-Growth algorithm which needs to recursively construct sub-trees. Although these approaches do not need to recursively construct many sub-trees, they also suffer the problem of a large search space, such that the performances for the previous approaches degrade when the database is massive or the threshold for mining frequent patterns is low. In order to reduce the search space and speed up the mining process, we propose an efficient algorithm for mining frequent patterns based on frequent pattern tree. Our algorithm generates a subtree for each frequent item and then generates candidates in batch from this sub-tree. For each candidate generation, our algorithm only generates a small set of candidates, which can significantly reduce the search space. The experimental results also show that our algorithm outperforms the previous approaches.
    Relation: Journal of Information Science and Engineering 28(1), pp.177-191
    Appears in Collections:[管理科學學系暨研究所] 期刊論文
    [企業管理學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    201201_12.pdf期刊論文670KbAdobe PDF469View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback