Fast and memory efficient mining of high-utility itemsets from data streams: with and without negative item profits
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
522 | en_US |
dc.citation.issue |
3 | en_US |
dc.citation.spage |
495 | en_US |
dc.citation.volume |
28 | en_US |
dc.citation.woscount |
8 | |
dc.contributor.author |
Li, Hua-Fu | en_US |
dc.contributor.author |
Huang, Hsin-Yun | en_US |
dc.contributor.author |
Lee, Suh-Yin | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:27:37Z | |
dc.date.available |
2014-12-08T15:27:37Z | |
dc.date.issued |
2011-09-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1007/s10115-010-0330-z | en_US |
dc.identifier.issn |
0219-1377 | en_US |
dc.identifier.journal |
KNOWLEDGE AND INFORMATION SYSTEMS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1007/s10115-010-0330-z | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/19881 | |
dc.identifier.wosnumber |
WOS:000294229000002 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Data mining | en_US |
dc.subject |
Data streams | en_US |
dc.subject |
Utility mining | en_US |
dc.subject |
High-utility itemsets | en_US |
dc.subject |
Utility itemset with positive item profits | en_US |
dc.subject |
Utility itemset with negative item profits | en_US |
dc.title |
Fast and memory efficient mining of high-utility itemsets from data streams: with and without negative item profits | en_US |
dc.type |
Article | en_US |
檔案
- 000294229000002.pdf (3.24 MB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
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
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/19881