Efficient Algorithms for Mining Top-K High Utility Itemsets

檔案

本條目沒有附加檔案。

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

日期

2016-01-01

類型

期刊名稱

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING

卷期與頁次

第 28 卷,頁 54–67

ISSN

1041-4347

語言

英文

摘要

High utility itemsets (HUIs) mining is an emerging topic in data mining, which refers to discovering all itemsets having a utility meeting a user-specified minimum utility threshold min_util. However, setting min_util appropriately is a difficult problem for users. Generally speaking, finding an appropriate minimum utility threshold by trial and error is a tedious process for users. If min_util is set too low, too many HUIs will be generated, which may cause the mining process to be very inefficient. On the other hand, if min_util is set too high, it is likely that no HUIs will be found. In this paper, we address the above issues by proposing a new framework for top-k high utility itemset mining, where k is the desired number of HUIs to be mined. Two types of efficient algorithms named TKU (mining Top-K Utility itemsets) and TKO (mining Top-K utility itemsets in One phase) are proposed for mining such itemsets without the need to set min_util. We provide a structural comparison of the two algorithms with discussions on their advantages and limitations. Empirical evaluations on both real and synthetic datasets show that the performance of the proposed algorithms is close to that of the optimal case of state-of-the-art utility mining algorithms.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Tseng, V. S., Wu, C.-W., Fournier-Viger, P., & Yu, P. S. (2016). Efficient Algorithms for Mining Top-K High Utility Itemsets. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 28, 54–67. https://doi.org/10.1109/TKDE.2015.2458860

BibTeX RIS

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

分享

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