Computational Complexity of Itemset Frequency Satisfiability
Summary: FREQSAT: given interval constraints on itemset frequencies, decide existence of a transaction database realizing them; FREQSAT ≡ Probabilistic SAT and NP‑complete. Frequencies not finitely axiomatizable; conditional frequencies/confidence expressible; bounded-duplication variants are PP‑hard, with consequences for mining and privacy. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Toon Calders
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,542 | Differential Constraints | 2005 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 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.0010863639 |
| 40 | Privacy-Preserving Data Mining | 2000 | SIGMOD | 0.00074213516 |
| 829 | Efficiently Mining Long Patterns from Databases | 1998 | SIGMOD | 0.00016137512 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,698 | Mining Frequent Itemsets Using Support Constraints | 2000 | VLDB | 4.1905499e-05 |
| 4,805 | Optimization of Constrained Frequent Set Queries with 2-variable Constraints | 1999 | SIGMOD | 5.9050441e-05 |
| 168 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.0003915627 |
| 7,633 | Mining Frequent Itemsets over Uncertain Databases | 2012 | VLDB | 4.6869557e-05 |
| 7,503 | Space Lower Bounds for Itemset Frequency Sketches | 2016 | PODS | 4.7135369e-05 |
| 1,566 | PrivBasis: Frequent Itemset Mining with Differential Privacy | 2012 | VLDB | 0.00011324162 |
| 2,688 | On Differentially Private Frequent Itemset Mining | 2013 | VLDB | 8.3012815e-05 |
| 4,451 | False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams | 2004 | VLDB | 6.172063e-05 |
| 5,041 | The Complexity of Mining Maximal Frequent Subgraphs | 2013 | PODS | 5.7356447e-05 |
| 9,062 | Feasible Itemset Distributions in Data Mining: Theory and Application | 2003 | PODS | 4.3997447e-05 |