Difference between revisions of "Class Meeting for 10-710 11-8-2011"
From Cohen Courses
Jump to navigationJump to search| Line 3: | Line 3: | ||
=== Kernels for Structured Inputs === | === Kernels for Structured Inputs === | ||
| − | * [http://www.cs.cmu.edu/~wcohen/10-710/11-08-input-kernels.ppt Slides] | + | * [http://www.cs.cmu.edu/~wcohen/10-710/11-08-input-kernels.ppt Slides in PowerPoint] |
| + | * [http://www.cs.cmu.edu/~wcohen/10-710/11-08-input-kernels.pdf Slides in PDF] | ||
These slides also have a common theme of relation extraction. | These slides also have a common theme of relation extraction. | ||
Revision as of 17:02, 28 October 2011
This is one of the class meetings on the schedule for the course Syllabus for Structured Prediction 10-210 in Fall 2011.
Kernels for Structured Inputs
These slides also have a common theme of relation extraction.
Required Readings
- Subsequence kernels for relation extraction, by R. Bunescu, R. Mooney. In Advances in Neural Information Processing Systems, 2006.
- A shortest path dependency kernel for relation extraction, by Razvan C Bunescu, Raymond J Mooney. In HLT '05: Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, 2005.
- Learning to extract relations from the web using minimal supervision, by R. Bunescu, R. Mooney. In ANNUAL MEETING-ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, 2007.
Optional Readings
- To add
