From Inductive Querying to Declarative Modeling for Data Mining
published: Jan. 16, 2013, recorded: December 2012, views: 2755
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
In this talk I shall present a personal perspective on the quest for a unifying framework and theory of data mining. The starting point will be the notion of an inductive database as proposed in the seminal paper by Imielinski and Mannila (CACM 95), in which the knowledge discovery process is viewed as a querying process. The idea is that queries would return patterns and models. This framework is based on a parallel between database and data mining theory and has as ultimate goal the discovery of the equivalent of Codd's relational algebra for supporting data mining. I shall then continue to outline the more recent framework of declarative modeling for data mining, which exploits a parallel between data mining and constraint satisfaction and optimization. In this framework, data mining tasks are specified as constraint satisfaction and optimization tasks, that is, the data miner provides a model that specifies the constraints and optimization criteria that should be satisfied and a general purpose solver should compute solutions to these problems. By separating the model from the solver, a declarative approach to data mining is realized. I shall then conclude the talk by putting these frameworks into a broader perspective.
Download slides: ptdm2012_de_raedt_declarative_modeling_01.pdf (6.3 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !