Mining association rules in multiple relations

126Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The application of algorithms for efficiently generating association rules is so far restricted to cases where information is put together in a single relation. We describe how this restriction can be overcome through the combination of the available algorithms with standard techniques from the field of inductive logic programming. We present the system Warmr, which extends Apriori [2] to mine association rules in multiple relations. We apply Warmr to the natural language processing task of mining part-of-speech tagging rules in a large corpus of English. be applied to further constrain the space of interesting ARMR's.

Cite

CITATION STYLE

APA

Dehaspe, L., & De Raedt, L. (1997). Mining association rules in multiple relations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1297, pp. 125–132). Springer Verlag. https://doi.org/10.1007/3540635149_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free