Partition-Based approach to processing batches of frequent itemset queries

Authors:
Przemyslaw Grudzinski;Marek Wojciechowski;Maciej Zakrzewicz
Affiliations:
Institute of Computing Science, Poznan University of Technology, Poznan, Poland;Institute of Computing Science, Poznan University of Technology, Poznan, Poland;Institute of Computing Science, Poznan University of Technology, Poznan, Poland
Venue:
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Year:
2006

Citing 17
Cited 0

Multiple-query optimization

ACM Transactions on Database Systems (TODS)
Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
A database perspective on knowledge discovery

Communications of the ACM
Using a knowledge cache for interactive discovery of association rules

KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient and extensible algorithms for multi query optimization

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Analysis of Common Subexpression Exploitation Models in Multiple-Query Processing

Proceedings of the Tenth International Conference on Data Engineering
Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Materialized Data Mining Views

PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Using Condensed Representations for Interactive Association Rule Mining

PKDD '02 Proceedings of the 6th 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
Improving the efficiency of inductive logic programming through the use of query packs

Journal of Artificial Intelligence Research
On multiple query optimization in data mining

PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of optimizing processing of batches of frequent itemset queries. The problem is a particular case of multiple-query optimization, where the goal is to minimize the total execution time of the set of queries. We propose an algorithm that is a combination of the Mine Merge method, previously proposed for processing of batches of frequent itemset queries, and the Partition algorithm for memory-based frequent itemset mining. The experiments show that the novel approach outperforms the original Mine Merge and sequential processing in majority of cases.