Meta-queries - Computation and Evaluation

Authors:
Rachel Ben-Eliyahu-Zohary;Ehud Gudes
Affiliations:
-;-
Venue:
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Year:
2000

Citing 7
Cited 0

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

Artificial Intelligence
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
A Metapattern-Based Automated Discovery Loop for Integrated Data Mining-Unsupervised Learning of Relational Patterns

IEEE Transactions on Knowledge and Data Engineering
On Efficiently Implementing SchemaSQL on an SQL Database System

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Towards efficient metaquerying

IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Metaquery (also known as metapattern) is a datamining tool useful for learning rules involving more than one relation in the database. A metaquery is a template, or a second-order proposition in a language that describes the type of pattern to be discovered. In an earlier paper we discussed the efficient computation of support for Meta-queries. In this paper we extend this work by comparing several support computation techniques. We also give real-life examples of meaningful rules which were derived by our method, and discuss briefly the software environment in which the meta-queries were run (the FLEXIMINE system). Finally we compare Meta-queries to Association rules and discuss their differences.