Difference between revisions of "Class Meeting for 10-710 10-18-2011"
From Cohen Courses
Jump to navigationJump to search (Created page with 'This is one of the class meetings on the schedule for the course [[Syllabus for Structured Prediction 10-710 in Fall 20…') |
|||
| Line 10: | Line 10: | ||
* [http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=682181&tag=1 Learning String Edit Distances], Ristad and Yianilos, PAMI 1998. | * [http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=682181&tag=1 Learning String Edit Distances], Ristad and Yianilos, PAMI 1998. | ||
| − | == Optional Readings === | + | === Optional Readings === |
* [http://research.microsoft.com/en-us/um/people/mbilenko/papers/03-marlin-kdd.pdf 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. | * [http://research.microsoft.com/en-us/um/people/mbilenko/papers/03-marlin-kdd.pdf 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. | ||
Revision as of 13:54, 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
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.
