136 search results - page 1 / 28 » Boolean Formulas and Frequent Sets |
CINQ
2004
Springer
14 years 4 months ago
2004
Springer
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
CINQ
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
BIRTHDAY
2004
Springer
14 years 2 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
WLP
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
IJKDB
2010
13 years 8 months ago
2010
Regulatory network analysis and other bioinformatics tasks require the ability to induce and represent arbitrary boolean expressions from data sources. We introduce a novel framew...