Luc De Raedt – författare

The book focuses on two representations in detail: Markov logic networks, a relational extension of undirected graphical models and weighted first-order predicate calculus formula, and Problog, a probabilistic extension of logic programs that can also be viewed as a Turing-complete relational extension of Bayesian networks.

It would not only allow one to use data mining techniques in constraint programming to identify and update constraints and optimization criteria, but also to employ constraints and criteria in data mining and machine learning in order to discover models compatible with prior knowledge.

This book constitutes the first textbook on inductive logic programming (ILP) and multi-relational data mining (MRDM). These subfields of data mining and machine learning are concerned with analyzing structured data that arise in numerous applications, such as bioinformatics, web mining, natural language processing, etc. The book explains some important techniques in detail by using case studies centered around well-known ILP or MRDM systems. These case studies are some of the "classics" of the field and also provide an adequate starting point for a more general discussion. Related systems and techniques are covered in a bibliographical section at the end of each chapter.The book addresses graduate students in computer science, data bases and artificial intelligence as well as practitioners of data mining and machine learning.

The interconnected ideas of inductive databases and constraint-based mining are appealing and have the potential to radically change the theory and practice of data mining and knowledge discovery. This book reports on the results of the European IST project "cInQ" (consortium on knowledge discovery by Inductive Queries) and its final workshop entitled Constraint-Based Mining and Inductive Databases organized in Hinterzarten, Germany in March 2004.

This book constitutes the refereed proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery, PKDD 2001, held in Freiburg, Germany, in September 2001.The 40 revised full papers presented together with four invited contributions were carefully reviewed and selected from close to 100 submissions. Among the topics addressed are hidden Markov models, text summarization, supervised learning, unsupervised learning, demographic data analysis, phenotype data mining, spatio-temporal clustering, Web-usage analysis, association rules, clustering algorithms, time series analysis, rule discovery, text categorization, self-organizing maps, filtering, reinforcemant learning, support vector machines, visual data mining, and machine learning.

This book constitutes the refereed proceedings of the 12th European Conference on Machine Learning, ECML 2001, held in Freiburg, Germany, in September 2001.The 50 revised full papers presented together with four invited contributions were carefully reviewed and selected from a total of 140 submissions. Among the topics covered are classifier systems, naive-Bayes classification, rule learning, decision tree-based classification, Web mining, equation discovery, inductive logic programming, text categorization, agent learning, backpropagation, reinforcement learning, sequence prediction, sequential decisions, classification learning, sampling, and semi-supervised learning.

This volume contains the proceedings of the European Conference on Machine Learning 1994, which continues the tradition of earlier meetings and which is a major forum for the presentation of the latest and most significant results in machine learning. Machine learning is one of the most important subfields of artificial intelligence and computer science, as it is concerned with the automation of learning processes. This volume contains two invited papers, 19 regular papers, and 25 short papers carefully reviewed and selected from in total 88 submissions. The papers describe techniques, algorithms, implementations, and experiments in the area of machine learning.

One of the key open questions within arti?cial intelligence is how to combine probability and logic with learning. This question is getting an increased - tentioninseveraldisciplinessuchasknowledgerepresentation,reasoningabout uncertainty, data mining, and machine learning simulateously, resulting in the newlyemergingsub?eldknownasstatisticalrelationallearningandprobabil- ticinductivelogicprogramming.Amajordriving forceisthe explosivegrowth in the amount of heterogeneous data that is being collected in the business and scienti?c world. Example domains include bioinformatics, chemoinform- ics, transportation systems, communication networks, social network analysis, linkanalysis,robotics,amongothers.Thestructuresencounteredcanbeass- pleassequencesandtrees(suchasthosearisinginproteinsecondarystructure predictionandnaturallanguageparsing)orascomplexascitationgraphs,the WorldWideWeb,andrelationaldatabases. This book providesan introduction to this ?eld with an emphasison those methods based on logic programming principles. The book is also the main resultofthesuccessfulEuropeanISTFETprojectno.FP6-508861onAppli- tionofProbabilisticInductiveLogicProgramming(APRILII,2004-2007).This projectwascoordinatedbytheAlbertLudwigsUniversityofFreiburg(Germany, Luc De Raedt) and the partners were Imperial College London (UK, Stephen MuggletonandMichaelSternberg),theHelsinkiInstituteofInformationTe- nology(Finland,HeikkiMannila),theUniversit' adegliStudidiFlorence(Italy, PaoloFrasconi),andtheInstitutNationaldeRechercheenInformatiqueet- tomatiqueRocquencourt(France,FrancoisFages).Itwasconcernedwiththeory, implementationsandapplicationsofprobabilisticinductivelogicprogramming. Thisstructureisalsore?ectedinthebook. The book starts with an introductory chapter to "Probabilistic Inductive LogicProgramming"byDeRaedtandKersting.Inasecondpart,itprovidesa detailedoverviewofthemostimportantprobabilisticlogiclearningformalisms and systems. We are very pleased and proud that the scientists behind the key probabilistic inductive logic programming systems (also those developed outside the APRIL project) have kindly contributed a chapter providing an overviewoftheircontributions.Thisincludes:relationalsequencelearningte- niques (Kersting et al.), using kernels with logical representations (Frasconi andPasserini),MarkovLogic(Domingosetal.), the PRISMsystem (Satoand Kameya),CLP(BN)(SantosCostaetal.),BayesianLogicPrograms(Kersting andDeRaedt),andtheIndependentChoiceLogic(Poole).Thethirdpartthen provides a detailed account of some show-caseapplications of probabilistic - ductive logic programming, more speci?cally: in protein fold discovery (Chen et al.), haplotyping (Landwehr and Mielik. ainen) and systems biology (Fages andSoliman). The ?nal parttouchesupon sometheoreticalinvestigationsand VI Preface includes chaptersonbehavioralcomparisonof probabilisticlogicprogramming representations(MuggletonandChen)andamodel-theoreticexpressivityan- ysis(Jaeger).

Indeed, graph, network and multi-relational data mining are now popular themes in data mining, and statistical relational learning is receiving a lot of attention in the machine learning and uncertainty in art- cial intelligence communities.