Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems
From MaRDI portal
Publication:511763
Recommendations
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 2241899 (Why is no real title available?)
- A SAT-based approach for discovering frequent, closed and maximal patterns in a sequence
- Closed sets for labeled data
- Computing dominances in \(E^ n\)
- Computing skypattern cubes
- Constraint solving in uncertain and dynamic environments: A survey
- Constraint-Based Mining and Inductive Databases
- Discovery Science
- Handbook of constraint programming.
- Itemset mining: a constraint programming perspective
- Mining (soft-) skypatterns using dynamic CSP
- On Finding the Maxima of a Set of Vectors
- On the Average Number of Maxima in a Set of Vectors and Applications
- Supervised descriptive rule discovery: a unifying survey of contrast set, emerging pattern and subgroup mining
Cited in
(6)
This page was built for publication: Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511763)