Mining Minimal High-Utility Itemsets

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2016

期刊名稱

DATABASE AND EXPERT SYSTEMS APPLICATIONS, DEXA 2016, PT I

卷期與頁次

第 9827 卷,頁 88–101

ISSN

0302-9743

ISBN

978-3-319-44403-1
978-3-319-44402-4

語言

英文

摘要

Mining high-utility itemsets (HUIs) is a key data mining task. It consists of discovering groups of items that yield a high profit in transaction databases. A major drawback of traditional high-utility itemset mining algorithms is that they can return a large number of HUIs. Analyzing a large result set can be very time-consuming for users. To address this issue, concise representations of high-utility itemsets have been proposed such as closed HUIs, maximal HUIs and generators of HUIs. In this paper, we explore a novel representation called the minimal high utility itemsets (MinHUIs), defined as the smallest sets of items that generate a high profit, study its properties, and design an efficient algorithm named MinFHM to discover it. An extensive experimental study with real-life datasets shows that mining MinHUIs can be much faster than mining other concise representations or all HUIs, and that it can greatly reduce the size of the result set presented to the user.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Fournier-Viger, P., Lin, J. C.-W., Wu, C.-W., Tseng, V. S., & Faghihi, U. (2016). Mining Minimal High-Utility Itemsets. DATABASE AND EXPERT SYSTEMS APPLICATIONS, DEXA 2016, PT I, 9827, 88–101. https://doi.org/10.1007/978-3-319-44403-1_6

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/136436