Difference between revisions of "Class Meeting for 10-710 10-18-2011"
From Cohen Courses
Jump to navigationJump to search| Line 5: | Line 5: | ||
* [http://www.cs.cmu.edu/~wcohen/10-710/10-18-editDistances.ppt Slides] | * [http://www.cs.cmu.edu/~wcohen/10-710/10-18-editDistances.ppt Slides] | ||
* [http://www.cs.cmu.edu/~wcohen/10-710/10-18-editDistances.pdf PDF] | * [http://www.cs.cmu.edu/~wcohen/10-710/10-18-editDistances.pdf PDF] | ||
| + | |||
| + | These slides include an extended detour into EM for sequences, which we haven't explicitly studied yet. | ||
=== Required Readings === | === Required Readings === | ||
Latest revision as of 14:30, 17 October 2011
This is one of the class meetings on the schedule for the course Syllabus for Structured Prediction 10-210 in Fall 2011.
Learning Edit Distances: 1
These slides include an extended detour into EM for sequences, which we haven't explicitly studied yet.
Required Readings
- Learning String Edit Distances, Ristad and Yianilos, PAMI 1998.
Optional Readings
- Adaptive Duplicate Detection Using Learnable String Similarity Measures. Mikhail Bilenko and Raymond J. Mooney. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2003), pp.39-48, Washington, DC, August 2003.
