The complexity of satisfying constraints on databases of transactions

DOI10.1007/S00236-007-0060-1MaRDI QIDQ2464038zbMATH OpenOpenAlexFDO

Authors Toon Calders

Publication date 10 December 2007

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-007-0060-1

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Itemset frequency satisfiability: complexity and axiomatization
• Computational complexity of queries based on itemsets
• Knowledge Discovery in Inductive Databases
• The Parameterized Complexity of Enumerating Frequent Itemsets
• Finding All Minimal Infrequent Multi-dimensional Intervals

Cites work

• Anytime deduction for probabilistic logic
• Axiomatization of frequent itemsets
• Constraint-Based Mining and Inductive Databases
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1095142 (Why is no real title available?)
• scientific article; zbMATH DE number 1934545 (Why is no real title available?)
• scientific article; zbMATH DE number 2086380 (Why is no real title available?)
• Probabilistic logic
• Probabilistic logic programming with conditional constraints
• Recognizing Intersection Patterns

Cited in

(6)

• The Parameterized Complexity of Enumerating Frequent Itemsets
• Finding All Minimal Infrequent Multi-dimensional Intervals
• Mining top-\(k\) motifs with a SAT-based framework
• Knowledge Discovery in Inductive Databases
• Computational complexity of queries based on itemsets
• An anytime deduction algorithm for the probabilistic logic and entailment problems

This page was built for publication: The complexity of satisfying constraints on databases of transactions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464038)