Sciweavers

Share
PKDD
1998
Springer

Querying Inductive Databases: A Case Study on the MINE RULE Operator

9 years 5 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pattern, zooming on a subset of the data, and postprocessing some patterns. We describe a comprehensive framework in which all these steps can be carried out by means of queries over an inductive database. An inductive database is a database that in addition to data also contains intensionally de ned generalizations about the data. We formalize this concept: an inductive database consists of a normal database together with a subset of patterns from a class of patterns, and an evaluation function that tells how the patterns occur in the data. Then, looking for potential query languages built on top of SQL, we consider the research on the MINE RULE operator by Meo, Psaila and Ceri. It is a serious step towards an implementation framework for inductive databases, though it addresses only the association rule mining...
Jean-François Boulicaut, Mika Klemettinen,
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1998
Where PKDD
Authors Jean-François Boulicaut, Mika Klemettinen, Heikki Mannila
Comments (0)
books