Itemset frequency satisfiability: complexity and axiomatization

DOI10.1016/J.TCS.2007.11.003zbMATH Open1136.68021OpenAlexW2026797055MaRDI QIDQ2481978FDOQ2481978

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic logic
• The Uncertain Reasoner's Companion
• A logic for reasoning about probabilities
• Anytime deduction for probabilistic logic
• Privacy preserving data mining
• Probabilistic logic programming with conditional constraints
• Axiomatization of frequent itemsets
• Database Support for Data Mining Applications
• Constraint-Based Mining and Inductive Databases
• Probabilistic satisfiability
• Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
• Automatic derivation of probabilistic inference rules
• Computational complexity of queries based on itemsets
• Safe projections of binary data sets

Cited In (3)

• Axiomatization of frequent itemsets
• Computational complexity of queries based on itemsets
• Maximum entropy models and subjective interestingness: an application to tiles in binary databases

   Recommendations

• Axiomatization of frequent itemsets 👍 👎
• The Parameterized Complexity of Enumerating Frequent Itemsets 👍 👎
• Title not available (Why is that?) 👍 👎
• Database Support for Data Mining Applications 👍 👎
• Title not available (Why is that?) 👍 👎
• Computational complexity of queries based on itemsets 👍 👎
• Title not available (Why is that?) 👍 👎
• A complexity dichotomy for poset constraint satisfaction 👍 👎
• ON COMPLEXITY OF THE SATISFIABILITY PROBLEM OF SYSTEMS OVER FINITE POSETS 👍 👎
• Complexity of generalized satisfiability counting problems 👍 👎

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)