Modeling KDD Processes within the Inductive Database Framework

One of the most challenging problems in data manipulation in the future is to be able to e ciently handle very large databases but also multiple induced properties or generalizations in that data. Popular examples of useful properties are association rules, and inclusion and functional dependencies. Our view of a possible approach for this task is to specify and query inductive databases, which are databases that in addition to data also contain intensionally de ned generalizations about the data. We formalize this concept and show how it can be used throughout the whole process of data mining due to the closure property of the framework. We show that simple query languages can be de ned using normal database terminology. We demonstrate the use of this framework to model typical data mining processes. It is then possible to perform various tasks on these descriptions like, e.g., optimizing the selection of interesting properties or comparing two processes.

• Type: Conference
• Year: 1999
• Where: DAWAK
• Authors: Jean-François Boulicaut, Mika Klemettinen, Heikki Mannila
• Keywords: Data Manipulation, Data Mining, DAWAK 1999, Information Management, Multiple Induced Properties