A comparison between query languages for the extraction of association rules

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

Abstract

Recently inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operations on data using a special-purpose language, powerful enough to perform all the required manipulations, such as data preprocessing, pattern discovery and pattern post-processing. In this paper we present a comparison between query languages (MSQL, DMQL and MINE RULE) that have been proposed for association rules extraction in the last years and discuss their common features and differences. We present them using a set of examples, taken from the real practice of data mining. This allows us to define the language design guidelines, with particular attention to the open issues on IDBs. © 2002 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Botta, M., Boulicaut, J. F., Masson, C., & Meo, R. (2002). A comparison between query languages for the extraction of association rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2454 LNCS, pp. 1–10). Springer Verlag. https://doi.org/10.1007/3-540-46145-0_1

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