Constraint-Based Mining and Inductive Databases

DOI10.1007/11615576zbMath1172.68446OpenAlexW2494633533MaRDI QIDQ5897700

Christophe Rigotti, Toon Calders, Jean-François Boulicaut

Publication date: 13 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11615576

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (10)

Closed and noise-tolerant patterns in \(n\)-ary relations ⋮ The complexity of satisfying constraints on databases of transactions ⋮ Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems ⋮ A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes ⋮ Itemset frequency satisfiability: complexity and axiomatization ⋮ Actionability and Formal Concepts: A Data Mining Perspective ⋮ Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions ⋮ Parallel algorithms for enumerating closed patterns from multi-relational data ⋮ ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns ⋮ Exact and Approximate Minimal Pattern Mining

This page was built for publication: Constraint-Based Mining and Inductive Databases