JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD MCA 2020 INFORMATION RETRIEVAL SYSTEMS Previous Question Paper (October/ November - 2020 - R15)

MCA | 2020 | V | R15 | October/ November - 2020

Answer PaperPaper Code: 825ADMaximum Marks: 75Time: 2 Hours

Answer any five questions. All questions carry equal marks.

Main

1

Explain with a neat example how Inverted Index is constructed for a given query.

15 marks

Answer

An Inverted Index is the fundamental data structure used in information retrieval to map content to its location. It consists of a dictionary of unique terms (vocabulary) and, for each term, a postings list containing the identifiers of all documents in which the term appears.

The construction process involves four main steps:

  1. Tokenization: Breaking the document text into individual words or tokens.
  2. Linguistic Preprocessing: Applying normalization techniques such as lowercasing, stop-word removal, and stemming or lemmatization to standardize the terms.
  3. Indexing: Creating a sorted list of unique terms and recording the document ID for every occurrence.
  4. Postings List Creation: Consolidating the occurrences into a structure that maps each term to a list of document IDs, often sorted to facilitate efficient intersection operations.

Consider three documents:

Doc 1: "Information retrieval is fun"

Doc 2: "Retrieval systems are useful"

Doc 3: "Information systems are fun"

After preprocessing (lowercasing and removing stop words), the terms are:

TermDocument IDs
fun1, 3
information1, 3
retrieval1, 2
systems2, 3
useful2

When a query like "Information retrieval" is processed, the system performs a lookup in the dictionary for both terms. It retrieves the postings lists: {1, 3} for "information" and {1, 2} for "retrieval". By performing a set intersection of these lists, the system identifies that Document 1 contains both terms, allowing for rapid retrieval without scanning the entire collection.

215 marks
a

Write a short note on Query Expansion.

7 marks

Answer

Query Expansion is the process of reformulating a search query to improve retrieval performance by adding additional terms to the original query. It addresses the issue of vocabulary mismatch, where users and documents use different terminology for the same concept.

Methods for query expansion include:

  • Global Analysis: Uses techniques like thesaurus-based expansion (e.g., WordNet) or co-occurrence statistics across the entire document collection to identify synonyms or related terms.
  • Local Analysis: Focuses on the top-ranked documents retrieved for the initial query. Techniques include Relevance Feedback (using user-provided judgments) or Pseudo-Relevance Feedback (assuming the top-k documents are relevant and extracting terms from them).

The goal is to increase recall by capturing documents that do not contain the exact original query terms but are semantically related.

b

Explain briefly about the evaluation of Relevance Feedback Strategies.

8 marks

Answer

Sign in to view the complete answer paper.

3

Explain in detail how a document is represented and retrieved in XML Retrieval using Vector Space Model.

15 marks

Answer

Sign in to view the complete answer paper.

415 marks
a

Explain in detail about Group Average Agglomerative Clustering.

7 marks

Answer

Sign in to view the complete answer paper.

b

Write a short note on Divisive Clustering.

8 marks

Answer

Sign in to view the complete answer paper.

515 marks
a

Enumerate the features of a Web Crawler.

7 marks

Answer

Sign in to view the complete answer paper.

b

Explain the Crawler Architecture with a neat diagram.

8 marks

Answer

Sign in to view the complete answer paper.

6

Enumerate the reasons for Dictionary Compression. Explain in detail the two techniques used in Dictionary Compression.

15 marks

Answer

Sign in to view the complete answer paper.

7

Explain in detail how Rocchio algorithm is used for Relevance Feedback.

15 marks

Answer

Sign in to view the complete answer paper.

815 marks
a

Write a short note on the “1/0 Loss Case” in the Probability Ranking Principle.

7 marks

Answer

Sign in to view the complete answer paper.

b

Explain briefly the Binary Independence Model used with PRP.

8 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the question paper of INFORMATION RETRIEVAL SYSTEMS from JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD for MCA 2020 V, October/ November - 2020, R15.

For the solved question paper with answers, switch to the Answer Paper tab.

Other papers in INFORMATION RETRIEVAL SYSTEMS

Loading Question Papers

Fetching data from database...