Inductive querying with virtual mining views

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

Abstract

In an inductive database, one can not only query the data stored in the database, but also the patterns that are implicitly present in these data. In this chapter, we present an inductive database system in which the query language is traditional SQL. More specifically, we present a system in which the user can query the collection of all possible patterns as if they were stored in traditional relational tables. We show how such tables, or mining views, can be developed for three popular data mining tasks, namely itemset mining, association rule discovery and decision tree learning. To illustrate the interactive and iterative capabilities of our system, we describe a complete data mining scenario that consists in extracting knowledge from real gene expression data, after a pre-processing phase. © 2010 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Blockeel, H., Calders, T., Fromont, É., Prado, A., Goethals, B., & Robardet, C. (2010). Inductive querying with virtual mining views. In Inductive Databases and Constraint-Based Data Mining (pp. 265–287). Springer New York. https://doi.org/10.1007/978-1-4419-7738-0_11

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