Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 2

21ITE09 INFORMATION RETRIEVEL 3/0/0

Nature of the
: Theory ,
Course
Pre requisite(s) :-
Course Objective:
1. To learn the fundamentals of Information Retrieval and its various models.
2. To experiment about the pre-processing techniques and query languages used in IR
system.
3. To explore the performance metrics of IR System.
4. To learn the usage and design of Web Search Engines.
5. To examine the recommender systems and information extraction system
Course Outcomes:
Upon completion of the course, students shall have ability to
CO1 Build an Information Retrieval system using the available tools. [AP]
CO2 Apply indexing and query expansion techniques for efficient retrieval. [AP]
CO3 Apply performance metrics to validate any information retrieval system. [AP]
CO4 Apply machine learning techniques for text classification and clustering for [AP]
efficient Information Retrieval.
CO5 Design and analyze the Web content structures. [AP]
CO6 Design and implement recommender and information extraction system. [AP]
Course Contents:
Module 1 INTRODUCTION AND PREPROCESSING 15 Hrs
Introduction – Goals and History of IR – The Impact of the Web on IR – The Role of Artificial
Intelligence (AI) in IR – Basic IR Models – Boolean and Vector Space Retrieval Models –
Ranked Retrieval – Text similarity metrics – TF-IDF (term frequency/inverse document
frequency) Weighting – Cosine Similarity Basic Tokenizing – Indexing and Implementation of
Vector Space Retrieval – Simple Tokenizing – Stop Word Removal and Stemming – Inverted
Indices –Efficient Processing with Sparse Vectors – Query Operations and Languages –
Relevance Feedback – Query Expansion – Query Languages.
Module 2 METRICS, CATEGORIZATION 15 Hrs
Experimental Evaluation of IR – Performance metrics Recall, Precision and F measure –
Evaluations on Benchmark Text Collections – Text Representation – Word Statistics – Zipf’s
Law – Porter Stemmer – Morphology – Index Term Selection using Thesauri –Metadata and
Markup Languages – Web Search Engines – Spidering – Metacrawlers – Directed Spidering
– Link Analysis Shopping Agents Text Categorization and Clustering – Categorization
Algorithms – Naive Bayes – Decision Trees and Nearest Neighbor

Module 3 CLUSTERING, EXTRACTION AND INTEGRATION 15 Hrs


Clustering Algorithms – Agglomerative Clustering – k Means – Expectation Maximization
(EM) – Applications to Information Filtering – Organization and Relevance Feedback
Recommender Systems – Collaborative Filtering – Content Based Recommendation of
Documents and Products – Information Extraction and Integration – Extracting Data from
Text – XML – Semantic Web – Collecting and Integrating Specialized Information on the
Web.

Total Hours (45): 45


Text Books:
1. Christopher D. Manning, Prabhakar Raghavan, Hinrich Schütze,” Introduction to
Information Retrieval”, Cambridge University Press, 2008.
2. Ricci, F. Rokach, L. Shapira, B. Kantor, P.B. “Recommender Systems Handbook”,
Springer, 2011.
Reference Books:
1. Brusilovsky, Peter, “The Adaptive Web Methods and Strategies of Web Personalization”,
Springer, 2007.
2. Jure Leskovec, Anand Rajaraman, Jeffrey David Ullman, “Mining of Massive Datasets”,
Second Edition, Cambridge University Press, 2014.
3. Ricardo Baeza-Yates, Berthier Ribeiro-Neto, “Modern Information Retrieval: The
Concepts and Technology behind Search”, Second Edition, ACM Press books, 2011.
Web References:
1. https://www.tutorialspoint.com/natural_language_processing/
natural_language_processing_information_retrieval.html
2. https://www.geeksforgeeks.org/what-is-information-retrieval
Online Resources:
1. https://www.youtube.com/watch?v=gVsCf1P1IzQ
2. https://nptel.ac.in/courses/106101007
3. https://www.youtube.com/watch?v=DR5RKkHZ0J4

Course Articulation Matrix


Course Programme Specific
Outcome Programme Outcomes (PO) Outcomes(PSO)
(CO)
1 2 3 4 5 6 7 8 9 10 11 12 1 2
1 3 3 2 2 3 2 2 2 3 3
2 3 3 3 2 1 2 2 1 2 1 2 2 3 3
3 3 3 2 2 1 2 2 2 2 3 3
4 3 3 3 3 3 2 2 1 2 1 2 2 3 3
5 3 3 2 2 3 2 2 1 2 1 2 2 3 3
6 3 3 3 3 3 2 2 1 2 1 2 2 3 3
Reasonably Moderately
1 2 3 Strongly agreed
agreed agreed

You might also like