Efficient Mining of Uncertain Data for High-Utility Itemsets

檔案

本條目沒有附加檔案。

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

日期

2016

期刊名稱

WEB-AGE INFORMATION MANAGEMENT, PT I

卷期與頁次

第 9658 卷,頁 17–30

ISSN

0302-9743

ISBN

978-3-319-39937-9
978-3-319-39936-2

語言

英文

摘要

High-utility itemset mining (HUIM) is emerging as an important research topic in data mining. Most algorithms for HUIM can only handle precise data, however, uncertainty that are embedded in big data which collected from experimental measurements or noisy sensors in real-life applications. In this paper, an efficient algorithm, namely Mining Uncertain data for High-Utility Itemsets (MUHUI), is proposed to efficiently discover potential high-utility itemsets (PHUIs) from uncertain data. Based on the probability-utility-list (PU-list) structure, the MUHUI algorithm directly mine PHUIs without candidate generation and can reduce the construction of PU-lists for numerous unpromising itemsets by using several efficient pruning strategies, thus greatly improving the mining performance. Extensive experiments both on real-life and synthetic datasets proved that the proposed algorithm significantly outperforms the state-of-the-art PHUI-List algorithm in terms of efficiency and scalability, especially, the MUHUI algorithm scales well on large-scale uncertain datasets for mining PHUIs.

所屬典藏

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

引用此條目

Lin, J. C.-W., Gan, W., Fournier-Viger, P., Hong, T.-P., & Tseng, V. S. (2016). Efficient Mining of Uncertain Data for High-Utility Itemsets. WEB-AGE INFORMATION MANAGEMENT, PT I, 9658, 17–30. https://doi.org/10.1007/978-3-319-39937-9_2

BibTeX RIS

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

分享

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