Efficiently mining uncertain high-utility itemsets
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
2820 | en_US |
dc.citation.spage |
2801 | en_US |
dc.citation.volume |
21 | en_US |
dc.contributor.author |
Lin, Jerry Chun-Wei | en_US |
dc.contributor.author |
Gan, Wensheng | en_US |
dc.contributor.author |
Fournier-Viger, Philippe | en_US |
dc.contributor.author |
Hong, Tzung-Pei | en_US |
dc.contributor.author |
Tseng, Vincent S. | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2018-08-21T05:54:03Z | |
dc.date.available |
2018-08-21T05:54:03Z | |
dc.date.issued |
2017-06-01 | en_US |
dc.description.abstract |
Data mining consists of deriving implicit, potentially meaningful and useful knowledge from databases such as information about the most profitable items. High-utility itemset mining (HUIM) has thus emerged as an important research topic in data mining. But most HUIM algorithms can only handle precise data, although big data collected in real-life applications using experimental measurements or noisy sensors is often uncertain. In this paper, an efficient algorithm, named Mining Uncertain High-Utility Itemsets (MUHUI), is proposed to efficiently discover potential high-utility itemsets (PHUIs) in uncertain data. Based on the probability-utility-list (PU-list) structure, the MUHUI algorithm directly mines PHUIs without generating candidates, and can avoid constructing PU-lists for numerous unpromising itemsets by applying several efficient pruning strategies, which greatly improve its performance. Extensive experiments conducted on both real-life and synthetic datasets show that the proposed algorithm significantly outperforms the state-of-the-art PHUI-List algorithm in terms of efficiency and scalability, and that the proposed MUHUI algorithm scales well when mining PHUIs in large-scale uncertain datasets. | en_US |
dc.identifier.doi |
10.1007/s00500-016-2159-1 | en_US |
dc.identifier.issn |
1432-7643 | en_US |
dc.identifier.journal |
SOFT COMPUTING | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1007/s00500-016-2159-1 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/145533 | |
dc.identifier.wosnumber |
WOS:000401696600002 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
Large-scale dataset | en_US |
dc.subject |
Data mining | en_US |
dc.subject |
Uncertainty | en_US |
dc.subject |
High-utility itemset | en_US |
dc.subject |
Pruning strategies | en_US |
dc.title |
Efficiently mining uncertain high-utility itemsets | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
Lin, J. C.-W., Gan, W., Fournier-Viger, P., Hong, T.-P., & Tseng, V. S. (2017). Efficiently mining uncertain high-utility itemsets. SOFT COMPUTING, 21, 2801–2820. https://doi.org/10.1007/s00500-016-2159-1
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/145533