Subjects: Study the foundamentals, theories and algorithms and indexing structures and the such, of information retrieval, take a look at how text search works on the web, including web crawlers and intelligent agents, and practice with Perl to write our own special search tools.
Prerequisites: CS104 (data structures) & Math 124 (linear algebra).
Textbook and materials:
(required text) Introduction to Information Retrieval by Christopher D. Manning, Prabhakar Raghavan, and Hinrich Schütze.
Online resources, and possibly class handouts.
Required work: Two written exams (midterm and final), 4 homework assignments, one class presentation, and a term project (team efforts) and associated presentation.
Grading:
Class participation 2%, assignments 20%, exams 34%, class presentation 10%, project and presentation 34%.
Further requirements:
Read the book chapters before and after class
Check emails from instructor and class website frequently for instructions
Honor code: The Computer Science Department rigorously enforces the University's policy and procedures on Code of Academic Integrity (PDF file). At the first suspicion of violation of this code, the case will be immediately forwarded to the University Coordinator of Academic Integrity. Of course, the Code applies to your conduct in this course. In particular, all work submitted for credit must be your own. You may discuss your homework assignments with your classmates, TAs, and the professor. However, you should write up solutions on your own and should not read or copy the solutions written by others in this or previous semesters. For programming part of the assignments, you must write your code for yourself, and are permitted to read code written by classmates only if you are helping them debug their programs after you have completed your own. The UVM policy on sources also applies to this course, which means that all sources must be acknowledged, whether allowed by the professor or not. For example, software provided by someone else must be acknowledged when incorporated into your work, and discussions with classmates should be acknowledged.
Disabilities: We encourage students with disabilities, including "invisible" disabilities such as chronic diseases and learning disabilities, to discuss with the professor any appropriate accommodations that we could make on their behalf.
Approximate schedule. Below is an approximate schedule for the semester, in which the chapters refer to the required textbook. This is subject to change as the semester progresses. (flip...)
|
Week |
Topics |
Due |
|---|---|---|
|
1. Sept. 1 |
Introduction & Chapters 1 |
|
|
2. Sept. 8 |
Chapters 2, 3 |
|
|
3. Sept. 15 |
Chapter 4, 5 |
HW 1 |
|
4. Sept. 22 |
Chapters 6, 7 |
|
|
5. Sept. 29 |
Chapter 8, Perl with networking programming |
|
|
6. Oct. 6 |
Chapters 19, 20 |
Project requirements docs |
|
7. Oct. 13 |
Catch up, review, and term project brainstorming |
HW 2 |
|
8. Oct. 20 |
Chapters 9, 11 |
|
|
9. Oct. 27 |
Midterm test |
|
|
10. Nov. 3 |
Chapters 12, 13 |
Project design docs & initial efforts |
|
11. Nov. 10 |
Student presentation |
|
|
12. Nov. 17 |
Student presentation |
HW 3 |
|
13. Nov. 24 |
Thanksgiving break. No classes. |
|
|
14. Dec. 1 |
To be arranged (depending on student presentations) |
|
|
15. Dec. 8 |
Project presentation and demo |
HW 4 |
|
16. Dec. 15 |
Final exam |
|