Difference between revisions of "Class meeting for 10-605 2012 02 02"
From Cohen Courses
Jump to navigationJump to search (Created page with 'This is one of the class meetings on the schedule for the course [[Machine Learning with Large Dataset…') |
|||
| Line 8: | Line 8: | ||
=== Readings for the Class === | === Readings for the Class === | ||
| − | * | + | * Joachims, Thorsten, [http://www.cs.cornell.edu/People/tj/publications/joachims_97a.pdf A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization]. Proceedings of International Conference on Machine Learning (ICML), 1997. |
=== Also discussed === | === Also discussed === | ||
| − | * to | + | * Relevance Feedback in Information Retrieval, SMART Retrieval System Experiments in Automatic Document Processing, 1971, Prentice Hall Inc. |
| + | * Schapire et al, [http://dl.acm.org/citation.cfm?id=290996 Boosting and Rocchio applied to text filtering], SIGIR 98. | ||
| + | * Littlestone, [http://www.springerlink.com/index/X1022977778L1777.pdf Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm], MLJ 1988. Includes the mistake-bound theory. | ||
Revision as of 18:03, 2 February 2012
This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Spring_2012.
Slides
Readings for the Class
- Joachims, Thorsten, A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization. Proceedings of International Conference on Machine Learning (ICML), 1997.
Also discussed
- Relevance Feedback in Information Retrieval, SMART Retrieval System Experiments in Automatic Document Processing, 1971, Prentice Hall Inc.
- Schapire et al, Boosting and Rocchio applied to text filtering, SIGIR 98.
- Littlestone, Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm, MLJ 1988. Includes the mistake-bound theory.
