Exact and approximate minimal pattern mining
From MaRDI portal
Recommendations
Cites work
- Advances in intelligent information systems
- Constraint-Based Mining and Inductive Databases
- Efficient algorithms for dualizing large-scale hypergraphs
- Generalized disjunction-free representation of frequent patterns with negation
- scientific article; zbMATH DE number 1696848 (Why is no real title available?)
- scientific article; zbMATH DE number 1931696 (Why is no real title available?)
- scientific article; zbMATH DE number 2096810 (Why is no real title available?)
Cited in
(6)- Sampling frequent and minimal Boolean patterns: theory and application in classification
- Sampling representation contexts with attribute exploration
- MineReduce: an approach based on data mining for problem size reduction
- Extracting Approximate Patterns
- Database Support for Data Mining Applications
- Common abductive explanations in first order logic
This page was built for publication: Exact and approximate minimal pattern mining
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5016645)