A New Algorithm for High Average-utility Itemset Mining | ||
| Journal of AI and Data Mining | ||
| مقاله 5، دوره 7، شماره 4، بهمن 2019، صفحه 537-550 اصل مقاله (1.79 M) | ||
| نوع مقاله: Original/Review Paper | ||
| شناسه دیجیتال (DOI): 10.22044/jadm.2019.7483.1893 | ||
| نویسندگان | ||
| A. Soltani* 1؛ M. Soltani2 | ||
| 1Dept. of Computer Engineering, University of Bojnord, Bojnord, Iran. | ||
| 2Dept. of Computer Engineering, Quchan University of Technology, Quchan, Iran. | ||
| چکیده | ||
| High utility itemset mining (HUIM) is a new emerging field in data mining which has gained growing interest due to its various applications. The goal of this problem is to discover all itemsets whose utility exceeds minimum threshold. The basic HUIM problem does not consider length of itemsets in its utility measurement and utility values tend to become higher for itemsets containing more items. Hence, HUIM algorithms discover a huge enormous number of long patterns. High average-utility itemset mining (HAUIM) is a variation of HUIM that selects patterns by considering both their utilities and lengths. In the last decades, several algorithms have been introduced to mine high average-utility itemsets. To speed up the HAUIM process, here a new algorithm is proposed which uses a new list structure and pruning strategy. Several experiments performed on real and synthetic datasets show that the proposed algorithm outperforms the state-of-the-art HAUIM algorithms in terms of runtime and memory consumption. | ||
| کلیدواژهها | ||
| Data Mining؛ Frequent Pattern؛ Utility؛ High Average-Utility itemset | ||
|
آمار تعداد مشاهده مقاله: 839 تعداد دریافت فایل اصل مقاله: 664 |
||