Axiomatization of frequent itemsets
From MaRDI portal
Publication:1853610
DOI10.1016/S0304-3975(02)00081-6zbMath1019.68034OpenAlexW2068846066MaRDI QIDQ1853610
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00081-6
Related Items
Computational complexity of queries based on itemsets ⋮ The complexity of satisfying constraints on databases of transactions ⋮ An anytime deduction algorithm for the probabilistic logic and entailment problems ⋮ Itemset frequency satisfiability: complexity and axiomatization ⋮ Axiomatization of frequent itemsets
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic logic
- Probabilistic satisfiability
- Armstrong databases for functional and inclusion dependencies
- Anytime deduction for probabilistic logic
- Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
- A logic for reasoning about probabilities
- Axiomatization of frequent itemsets