APRIL, Application of Probabilistic Inductive Logic Programming, IST-2001-33053 Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science,

Slides:



Advertisements
Similar presentations
1 Probability and the Web Ken Baclawski Northeastern University VIStology, Inc.
Advertisements

Slide 1 of 18 Uncertainty Representation and Reasoning with MEBN/PR-OWL Kathryn Blackmond Laskey Paulo C. G. da Costa The Volgenau School of Information.
University of Texas at Austin Machine Learning Group Department of Computer Sciences University of Texas at Austin Discriminative Structure and Parameter.
Bayesian Network and Influence Diagram A Guide to Construction And Analysis.
Bayesian Abductive Logic Programs Sindhu Raghavan Raymond J. Mooney The University of Texas at Austin 1.
1 Some Comments on Sebastiani et al Nature Genetics 37(4)2005.
Introduction to Artificial Intelligence
CSE 5522: Survey of Artificial Intelligence II: Advanced Techniques Instructor: Alan Ritter TA: Fan Yang.
Markov Logic Networks Instructor: Pedro Domingos.
Introduction of Probabilistic Reasoning and Bayesian Networks
Speaker:Benedict Fehringer Seminar:Probabilistic Models for Information Extraction by Dr. Martin Theobald and Maximilian Dylla Based on Richards, M., and.
APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science,
1.Examples of using probabilistic ideas in robotics 2.Reverend Bayes and review of probabilistic ideas 3.Introduction to Bayesian AI 4.Simple example.
Relational Data Mining in Finance Haonan Zhang CFWin /04/2003.
CS 547: Sensing and Planning in Robotics Gaurav S. Sukhatme Computer Science Robotic Embedded Systems Laboratory University of Southern California
CSE 574 – Artificial Intelligence II Statistical Relational Learning Instructor: Pedro Domingos.
Lecture 5: Learning models using EM
Big Ideas in Cmput366. Search Blind Search Iterative deepening Heuristic Search A* Local and Stochastic Search Randomized algorithm Constraint satisfaction.
CSE 574: Artificial Intelligence II Statistical Relational Learning Instructor: Pedro Domingos.
Part II. Statistical NLP Advanced Artificial Intelligence Probabilistic DCGs and SLPs Wolfram Burgard, Luc De Raedt, Bernhard Nebel, Lars Schmidt-Thieme.
Probabilistic Robotics Introduction Probabilities Bayes rule Bayes filters.
Representing Uncertainty CSE 473. © Daniel S. Weld 2 Many Techniques Developed Fuzzy Logic Certainty Factors Non-monotonic logic Probability Only one.
1 Department of Computer Science and Engineering, University of South Carolina Issues for Discussion and Work Jan 2007  Choose meeting time.
5/25/2005EE562 EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 16, 6/1/2005 University of Washington, Department of Electrical Engineering Spring 2005.
CPSC 322, Lecture 31Slide 1 Probability and Time: Markov Models Computer Science cpsc322, Lecture 31 (Textbook Chpt 6.5) March, 25, 2009.
CPSC 322, Lecture 32Slide 1 Probability and Time: Hidden Markov Models (HMMs) Computer Science cpsc322, Lecture 32 (Textbook Chpt 6.5) March, 27, 2009.
CSE 590ST Statistical Methods in Computer Science Instructor: Pedro Domingos.
Descriptive Modelling: Simulation “Simulation is the process of designing a model of a real system and conducting experiments with this model for the purpose.
CIS 410/510 Probabilistic Methods for Artificial Intelligence Instructor: Daniel Lowd.
Science and Engineering Practices
CSE 515 Statistical Methods in Computer Science Instructor: Pedro Domingos.
LÊ QU Ố C HUY ID: QLU OUTLINE  What is data mining ?  Major issues in data mining 2.
Overview G. Jogesh Babu. Probability theory Probability is all about flip of a coin Conditional probability & Bayes theorem (Bayesian analysis) Expectation,
Artificial Intelligence: Definition “... the branch of computer science that is concerned with the automation of intelligent behavior.” (Luger, 2009) “The.
A simple method for multi-relational outlier detection Sarah Riahi and Oliver Schulte School of Computing Science Simon Fraser University Vancouver, Canada.
Functional Genomic Hypothesis Generation and Experimentation by a Robot Scientist King et al, Nature : Presented by Monica C. Sleumer February.
第十讲 概率图模型导论 Chapter 10 Introduction to Probabilistic Graphical Models
Recognizing Activities of Daily Living from Sensor Data Henry Kautz Department of Computer Science University of Rochester.
1 Robot Environment Interaction Environment perception provides information about the environment’s state, and it tends to increase the robot’s knowledge.
Markov Logic And other SRL Approaches
ICML-Tutorial, Banff, Canada, 2004 Kristian Kersting University of Freiburg Germany „Application of Probabilistic ILP II“, FP
An Examination of Science. What is Science Is a systematic approach for analyzing and organizing knowledge. Used by all scientists regardless of the field.
Learning Metabolic Network Inhibition using Abductive Stochastic Logic Programming Jianzhong Chen, Stephen Muggleton, José Santos Imperial College, London.
Biological Signal Detection for Protein Function Prediction Investigators: Yang Dai Prime Grant Support: NSF Problem Statement and Motivation Technical.
Randomized Algorithms for Bayesian Hierarchical Clustering
ICML-Tutorial, Banff, Canada, 2004 Kristian Kersting University of Freiburg Germany „Application of Probabilistic ILP II“, FP
Question paper 1997.
The famous “sprinkler” example (J. Pearl, Probabilistic Reasoning in Intelligent Systems, 1988)
CPSC 322, Lecture 33Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 33 Nov, 30, 2015 Slide source: from David Page (MIT) (which were.
Markov Chain Monte Carlo for LDA C. Andrieu, N. D. Freitas, and A. Doucet, An Introduction to MCMC for Machine Learning, R. M. Neal, Probabilistic.
Probabilistic Robotics Introduction.  Robotics is the science of perceiving and manipulating the physical world through computer-controlled devices.
1 Scalable Probabilistic Databases with Factor Graphs and MCMC Michael Wick, Andrew McCallum, and Gerome Miklau VLDB 2010.
04/21/2005 CS673 1 Being Bayesian About Network Structure A Bayesian Approach to Structure Discovery in Bayesian Networks Nir Friedman and Daphne Koller.
Probabilistic Robotics Introduction Probabilities Bayes rule Bayes filters.
Bioinformatics Research Overview Li Liao Develop new algorithms and (statistical) learning methods > Capable of incorporating domain knowledge > Effective,
CSE 473 Uncertainty. © UW CSE AI Faculty 2 Many Techniques Developed Fuzzy Logic Certainty Factors Non-monotonic logic Probability Only one has stood.
Probabilistic Robotics Introduction. SA-1 2 Introduction  Robotics is the science of perceiving and manipulating the physical world through computer-controlled.
Pattern Recognition. What is Pattern Recognition? Pattern recognition is a sub-topic of machine learning. PR is the science that concerns the description.
Scalable Statistical Relational Learning for NLP William Y. Wang William W. Cohen Machine Learning Dept and Language Technologies Inst. joint work with:
Probabilistic Robotics Probability Theory Basics Error Propagation Slides from Autonomous Robots (Siegwart and Nourbaksh), Chapter 5 Probabilistic Robotics.
Genetic Algorithms. Solution Search in Problem Space.
COmbining Probable TRAjectories — COPTRA
High-throughput Biological Data The data deluge
Connectionist Knowledge Representation and Reasoning
A Short Tutorial on Causal Network Modeling and Discovery
CSE-490DF Robotics Capstone
CSE 515 Statistical Methods in Computer Science
Network Inference Chris Holmes Oxford Centre for Gene Function, &,
Probability and Time: Markov Models
Statistical Relational AI
Presentation transcript:

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. APRIL Albert-Ludwigs University Freiburg, Germany Applications of Probabilistic Inductive Logic Programming Imperial College of Science, Technology and Medicine, London, Great Britain

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Abstract The project adresses „probabilistic logic learning“ i.e. the integration of probabilistic reasoning with first order logic representations and machine learning. The objective is to critically assess the promise of this approach using application of functional genomics.

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Context Real-world applications Uncertainty Complex, structured domains Logic: objects, relations, functors Probability theory Hidden Markov Models, Stochastic Context-Free Grammars, Bayesian networks,.... Logic Programs (Prolog) „Probabilistic Logic“ Learning „Probabilistic Logic Learning“ ?

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Objectives (1) One of the key open questions of artificial intelligence concerns "probabilisitic logic learning", Logic Learning i.e. the integration of probabilistic reasoning with first order logic representations and machine learning. Probabilitstic

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Learning What is „Probabilistic Logic Learning? Representations and reasoning mechanisms grounded in probability theory, e.g. HMMs, Bayesian networs, stochastics grammars... Successfully used in a wide range of applications such as computational biology, speech recognition,... Robust models Logic Probabilistic - Probabilistic

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. First-order logic Elegant representation of complex situations involving a variety of objects as well as reltions among these objects: Learning Probabilistic What is „Probabilistic Logic Learning? - Logic Logic bloodtype(X,a) <- mother(M,X),bloodtype(M,a), father(F,X),bloodtype(F,a).

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Computing various aspects of a „probabilistic logic“ on the basis of data Logic Probabilistic Learning What is „Probabilistic Logic Learning? - Learning Often it is easier to obtain data and to learn a model than using traditional knowledge engineering techniques Parameter estimation Learning the „logical“ structure Fully vs. unobservable random variables

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Learning Research Context:„Probabilistic Logics“ Studies of probabilistic logics: Nielson, Halpern, Poole,... Recently: Koller, Sato, Jaeger,... Logic Probabilistic deterministic probabilistic propositional objects/relations Probabilistic Logics HMMs, Bayesian networks,... Logics

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Research Context: „Probabilistic Learning“ Logic Learning Probabilistic (ML) Parameter estimation Gradient-based algorithms Family of EM algorithm Different scores LogLikelihood, BIC, MDL, MML,... Structural learning Score-based hill-climbing Independency tests Monte Carlo Markov Chain (MCMC) techniques

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Inductive Logic Learning Machine Learning and Data Mining within first-order representations Broadened the application domain of Data Mining, especially in bio- and chemoinformatics Some of the best-known examples of Scientific Discovery by AI systems Research Context: „Logic Learning“ Probabilistic Logic Learning

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Objectives (2) 1.Are there significant applications for which "first order probabilistic logic" is better than state-of- the-art representations? 2.Can models be learned within such a "first order probabilistic logic"? Overall goal: To critically investigate "probabilistic logic learning" methods by answering the following questions:

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Description of Work (1) In order to answer the questions, we plan 1.to investigate and evaluate various alternative first order probabilistic representations and reasoning mechanisms such as: oStochastic Logic Programs [Muggleton 95, Cussens 99], oBayesian Logic Programs" [Kersting, De Raedt 00].

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Description of Work (2) 2.to employ the most promising such representations to model a functional genomics application; 3.to develop and to employ simple learning techniques to enable the learning of parts of the probabilistic logic representation; 4.to identify the main goals, directions and questions to be addressed in probabilistic logic learning.

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Application: Functional Genomics (1) Hieter P. and Boguski M. (1997) Functional Genomics: It's all how you read it. Science 278, : „Development and application of global (genome-wide or system-wide) experimental approaches to assess gene function by making use of the information and reagents provided by structural genomics.“ Functional Genomics

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Application: Functional Genomics (2) Hieter P. and Boguski M.: "[Functional genomics] is characterized by high throughput or large-scale experimental methodologies combine with statistical and computational analysis of the results. The fundamental strategy in a functional genomics approach is to expand the scope of biological investigation from studying single genes or proteins to studying all genes or proteins at once in a systematic fashion." Probabilistic Logic Learning

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Application: Functional Genomics (3) Inductive Logic Learning supports the use (as background knowledge) of generally known metabolic pathways and encoded enzyme chemistry. Probabilistic approaches make probabilistic descriptions of outcomes of experiments, i.e. they account for uncertainty due to e.g. noise, hidden variables, etc. deterministic propositional Probabilistic Inductive Logic Learning should enable probabilistic descriptions of experiments, as well as supporting the general, i.e. first-order description of probabilistic behaviour in e.g. the enzyme chemistry.

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Stochastic Logic Programs / Bayesian Logic Programs Bayesian Logic Programs [Kersting, De Raedt 00] Ground atoms = random variables Conditional probability distribution associated to Horn clause Dependency graph resticted to least Herbrand universum= (possibly infinite) Bayesian network Stochastic Logic Programs [Muggleton 95, Cussens 99] Probabilities defined over proofs Single probability values associated to Horn clause Log-linear models

APRIL, Application of Probabilistic Inductive Logic Programming, IST Albert-Ludwigs-University, Freiburg, Germany & Imperial College of Science, Technology and Medicine, London, Great Britain. Related Projects DARPA project: Evidence Extraction and Link Discovery (EELD)