Efficiently mining uncertain high-utility itemsets

doi:10.1007/s00500-016-2159-1

Return

Efficiently mining uncertain high-utility itemsets

2016-05-02

PRE

Jerry Chun‐Wei Lin *

Wensheng Gan

Philippe Fournier‐Viger

Tzung‐Pei Hong

Vincent S. Tseng

DOI：10.1007/s00500-016-2159-1

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Large-scale dataset

Data mining

Uncertainty

High-utility itemset

Pruning strategies

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.