Incrementally Updating the Discovered High Average-Utility Patterns with the Pre-Large Concept

doi:10.1109/ACCESS.2020.2982415

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/118822

請使用永久網址來引用或連結此文件: 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.html		0Kb	HTML	89	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....