Itemset frequency satisfiability: complexity and axiomatization
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 1696848 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1095142 (Why is no real title available?)
- scientific article; zbMATH DE number 1934545 (Why is no real title available?)
- scientific article; zbMATH DE number 2088083 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- A logic for reasoning about probabilities
- Anytime deduction for probabilistic logic
- Automatic derivation of probabilistic inference rules
- Axiomatization of frequent itemsets
- Computational complexity of queries based on itemsets
- Constraint-Based Mining and Inductive Databases
- Database Support for Data Mining Applications
- Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
- Privacy preserving data mining
- Probabilistic logic
- Probabilistic logic programming with conditional constraints
- Probabilistic satisfiability
- Safe projections of binary data sets
- The Uncertain Reasoner's Companion
Cited in
(8)- 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
- scientific article; zbMATH DE number 2080474 (Why is no real title available?)
- Mining top-\(k\) motifs with a SAT-based framework
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)