Itemset frequency satisfiability: complexity and axiomatization
From MaRDI portal
Publication:2481978
DOI10.1016/j.tcs.2007.11.003zbMath1136.68021MaRDI QIDQ2481978
Publication date: 15 April 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://repository.uantwerpen.be/docman/irua/69720c/5632.pdf
68Q25: Analysis of algorithms and problem complexity
68P15: Database theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Maximum entropy models and subjective interestingness: an application to tiles in binary databases, Computational complexity of queries based on itemsets
Cites Work
- Computational complexity of queries based on itemsets
- Probabilistic logic
- Probabilistic satisfiability
- 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
- Safe projections of binary data sets
- Probabilistic logic programming with conditional constraints
- The Uncertain Reasoner's Companion
- Database Support for Data Mining Applications
- Constraint-Based Mining and Inductive Databases
- Privacy preserving data mining
- Automatic derivation of probabilistic inference rules
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
