Itemset frequency satisfiability: complexity and axiomatization
DOI10.1016/J.TCS.2007.11.003zbMATH Open1136.68021OpenAlexW2026797055MaRDI QIDQ2481978FDOQ2481978
Authors: Toon Calders 
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
Recommendations
- Axiomatization of frequent itemsets
- The Parameterized Complexity of Enumerating Frequent Itemsets
- scientific article; zbMATH DE number 2080474
- Database Support for Data Mining Applications
- scientific article; zbMATH DE number 2086380
- Computational complexity of queries based on itemsets
- A complexity dichotomy for poset constraint satisfaction
- A complexity dichotomy for poset constraint satisfaction
- On complexity of the satisfiability problem of systems over finite posets
- Complexity of generalized satisfiability counting problems
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic logic
- The Uncertain Reasoner's Companion
- A logic for reasoning about probabilities
- Title not available (Why is that?)
- Anytime deduction for probabilistic logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Privacy preserving data mining
- Probabilistic logic programming with conditional constraints
- Axiomatization of frequent itemsets
- Database Support for Data Mining Applications
- Constraint-Based Mining and Inductive Databases
- Probabilistic satisfiability
- Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
- Automatic derivation of probabilistic inference rules
- Computational complexity of queries based on itemsets
- Safe projections of binary data sets
- Title not available (Why is that?)
Cited In (7)
- Axiomatization of frequent itemsets
- Computational complexity of queries based on itemsets
- The complexity of satisfying constraints on databases of transactions
- Finding All Minimal Infrequent Multi-dimensional Intervals
- Maximum entropy models and subjective interestingness: an application to tiles in binary databases
- The Parameterized Complexity of Enumerating Frequent Itemsets
- Title not available (Why is that?)
This page was built for publication: Itemset frequency satisfiability: complexity and axiomatization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481978)
