Generalized disjunction-free representation of frequent patterns with negation
From MaRDI portal
Recommendations
- On concise representations of frequent patterns admitting negation
- Concise representation of frequent patterns based on generalized disjunction-free generators
- Why to apply generalized disjunction-free generators representation of frequent patterns?
- Mining concise representations of frequent multidimensional patterns
- Closed set based discovery of representative association rules
Cites work
Cited in
(10)- Sampling frequent and minimal Boolean patterns: theory and application in classification
- Generalization of association rules through disjunction
- Why to apply generalized disjunction-free generators representation of frequent patterns?
- Meta itemset: a new concise representation of frequent itemset
- Bounding negative information in frequent sets algorithms
- Inferring knowledge from frequent patterns
- Concise representation of frequent patterns based on generalized disjunction-free generators
- Exact and approximate minimal pattern mining
- On concise representations of frequent patterns admitting negation
- Mining concise representations of frequent multidimensional patterns
This page was built for publication: Generalized disjunction-free representation of frequent patterns with negation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696522)