统计关系学习.pptVIP

Practical Statistical Relational Learning Pedro Domingos Dept. of Computer Science Eng. University of Washington Overview Motivation Foundational areas Probabilistic inference Statistical learning Logical inference Inductive logic programming Putting the pieces together Applications Motivation Examples Web search Information extraction Natural language processing Perception Medical diagnosis Computational biology Social networks Ubiquitous computing Etc. Costs and Benefits of SRL Benefits Better predictive accuracy Better understanding of domains Growth path for machine learning Costs Learning is much harder Inference becomes a crucial issue Greater complexity for user Goal and Progress Goal:Learn from non-i.i.d. data as easilyas from i.i.d. data Progress to date Burgeoning research area We’re “close enough” to goal Easy-to-use open-source software available Lots of research questions (old and new) Plan We have the elements: Probability for handling uncertainty Logic for representing types, relations,and complex dependencies between them Learning and inference algorithms for each Figure out how to put them together Tremendous leverage on a wide range of applications Disclaimers Not a complete survey of statisticalrelational learning Or of foundational areas Focus is practical, not theoretical Assumes basic background in logic, probability and statistics, etc. Please ask questions Tutorial and examples available atalchemy.cs.washington.edu Overview Motivation Foundational areas Probabilistic inference Statistical learning Logical inference Inductive logic programming Putting the pieces together Applications Markov Networks Undirected graphical models Markov Networks Undirected graphical models Hammersley-Clifford Theorem If Distribution is strictly positive (P(x) 0) And Graph encodes conditional independences Then Distribution is product of potentials over cliques of graph Inverse is also true. (“Markov network = Gibbs distribution”) Markov Nets