CST 455 Graduate Seminar (Spring 2006)
Time and place
InstructorDr. Evgeny Dantsin
Course descriptionCatalog description: Course content varies. Study of the current state of research in a designated area of the computer science. A faculty member introduces initial study of the fundamentals, followed by the study of recent publications chosen by a faculty member. Spring 2006 Topic: Web Search and Ranking Algorithms It is common for Web search queries to have thousands or millions of results. Since a typical Web user does not look beyond the first page of results, the role of ranking is critical: the desired results should be outputted within the top few pages. A ranking algorithm is an algorithm for determining a numerical value of "relevance" or “importance” of a web page. The primary goal of the course is to study ideas and techniques behind ranking algorithms. In particular, we will study Google’s ranking algorithm (PageRank). TextbooksThe reading materials for the course will be available online. Consent of instructor.GradingThe course follows a traditional graduate seminar format that includes assigned reading, students' presentations, and class discussions. Each student is expected to make a class presentation (typically, a review of a research article). The other students are expected to read the article before the class presentation in order to be prepared for the discussion of the article. The final grade will be based on the quality of the student's presentation and participation in seminar discussions. Statement on cheating and plagiarism: Instances of academic dishonesty will be handled as described in University policies. Depending on the severity of the violation, an instructor may fail a student on the individual assignment or test, may lower the student’s grade in the course, or may fail the student in the course. More details on the University's policies on academic honesty may be found in the Student Handbook. Seminar notes
|
Maintained by Evgeny Dantsin