This course studies the theory, design, and implementation of
text-based search engines. The core components include statistical
characteristics of text, representation of information needs and
documents, several important retrieval models, and experimental
evaluation. The course also covers common elements of commercial
search engines, for example, integration of diverse search engines
into a single search service ("federated search", "vertical
search"), personalized search results, diverse search results, and
sponsored search. The software architecture components include
design and implementation of large-scale, distributed search
This is a full-semester lecture-oriented course worth 12 units.
|Eligibility:||This course is open to all students who meet the pre-requisites except students in the LTI's MLT and PhD programs. Students in the LTI's MLT and PhD programs can take 11-741, Information Retrieval, which focuses more on research. This course focuses more on current practice.|
By the end of the course, students are expected to have
developed the following skills. Skills are assessed by
the homework assignments and the final exam.
This course requires good programming skills and an understanding of
computer architectures and operating systems (e.g., memory vs. disk
trade-offs). A basic understanding of probability, statistics, and
linear algebra is helpful. Thus students should have preparation
comparable to the following CMU undergraduate courses.
|Time & Location:||Tu/Th 10:30-11:50, GHC 4211. (The room will probably change.)|
|Office hours:||By request. Send email to schedule a meeting.|
One of the following textbooks.
Online access to some materials (additional readings, lecture notes, datasets, etc) is restricted to the .cmu.edu domain. CMU people can get access from outside .cmu.edu (e.g., from home) using CMU's WebVPN Service.
|Homework:||6 assignments that give hands-on experience with techniques discussed in class.|
|Grading:||6 homework assignments (60%), midterm exam (20%), final exam (20%).|
|Grading Scale:||Grades are assigned using a curve.|
|Course policies:||Attendance, Laptops & mobile devices, Late homework, Plagiarism & cheating Recording & videotaping|
|Syllabus (subject to revision):|