Mining Frequent Itemsets over Uncertain Databases
Summary: Uncertain databases: itemset support is a random variable; two frequent-itemset definitions (expected vs probabilistic). The paper shows a tight connection and unification for large data, and provides eight algorithms with fair cross-definition comparisons. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yongxin Tong (Hong Kong University of Science and Technology)
- 2. Lei Chen (Hong Kong University of Science and Technology)
- 3. Yurong Cheng (Northeastern University)
- 4. Philip S. Yu (University of Illinois Chicago)
BibTeX Citation
@article{tong_vldb12,
title = {{Mining Frequent Itemsets over Uncertain Databases}},
author = {Tong, Yongxin and Chen, Lei and Cheng, Yurong and Yu, Philip S.},
journal = {PVLDB},
series = {{VLDB} '12},
volume = {5},
number = {11},
pages = {1650--1661},
doi = {10.14778/2350229.2350277},
url = {https://doi.org/10.14778/2350229.2350277},
year = {2012}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,539 | Reducing Uncertainty of Schema Matching via Crowdsourcing | 2013 | VLDB | 6.6403822e-05 |
| 8,019 | Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks | 2024 | VLDB | 5.5062157e-05 |
| 12,150 | Beyond Itemsets: Mining Frequent Featuresets over Structured Items | 2015 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13 | Mining Association Rules between Sets of Items in Large Databases | 1993 | SIGMOD | 0.0006567919 |
| 161 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00027981772 |
| 221 | Robust and Fast Similarity Search for Moving Object Trajectories | 2005 | SIGMOD | 0.00024224879 |
| 303 | On The Marriage of Lp-norms and Edit Distance | 2004 | VLDB | 0.00021956234 |
| 6,120 | Finding Frequent Items in Probabilistic Data | 2008 | SIGMOD | 5.9693818e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,363 | Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach | 2008 | SIGMOD |
| 2 | 4,683 | False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams | 2004 | VLDB |
| 3 | 2,253 | Approximation Algorithms for Clustering Uncertain Data | 2008 | PODS |
| 4 | 2,366 | On Differentially Private Frequent Itemset Mining | 2013 | VLDB |
| 5 | 7,926 | Space Lower Bounds for Itemset Frequency Sketches | 2016 | PODS |
| 6 | 12,882 | Mining Frequent Itemsets Using Support Constraints | 2000 | VLDB |
| 7 | 8,355 | Similarity Search and Mining in Uncertain Databases | 2010 | VLDB |
| 8 | 9,212 | Feasible Itemset Distributions in Data Mining: Theory and Application | 2003 | PODS |
| 9 | 12,150 | Beyond Itemsets: Mining Frequent Featuresets over Structured Items | 2015 | VLDB |
| 10 | 6,120 | Finding Frequent Items in Probabilistic Data | 2008 | SIGMOD |