Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Principles of database query processing for advanced applications
Principles of database query processing for advanced applications
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Can we push more constraints into frequent pattern mining?
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Query Processing for Advanced Database Systems
Query Processing for Advanced Database Systems
Query Processing in Database Systems
Query Processing in Database Systems
Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Materialized Data Mining Views
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Incremental Refinement of Mining Queries
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
Optimization of a language for data mining
Proceedings of the 2003 ACM symposium on Applied computing
Efficient mining of both positive and negative association rules
ACM Transactions on Information Systems (TOIS)
Database classification for multi-database mining
Information Systems
Mining positive and negative association rules: an approach for confined rules
PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
BLOSOM: a framework for mining arbitrary boolean expressions
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
Efficient clustering of databases induced by local patterns
Decision Support Systems
Mining conditional patterns in a database
Pattern Recognition Letters
Probabilistic models for query approximation with large sparse binary data sets
UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Pushing tougher constraints in frequent pattern mining
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
| Hi-index | 0.00 |
Frequent itemsets determine the major characteristics of a transactional database. It is important to mine arbitrary Boolean queries induced by frequent itemsets. In this paper, the author proposes a simple and elegant framework for synthesizing arbitrary Boolean queries using conditional patterns in a database. Both real and synthetic databases were used to evaluate the experimental results. The author presents an algorithm for mining a set of specific itemsets in a database and a model of synthesizing a query in a database. Finally, the author discusses an application of the proposed framework for reducing query processing time.