English  |  正體中文  |  简体中文  |  Items with full text/Total items : 58229/91795 (63%)
Visitors : 13779237      Online Users : 51
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/118822

    Title: Incrementally Updating the Discovered High Average-Utility Patterns with the Pre-Large Concept
    Authors: Wu, Ming-Tai Jimmy;Teng, Qian;Lin, Chun-Wei Jerry;Cheng, Chien-Fu
    Keywords: Itemsets;Data mining;Heuristic algorithms;Maintenance engineering;Upper bound;STEM
    Date: 2020-03-23
    Issue Date: 2020-07-01 12:10:45 (UTC+8)
    Publisher: Institute of Electrical and Electronics Engineers
    Abstract: High average-utility itemset mining (HAUIM) is an extension of high-utility itemset mining (HUIM), which provides a reliable measure to reveal utility patterns by considering the length of the mined pattern. Some research has been conducted to improve the efficiency of mining by designing a variety of pruning strategies and effective frameworks, but few works have focused on the maintenance algorithms in the dynamic environment. Unfortunately, most existing works of HAUIM still have to rescan databases multiple times when it is necessary. In this paper, the pre-large concept is used to update the discovered HAUIs in the newly inserted transactions and reduce the time of the rescanning process. To further improve the performance of the developed algorithm, two new upper-bounds are also proposed to decrease the number of candidates for HAUIM. Experiments were performed to compare the previous Apriori-like method and the proposed APHAUP algorithm with the two new upper-bounds in terms of the number of maintenance patterns and runtime in several datasets. The experimental results show that the proposed APHAUP algorithm has excellent performance and good potential to be applied in real applications.
    Relation: IEEE Access 8, p. 66788-66798
    DOI: 10.1109/ACCESS.2020.2982415
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat

    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