Itemset frequency satisfiability: complexity and axiomatization

DOI10.1016/J.TCS.2007.11.003MaRDI QIDQ2481978zbMATH OpenOpenAlexFDO

Authors Toon Calders

Publication date 15 April 2008

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://repository.uantwerpen.be/docman/irua/69720c/5632.pdf

zbMATH Keywords

data miningcomplexityfrequent itemset

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15)

Recommendations

• Axiomatization of frequent itemsets
• The Parameterized Complexity of Enumerating Frequent Itemsets
• scientific article; zbMATH DE number 2080474
• Database Support for Data Mining Applications
• scientific article; zbMATH DE number 2086380
• Computational complexity of queries based on itemsets
• A complexity dichotomy for poset constraint satisfaction
• A complexity dichotomy for poset constraint satisfaction
• On complexity of the satisfiability problem of systems over finite posets
• Complexity of generalized satisfiability counting problems

Cites work

• scientific article; zbMATH DE number 1696848 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (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 2088083 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• A logic for reasoning about probabilities
• Anytime deduction for probabilistic logic
• Automatic derivation of probabilistic inference rules
• Axiomatization of frequent itemsets
• Computational complexity of queries based on itemsets
• Constraint-Based Mining and Inductive Databases
• Database Support for Data Mining Applications
• Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
• Privacy preserving data mining
• Probabilistic logic
• Probabilistic logic programming with conditional constraints
• Probabilistic satisfiability
• Safe projections of binary data sets
• The Uncertain Reasoner's Companion

Cited in

(8)

• Axiomatization of frequent itemsets
• Computational complexity of queries based on itemsets
• The complexity of satisfying constraints on databases of transactions
• Finding All Minimal Infrequent Multi-dimensional Intervals
• Maximum entropy models and subjective interestingness: an application to tiles in binary databases
• The Parameterized Complexity of Enumerating Frequent Itemsets
• scientific article; zbMATH DE number 2080474 (Why is no real title available?)
• Mining top-\(k\) motifs with a SAT-based framework

This page was built for publication: Itemset frequency satisfiability: complexity and axiomatization

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