Inducing multi-level association rules from multiple relations

104Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Recently there has been growing interest both to extend ILP to description logics and to apply it to knowledge discovery in databases. In this paper we present a novel approach to association rule mining which deals with multiple levels of description granularity. It relies on the hybrid language .4.C-IOg which allows a unified treatment of both the relational and structural features of data. A generality order and a downward refinement operator for AC-log pattern spaces is defined on the basis of query subsumption. This framework has been implemented in SPADA, an ILP system, for mining multi-level association rules from spatial data. As an illustrative example, we report experimental results obtained by running the new version of SPADA on geo-referenced census data of Manchester Stockport. © 2004 Kluwer Academic Publishers.

Cite

CITATION STYLE

APA

Lisi, F. A., & Malerba, D. (2004). Inducing multi-level association rules from multiple relations. Machine Learning, 55(2), 175–210. https://doi.org/10.1023/B:MACH.0000023151.65011.a3

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