Pages that link to "Item:Q5897700"
From MaRDI portal
The following pages link to Constraint-Based Mining and Inductive Databases (Q5897700):
Displaying 10 items.
- Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems (Q511763) (← links)
- Parallel algorithms for enumerating closed patterns from multi-relational data (Q1800394) (← links)
- A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes (Q2248536) (← links)
- Closed and noise-tolerant patterns in \(n\)-ary relations (Q2377278) (← links)
- The complexity of satisfying constraints on databases of transactions (Q2464038) (← links)
- Itemset frequency satisfiability: complexity and axiomatization (Q2481978) (← links)
- ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns (Q4969622) (← links)
- Exact and Approximate Minimal Pattern Mining (Q5016645) (← links)
- Actionability and Formal Concepts: A Data Mining Perspective (Q5445320) (← links)
- Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions (Q5452415) (← links)