Journal Article10.1002/WIDM.31
Mining uncertain data
61
TL;DR: Recent algorithmic development on mining uncertain data in these probabilistic databases for frequent patterns from probabilism databases of uncertain data is reviewed.
read more
Abstract: As an important data mining and knowledge discovery task, association rule mining searches for implicit, previously unknown, and potentially useful pieces of information—in the form of rules revealing associative relationships—that are embedded in the data. In general, the association rule mining process comprises two key steps. The first key step, which mines frequent patterns (i.e., frequently occurring sets of items) from data, is more computationally intensive than the second key step of using the mined frequent patterns to form association rules. In the early days, many developed algorithms mined frequent patterns from traditional transaction databases of precise data such as shopping market basket data, in which the contents of databases are known. However, we are living in an uncertain world, in which uncertain data can be found almost everywhere. Hence, in recent years, researchers have paid more attention to frequent pattern mining from probabilistic databases of uncertain data. In this paper, we review recent algorithmic development on mining uncertain data in these probabilistic databases for frequent patterns. © 2011 John Wiley & Sons, Inc. WIREs Data Mining Knowl Discov 2011 1 316–329 DOI: 10.1002/widm.31
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Mining constrained frequent itemsets from distributed uncertain data
TL;DR: A data-intensive computer system for tree-based mining of frequent itemsets that satisfy user-defined constraints from a distributed environment such as a wireless sensor network of uncertain data is proposed.
89
Handling the impact of feature uncertainties on SVM: A robust approach based on Sobol sensitivity analysis
TL;DR: In this paper, a robust approach based on Sobol sensitivity analysis is proposed to improve the robustness of support vector machine (SVM) models to the impact of feature uncertainties.
43
Outlier detection on uncertain data based on local information
Jing Liu,Huifang Deng +1 more
TL;DR: Based on local information: local density and local uncertainty level, a new outlier detection algorithm is designed in this paper to calculate uncertain local outlier factor (ULOF) for each point in an uncertain dataset.
42
Mining frequent patterns from univariate uncertain data
Ying-Ho Liu
- 01 Jan 2012
TL;DR: The experimental results demonstrate that the U2P-Miner algorithm outperforms three widely used algorithms, namely, the modified Apriori, modified H-mine, and modified depth-first backtracking algorithms.
33
Privacy-Preserving Frequent Pattern Mining from Big Uncertain Data
Carson K. Leung,Calvin S. H. Hoi,Adam G. M. Pazdor,Bryan H. Wodi,Alfredo Cuzzocrea +4 more
- 01 Dec 2018
TL;DR: Results of the analytical and empirical evaluation show the effectiveness of the proposed item-centric algorithm in mining frequent patterns from big uncertain data in a privacy-preserving manner.
32
References
•Book
Data Mining: Concepts and Techniques
Jiawei Han,Micheline Kamber,Jian Pei +2 more
- 08 Sep 2000
TL;DR: This book presents dozens of algorithms and implementation examples, all in pseudo-code and suitable for use in real-world, large-scale data mining projects, and provides a comprehensive, practical look at the concepts and techniques you need to get the most out of real business data.
Mining association rules between sets of items in large databases
Rakesh Agrawal,Tomasz Imielinski,Arun N. Swami +2 more
- 01 Jun 1993
TL;DR: An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
•Proceedings Article
Fast Algorithms for Mining Association Rules in Large Databases
Rakesh Agrawal,Ramakrishnan Srikant +1 more
- 12 Sep 1994
TL;DR: Two new algorithms for solving thii problem that are fundamentally different from the known algorithms are presented and empirical evaluation shows that these algorithms outperform theknown algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems.
Mining frequent patterns without candidate generation
Jiawei Han,Jian Pei,Yiwen Yin +2 more
- 16 May 2000
TL;DR: This study proposes a novel frequent pattern tree (FP-tree) structure, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and develops an efficient FP-tree-based mining method, FP-growth, for mining the complete set of frequent patterns by pattern fragment growth.
Related Papers (5)
Jiawei Han,Jian Pei,Yiwen Yin +2 more
- 16 May 2000
Rakesh Agrawal,Ramakrishnan Srikant +1 more
- 01 Jul 1998
Rakesh Agrawal,Ramakrishnan Srikant +1 more
- 12 Sep 1994
Carson K. Leung,Boyu Hao +1 more
- 29 Mar 2009