retrieval system evaluation contains 6 documents {d1, d2, d3, d4, d5, d6} and 2 queries {q1, q2}, assume the relevance scores of the six documents to q1 is {3, 4, 2, 1, 5, 0} and to q2 is {6, 3, 2, 1, 0, 0}. Given two information retrieval algorithms, if their rankings of the six documents based on the queries are as follows (left for q1 and right for q2): rank Ground Truth IR IR2 rank Ground Truth IR IR2 d5 d5 d5 1 d1 d1 d1 d2 d2 d1 d2 d4 d2 d1 d1 d3 d3 d2 d3 13 14 d3 d5 123
retrieval system evaluation contains 6 documents {d1, d2, d3, d4, d5, d6} and 2 queries {q1, q2}, assume the relevance scores of the six documents to q1 is {3, 4, 2, 1, 5, 0} and to q2 is {6, 3, 2, 1, 0, 0}. Given two information retrieval algorithms, if their rankings of the six documents based on the queries are as follows (left for q1 and right for q2): rank Ground Truth IR IR2 rank Ground Truth IR IR2 d5 d5 d5 1 d1 d1 d1 d2 d2 d1 d2 d4 d2 d1 d1 d3 d3 d2 d3 13 14 d3 d5 123
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Kindly find attached a question on Information retrieval. Kindlyu provide the answers for me .Thanks

Transcribed Image Text:3. ormalized Discounted Cumulative Gain (NDCG): a benchmark for information
retrieval system evaluation contains 6 documents {d1, d2, d3, d4, d5, d6} and 2 queries
{q1, q2}, assume the relevance scores of the six documents to q1 is {3, 4, 2, 1, 5, 0} and
to q2 is {6, 3, 2, 1, 0, 0}. Given two information retrieval algorithms, if their rankings of
the six documents based on the queries are as follows (left for q1 and right for q2):
rank
Ground Truth IR IR2
Ground Truth
IR
IR2
d1
rank
d5
d5
d5
d1
d1
d2
d2
d1
d2
d4
d2
d1
d1
d3
d3
d2
d3
d3
d6
d2
d4
d3
d5
d4
d3
d4
5
d5
d5
d4
d6
d4
d6
6.
d6
d6
d6
Calculate their NDCG using the formula below to measure which IR algorithm is more
effecti ves (check slides 44-47 of chapter 8; note that the formula used in the example
is different)
2R(jm) - 1
NDCG(Q, k)
log, (1+ m)'
m=1
123456
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON

Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON

Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning

Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education

Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY