On concise representations of frequent patterns admitting negation
From MaRDI portal
Recommendations
- Generalized disjunction-free representation of frequent patterns with negation
- Concise representation of frequent patterns based on generalized disjunction-free generators
- Mining concise representations of frequent multidimensional patterns
- Why to apply generalized disjunction-free generators representation of frequent patterns?
- Bounding negative information in frequent sets algorithms
Cited in
(9)- Generalization of association rules through disjunction
- Why to apply generalized disjunction-free generators representation of frequent patterns?
- The role of semantics in mining frequent patterns from knowledge bases in description logics with rules
- Mining all non-derivable frequent itemsets
- Bounding negative information in frequent sets algorithms
- Concise representation of frequent patterns based on generalized disjunction-free generators
- Generalized disjunction-free representation of frequent patterns with negation
- Constraint-Based Mining and Inductive Databases
- Mining concise representations of frequent multidimensional patterns
This page was built for publication: On concise representations of frequent patterns admitting negation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305728)