TU Wien:Grundlagen des Information Retrieval VU (Rauber)/Prüfung 2024-01-09
Zur Navigation springen
Zur Suche springen
The duration of this exam was 1 hour. It was split into two parts, with the first one being multiple choice and the second one open questions. You got already 4 Points for writing your surname on the exam sheet which was nice. The exam did not include questions on music retrieval as this lecture was not conducted in WS23/24.
Part 1 (Multiple Choice, each 4P)[Bearbeiten | Quelltext bearbeiten]
- Which of the following are present in an Information Retrieval Test Collection?
- Search Engines
- Queries
- Relevance Judgements
- Document Collection
- Classic Boolean Retrieval supports:
- exact match between query and document
- operators such as AND, OR and NOT
- PageRank
- ranking
- Query Logs can be used for:
- query spelling correction
- training Learning to Rank algorithms
- cooling servers
- optimising search engine cache replacement policies
- Not accurate, but sth like: Which of these sentences are true for similarity matching?
- xyxyxy
- Euclidean distance is going to infinity for matches
- Euclidean distance is undefined for queries having only one term
- Cosine similarity as it computes the angle between vectors and account for different lengths
Part 2 (Open Questions)[Bearbeiten | Quelltext bearbeiten]
- Explain Tokenization, Normalization and Stemming. (10P)
- Explain Inverted Index and what kind of data structure it utilizes. (10P)
- Which aspects are taken into account by the BM25 model? (10P)
- Explain Teleportation in the context of Web Search. (10P)
- Explain Word Embedding and how it is calculated. (20P)
- Explain how Recall and Precision are calculated and why they should always be presented together? (10P)
- Which two average metrics are used in MAP (Mean Average Precision) calculation, explain what they do (10P)
Total Points: 100