淡江大學機構典藏:Item 987654321/118822
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 64187/96966 (66%)
造访人次 : 11335694      在线人数 : 165
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/118822


    题名: Incrementally Updating the Discovered High Average-Utility Patterns with the Pre-Large Concept
    作者: Wu, Ming-Tai Jimmy;Teng, Qian;Lin, Chun-Wei Jerry;Cheng, Chien-Fu
    关键词: Itemsets;Data mining;Heuristic algorithms;Maintenance engineering;Upper bound;STEM
    日期: 2020-03-23
    上传时间: 2020-07-01 12:10:45 (UTC+8)
    出版者: Institute of Electrical and Electronics Engineers
    摘要: 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.
    關聯: IEEE Access 8, p. 66788-66798
    DOI: 10.1109/ACCESS.2020.2982415
    显示于类别:[資訊工程學系暨研究所] 期刊論文

    文件中的档案:

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

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

    TAIR相关文章

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