Please use this identifier to cite or link to this item:
Title: Querying multiple sets of discovered rules
Authors: Tuzhilin, A.
Liu, B. 
Keywords: Association rules
Data mining queries
Query evaluation
Query languages
Issue Date: 2002
Citation: Tuzhilin, A.,Liu, B. (2002). Querying multiple sets of discovered rules. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining : 52-60. ScholarBank@NUS Repository.
Abstract: Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a small subset of them is really useful in applications. Although there exist some systems allowing the user to query the discovered rules, they are less suitable for complex ad hoc querying of multiple data mining rulebases to retrieve interesting rules. In this paper, we propose a new powerful rule query language Rule-QL for querying multiple rulebases that is modeled after SQL and has rigorous theoretical foundations of a rule-based calculus. In particular, we first propose a rule-based calculus RC based on the first-order logic, and then present the language Rule-QL that is at least as expressive as the safe fragment of RC. We also propose a number of efficient query evaluation techniques for Rule-QL and test them experimentally on some representative queries to demonstrate the feasibility of Rule-QL.
Source Title: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Jan 26, 2023

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.