Computational complexity of queries based on itemsets
From MaRDI portal
Publication:844194
DOI10.1016/j.ipl.2006.02.003zbMath1187.68255arXiv1902.00633MaRDI QIDQ844194
Publication date: 18 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.00633
68P15: Database theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Comparing apples and oranges: measuring differences between exploratory data mining results, Itemset frequency satisfiability: complexity and axiomatization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic satisfiability
- I-divergence geometry of probability distributions and minimization problems
- Axiomatization of frequent itemsets
- Itemset frequency satisfiability: complexity and axiomatization
- The computational complexity of probabilistic inference using Bayesian belief networks
- Probabilistic logic programming with conditional constraints
- Best Possible Inequalities for the Probability of a Logical Function of Events
- Database Support for Data Mining Applications