Difference between revisions of "Class Meeting for 10-707 11/17/2010"
From Cohen Courses
Jump to navigationJump to search
m (1 revision) |
|||
(One intermediate revision by the same user not shown) | |||
Line 1: | Line 1: | ||
This is one of the class meetings on the [[Syllabus for Information Extraction 10-707 in Fall 2010|schedule]] for the course [[Information Extraction 10-707 in Fall 2010]]. | This is one of the class meetings on the [[Syllabus for Information Extraction 10-707 in Fall 2010|schedule]] for the course [[Information Extraction 10-707 in Fall 2010]]. | ||
− | === | + | === IE and Reasoning 4 - MLNs for IE and Matching === |
− | * [http://www-2.cs.cmu.edu/~wcohen/ | + | * [http://www-2.cs.cmu.edu/~wcohen/11-17-poon-domingos.ppt Slides] |
=== Required Readings === | === Required Readings === | ||
Line 13: | Line 13: | ||
=== Optional Readings === | === Optional Readings === | ||
− | * | + | * Subramanya, A., A., N. Petrov, S., and Fernando C. N Pereira. 2005. Efficient Graph-Based Semi-Supervised Learning. Adapting a graph-based label propogation method to CRF-like structured prediction tasks by integrating the predictions made by the label propogation into CRF's computation of expectations. |
Latest revision as of 11:56, 17 November 2010
This is one of the class meetings on the schedule for the course Information Extraction 10-707 in Fall 2010.
IE and Reasoning 4 - MLNs for IE and Matching
Required Readings
- Language-independent set expansion of named entities using the web, by R. C Wang, W. W Cohen. In IEEE International Conference on Data Mining (ICDM), 2007.
- Iterative set expansion of named entities using the web, by R. C Wang, W. W Cohen. In Proceedings of 8th IEEE International Conference on Data Mining, 2008.
Optional Readings
- Subramanya, A., A., N. Petrov, S., and Fernando C. N Pereira. 2005. Efficient Graph-Based Semi-Supervised Learning. Adapting a graph-based label propogation method to CRF-like structured prediction tasks by integrating the predictions made by the label propogation into CRF's computation of expectations.