Pages that link to "Item:Q1853610"
From MaRDI portal
The following pages link to Axiomatization of frequent itemsets (Q1853610):
Displaying 9 items.
- Expressive generalized itemsets (Q506732) (← links)
- Computational complexity of queries based on itemsets (Q844194) (← links)
- An anytime deduction algorithm for the probabilistic logic and entailment problems (Q962834) (← links)
- Axiomatization of frequent itemsets (Q1853610) (← links)
- The complexity of satisfying constraints on databases of transactions (Q2464038) (← links)
- Itemset frequency satisfiability: complexity and axiomatization (Q2481978) (← links)
- Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts (Q2510478) (← links)
- Database Support for Data Mining Applications (Q5717470) (← links)
- Knowledge Discovery in Inductive Databases (Q5899030) (← links)