Metaqueries: semantics, complexity, and efficient algorithms

Authors:
Rachel Ben-Eliyahu-Zohary;Ehud Gudes;Giovambattista Ianni
Affiliations:
Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel;DEIS, Universitàt della Calabria, 87036 Rende (CS), Italy
Venue:
Artificial Intelligence
Year:
2003

Citing 14
Cited 3

Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition

Artificial Intelligence
PAC-learnability of determinate logic programs

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Finding interesting rules from large sets of discovered association rules

CIKM '94 Proceedings of the third international conference on Information and knowledge management
Advances in knowledge discovery and data mining

Advances in knowledge discovery and data mining
Metaqueries for data mining

Advances in knowledge discovery and data mining
Computational properties of metaquerying problems

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A fast distributed algorithm for mining association rules

DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Machine Learning

Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Metapattern-Based Automated Discovery Loop for Integrated Data Mining-Unsupervised Learning of Relational Patterns

IEEE Transactions on Knowledge and Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A General Incremental Technique for Maintaining Discovered Association Rules

Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA)
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing

FlexiMine – A Flexible Platform for KDD Research and Application Development

Annals of Mathematics and Artificial Intelligence
Enumerating consistent metaquery instantiations

AI Communications
Outlier detection using default reasoning

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Metaquery (metapattern) is a data mining tool which is useful for learning rules involving more than one relation in the database. The notion of a metaquery has been proposed as a template or a second-order proposition in a language L that describes the type of pattern to be discovered. This tool has already been successfully applied to several real-world applications.In this paper we advance the state of the art in metaquery research in several ways. First, we argue that the notion of a support value for metaqueries, where a support value is intuitively some indication to the relevance of the rules to be discovered, is not adequately defined in the literature, and, hence, propose our own definition. Second, we analyze some of the related computational problems, classify them as NP-hard and point out some tractable cases. Third, we propose some efficient algorithms for computing support and present preliminary experimental results that indicate the usefulness of our algorithms.