Spring 2004 ceghazy@vt.edu
5604:
INFORMATION STORAGE AND RETRIEVAL
Analyzing, indexing, representing, storing,
searching, retrieving, processing and presenting information and documents
using fully automatic systems. The information may be in the form of text,
hypertext, multimedia, or hypermedia. The systems are based on various models,
e.g., Boolean logic, fuzzy logic, probability theory, etc., and they are
implemented using inverted files, relational thesauri, special hardware, and
other approaches. Pre: Graduate standing; (3H,3C). I.
Textbook
"Modern Information
Retrieval" by Ricardo Baeza-Yates
and Berthier Ribeiro-Neto,
Addison Wesley, 1999 [Baeza99]
|
Date |
Topic |
Textbook |
Textbook Lecture Slides |
Other Lecture Slides |
|
1/22 |
Introduction Modeling |
1.1 - 1.5 2.1 - 2.5.3 |
|
|
|
1/29 |
Probabilistic Models Set Theoretic Model Extended Boolean Generalized Vector Model |
2.5.4 - 2.5.5 2.6.1 2.6.2 2.7.1 |
|
|
|
2/5 |
Latent Semantic Indexing Alternative Probabilistic
Model Structured Text Retrieval Model |
2.7.2 – 2.7.3 2.8.1 – 2.8.6 2.9 |
|
|
|
2/12 |
Query Languages Query Operations |
4.1 - 4.6 5.1 - 5.5 |
|
|
|
2/26 |
Text and Multimedia Markup Languages |
6.1 - 6.3 6.4 |
|
|
|
3/4 |
Text Operations Indexing |
7.1 - 7.6 8.1 - 8-2 |
|
|
|
3/18 |
Midterm Exam |
|
|
|
|
3/25 |
Searching and Compression |
8.5 - 8.9 |
|
|
|
4/1 |
Parallel and Distributed IR |
9.1 - 9.2.2 |
|
|
|
4/8 |
Graphical User Interface Interface Support for Searching Retaining Search History |
10.1 - 10.3 10.8.1 – 10.8.4 10.8.5 – 10.8.6, 10.9 |
|
|
|
4/15 |
Searching the Web |
13.4.4 - 13.4.6 |
|
|
|
4/22 |
Libraries and Bibliographical Systems Digital Libraries |
14.1 - 14.5
|
|
|
|
4/29 |
Project Presentations |
|
|
|
|
5/6 |
Final Exam |
|
|
|
Grading -- Midterm 30%, Final 35%, In-class Presentation 10%, and Project 25%
Paper presentations: Students give a 10 minute long presentation on the
results of their comparative analysis of two related papers (1995 or later) on
an assigned topic.
Project.doc :This is an individual project. You may consult with a classmate, but may not copy ANY code from anyone or anywhere.
REMEMBER TO READ THE HONOR CODE POLICY, WHICH IS APPLICABLE TO ALL COURSES TAUGHT AT VIRGINIA TECH.
Student’s in-class presentations: CompressionAlgorithms.ppt
ParallelDistributed.ppt
GUIHCI.ppt PageRank.ppt SearchCache.ppt