Incrementally Updating the Discovered High Average-Utility Patterns with the Pre-Large Concept
學年 108
學期 2
出版（發表）日期 2020-03-23
作品名稱 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
單位
出版者
著錄名稱、卷期、頁數 IEEE Access 8, p. 66788-66798
摘要 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.
關鍵字 Itemsets;Data mining;Heuristic algorithms;Maintenance engineering;Upper bound;STEM
語言 en_US
ISSN 2169-3536
期刊性質 國外
收錄於 SCI
產學合作
通訊作者
審稿制度 否
國別 USA
公開徵稿
出版型式 ,電子版
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/118822 )