From the Information Extraction Pipeline to Global Models, and Back

Subscribers:
348,000
Published on ● Video Link: https://www.youtube.com/watch?v=KdQbDiKZsJw



Category:
Guide
Duration: 52:51
38 views
1


Decisions in information extraction (IE), such as determining the types and relations of entities mentioned in text, depend on each other. To remain efficient, most systems make decisions in a sequential pipeline fashion, even if later decisions could help earlier ones. In this talk I will show how we used Conditional Random Fields to make these decisions jointly, substantially outperformed less global approaches and ranked first in several international IE competitions. I will then present relaxation methods we developed and applied to scale up (exact) inference in such models. In the final part of my talk I will argue why we should not dismiss the pipeline and present an exact beam-search algorithm, based on column generation, to overcome the pipeline's greedy nature.




Other Videos By Microsoft Research


2016-08-11Music Intelligence & the 'Taste Profile' - What Computers Think of You and Your Music Taste
2016-08-11Machine Learning Course - Lecture 8
2016-08-11Panel: Scientific Data: the Current Landscape, Challenges, and Solutions
2016-08-11Machine Learning Work Shop - A Minimax Entropy Method for Learning the Wisdom of Crowds
2016-08-11Publishing and eScience Panel
2016-08-11Design-led Innovation
2016-08-11Future Perfect: The Case for Progress in A Networked Age
2016-08-11Towards ad hoc interactions with robots
2016-08-11Dynamically Enforcing Knowledge-based Security Policies
2016-08-11Real Applications of Non-Real Numbers
2016-08-11From the Information Extraction Pipeline to Global Models, and Back
2016-08-11Some Algorithmic Problems in High Dimensions
2016-08-11Machine Learning Course - Lecture 2
2016-08-11Panel: Open Data for Open Science - Data Interoperability
2016-08-11Cloud Computing - What Do Researchers Want? - A Panel Discussion
2016-08-11Machine Learning Work Shop - Recovery of Simultaneously Structured Models by Convex Optimization
2016-08-11Machine Learning Work Shop- A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem
2016-08-11Machine Learning Work Shop - Combining Machine and Human Intelligence in Crowdsourcing
2016-08-11Graph Drawing 2012 Day 3 - Session 4
2016-08-11Machine Learning Work Shop-Session 4 - Hariharan Narayanan - Testing the Manifold Hypothesis
2016-08-11Machine Learning Work Shop-Session 3 - Pedro Domingos - Learning Tractable but Expressive Models



Tags:
microsoft research