Fast and memory efficient mining of high-utility itemsets from data streams: with and without negative item profits

檔案

日期

2011-09-01

類型

期刊名稱

KNOWLEDGE AND INFORMATION SYSTEMS

卷期與頁次

第 28 卷第 3 期,頁 495–522

ISSN

0219-1377

語言

英文

摘要

Mining utility itemsets from data steams is one of the most interesting research issues in data mining and knowledge discovery. In this paper, two efficient sliding window-based algorithms, MHUI-BIT (Mining High-Utility Itemsets based on BITvector) and MHUI-TID (Mining High-Utility Itemsets based on TIDlist), are proposed for mining high-utility itemsets from data streams. Based on the sliding window-based framework of the proposed approaches, two effective representations of item information, Bitvector and TIDlist, and a lexicographical tree-based summary data structure, LexTree-2HTU, are developed to improve the efficiency of discovering high-utility itemsets with positive profits from data streams. Experimental results show that the proposed algorithms outperform than the existing approaches for discovering high-utility itemsets from data streams over sliding windows. Beside, we also propose the adapted approaches of algorithms MHUI-BIT and MHUI-TID in order to handle the case when we are interested in mining utility itemsets with negative item profits. Experiments show that the variants of algorithms MHUI-BIT and MHUI-TID are efficient approaches for mining high-utility itemsets with negative item profits over stream transaction-sensitive sliding windows.

所屬典藏

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

引用此條目

Li, H.-F., Huang, H.-Y., & Lee, S.-Y. (2011). Fast and memory efficient mining of high-utility itemsets from data streams: with and without negative item profits. KNOWLEDGE AND INFORMATION SYSTEMS, 28(3), 495–522. https://doi.org/10.1007/s10115-010-0330-z

BibTeX RIS

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

分享

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