Practical Statistical Relational Learning
Description
The tutorial will be composed of three parts: # Foundational areas. The first part will consist of a brief introduction to each of the four foundational areas of SRL: logical inference, inductive logic programming, probabilistic inference, and statistical learning. Obviously, in the short time available no attempt will be made to comprehensively survey these areas; rather, the focus will be on providing the key concepts and techniques required for the subsequent parts. For example, the logical inference part will focus on the basics of satisfiability testing, and the probabilistic/statistical parts on Markov networks. The duration of this part will be approximately two hours (half hour per subtopic). # Putting the pieces together. The second part will introduce the key ideas in SRL and survey major approaches, using Markov logic as the unifying framework. It will present state-of-the-art algorithms for statistical relational learning and inference, and give an overview of the Alchemy open-source software. This part will essentially consist of putting together the pieces introduced in the first part. Its duration will be approximately an hour. # Applications. The third and final part will describe how to efficiently develop state-of-the-art non-i.i.d. applications in various areas, including: hypertext classification, link-based information retrieval, information extraction and integration, natural language processing, social network modeling, computational biology, and ubiquitous computing. This part will also include practical tips on using SRL, Markov logic and Alchemy - the kind of information that is seldom found in research papers, but is key to developing successful applications. The duration of this part will be approximately an hour.
| Slides | |
| 0:00 | Practical Statistical Relational Learning |
| 0:10 | Overview |
| 1:28 | Motivation |
| 2:11 | Examples |
| 3:53 | Costs and Benefits of SRL |
| 6:32 | Goal and Progress |
| 8:23 | Plan |
| 9:03 | Disclaimers |
| 10:32 | Overview |
| 10:40 | Markov Networks - part 1 |
| 14:04 | Markov Networks - part 2 |
| 15:21 | Hammersley-Clifford Theorem |
| 16:16 | Markov Networks - part 2 |
| 16:23 | Hammersley-Clifford Theorem |
| 16:40 | Markov Nets vs. Bayes Nets |
| 19:04 | Inference in Markov Networks |
| 20:02 | MCMC: Gibbs Sampling |
| 20:57 | Other Inference Methods |
| 21:19 | MAP/MPE Inference |
| 22:20 | MAP Inference Algorithms |
| 23:35 | Learning Markov Networks |
| 24:00 | Generative Weight Learning |
| 25:56 | Pseudo-Likelihood |
| 27:19 | Discriminative Weight Learning |
| 29:24 | Other Weight Learning Approaches |
| 29:33 | Discriminative Weight Learning |
| 30:48 | Other Weight Learning Approaches |
| 31:39 | Discriminative Weight Learning |
| 31:48 | Other Weight Learning Approaches |
| 31:54 | Structure Learning |
| 33:53 | Overview |
| 33:58 | First-Order Logic |
| 35:35 | Inference in First-Order Logic |
| 36:25 | Satisfiability |
| 38:31 | Backtracking |
| 41:31 | The DPLL Algorithm |
| 42:40 | Stochastic Local Search |
| 44:14 | The WalkSAT Algorithm |
| 45:08 | Overview |
| 45:12 | Rule Induction |
| 46:16 | Learning a Single Rule |
| 46:52 | Learning a Set of Rules |
| 47:31 | First-Order Rule Induction |
| 50:35 | Overview |
| 51:05 | Plethora of Approaches |
| 52:57 | Key Dimensions |
| 55:03 | Knowledge-Based Model Construction |
| 58:46 | Stochastic Logic Programs |
| 60:41 | Probabilistic Relational Models |
| 63:32 | Relational Markov Networks |
| 65:20 | Bayesian Logic |
| 68:51 | Markov Logic - part 1 |
| 70:26 | Markov Logic - part 2 |
| 71:22 | Markov Logic: Intuition |
| 73:20 | Markov Logic: Definition |
| 73:59 | Example: Friends & Smokers - part 1 |
| 74:15 | Example: Friends & Smokers - part 2 |
| 74:47 | Example: Friends & Smokers - part 3 |
| 75:34 | Example: Friends & Smokers - part 4 |
| 75:51 | Example: Friends & Smokers - part 5 |
| 75:58 | Example: Friends & Smokers - part 6 |
| 76:59 | Example: Friends & Smokers - part 7 |
| 77:19 | Example: Friends & Smokers - part 8 |
| 77:35 | Markov Logic Networks |
| 83:52 | Summary |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If 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.
Related content
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





