Axiomatization of frequent itemsets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3167494 (Why is no real title available?)
- scientific article; zbMATH DE number 2080474 (Why is no real title available?)
- A logic for reasoning about probabilities
- Anytime deduction for probabilistic logic
- Armstrong databases for functional and inclusion dependencies
- Axiomatization of frequent itemsets
- Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
- Probabilistic logic
- Probabilistic satisfiability
Cited in
(11)- Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts
- An anytime deduction algorithm for the probabilistic logic and entailment problems
- Axiomatization of frequent itemsets
- Computational complexity of queries based on itemsets
- The complexity of satisfying constraints on databases of transactions
- Knowledge Discovery in Inductive Databases
- What to expect from a set of itemsets?
- Itemset frequency satisfiability: complexity and axiomatization
- scientific article; zbMATH DE number 2080474 (Why is no real title available?)
- Expressive generalized itemsets
- Database Support for Data Mining Applications
This page was built for publication: Axiomatization of frequent itemsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853610)
