A Framework for Synthesizing Arbitrary Boolean Expressions Induced by Frequent Itemsets
Explore this paper's citation graph
Summary
This chapter introduced the concept of generator of an itemset, and showed that every Boolean function can be synthesized by its generator, and discussed a simple and elegant framework for synthesizing generator of a itemset and designed an algorithm for this purpose.
- Type
- article
- Published
- 2007-01-01
- Cited by
- 10
- References
- 15
- OpenAlex
- https://openalex.org/W5463723
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:5541361
Keywords
Computer science, Boolean function, Boolean expression, Theoretical computer science, Boolean circuit
References
- Fast Algorithms for Mining Association Rules in Large Databases
- Privacy Aware Market Basket Data Set Generation: A Feasible Approach for Inverse Frequent Set Mining
- Hierarchical Classification of Real Life Documents
- An Efficient Algorithm for Mining Association Rules in Large Databases
- Probabilistic Models for Query Approximation with Large Sparse Binary Data Sets
- Efficient mining of both positive and negative association rules
- BLOSOM: a framework for mining arbitrary boolean expressions
- Mining frequent patterns without candidate generation
- Database classification for multi-database mining
- Mining association rules between sets of items in large databases
- Ones and zeros
- An Introduction to Probability Theory and Its Applications
- Closed Non-derivable Itemsets
- Extracting Minimal and Closed Monotone DNF Formulas
Cited by
- The comparison of several classification algorithms and case analysis
- Research on improving Apriori algorithm based on interested table
- Mining conditional patterns in a database
- A Study of Improving Apriori Algorithm
- iGain - Apriori: An interest gain based rule assessment for Association Rule Mining
- Chapter 2 Synthesizing Conditional Patterns in a Database
- Mining Calendar-Based Periodic Patterns in Time-Stamped Data
- Synthesizing Conditional Patterns in a Database
- Identifying Calendar-Based Periodic Patterns
- Measuring Influence of an Item in Time-Stamped Databases
Related papers
- Mining association rules between sets of items in large databases
- Fast Algorithms for Mining Association Rules in Large Databases
- Fast Algorithms for Mining Association Rules
- Privacy Aware Market Basket Data Set Generation: A Feasible Approach for Inverse Frequent Set Mining
- A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions
- Using Frequent Closed Itemsets for Data Dimensionality Reduction
- On the Parallel Evaluation of Boolean Expressions
- Generating Optimal Plans for Boolean Expressions
- Sequential Evaluation of Boolean Functions
- The Unison algorithm: fast evaluation of Boolean expressions