Model-independent bounding of the supports of Boolean formulae in binary data

DOI10.1007/978-3-540-44497-8_12MaRDI QIDQ5717472zbMATH OpenOpenAlexFDO

Authors Artur Bykowski, Jouni K. Seppänen, Jaakko Hollmén

Publication date 10 January 2006

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

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

Mathematics Subject Classification ID

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

Recommendations

• On models for quantified Boolean formulas
• Concentration inequalities for measures of a Boolean model
• Boolean Models and Simultaneous Inequalities
• Boole-Bonferroni Inequalities and Linear Programming
• Statistics of the Boolean model for practitioners and mathematicians
• Representations of mixed measures with applications to Boolean models
• Boolean functions as models for quantified Boolean formulas
• scientific article; zbMATH DE number 20667
• Optimal bounds for the approximation of Boolean functions and some applications

Cited in

(9)

• Sampling frequent and minimal Boolean patterns: theory and application in classification
• Axiomatization of frequent itemsets
• Measures on Boolean polynomials and their applications in data mining
• Grafting for combinatorial binary model using frequent itemset mining
• Safe projections of binary data sets
• Support approximations using Bonferroni-type inequalities
• Deducing bounds on the support of itemsets
• Constraint-Based Mining and Inductive Databases
• Computational complexity of queries based on itemsets

This page was built for publication: Model-independent bounding of the supports of Boolean formulae in binary data

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