UIUC大学之Coursera课程Text Retrieval and Search Engines：Week 2 Quiz

最新推荐文章于 2026-05-24 10:11:00 发布

原创

最新推荐文章于 2026-05-24 10:11:00 发布 · 1.6k 阅读

标签

#UIUC大学 #Coursera课程 #Text Retrieval #Search Engines #Quiz

收录于

这是一篇关于UIUC大学在Coursera上开设的Text Retrieval and Search Engines课程第二周的测验内容。警告提示，硬性截止日期已过，现在尝试不会获得学分，但可以作为自我学习的实践。

低功耗蓝牙项目，需要一块懂省电的板

思澈 SF32LB52 芯片，BLE 协议栈深度优化，上手即开发

点击查看

Week 2 QuizHelp Center

Warning: The hard deadline has passed. You can attempt it, but you will not get credit for it. You are welcome to try it as a learning exercise.

In accordance with the Coursera Honor Code, I certify that the answers here are my own work.

Question 1

Suppose a query has a total of 4 relevant documents in the collection. System A and System B have each retrieved 10 documents, and the relevance status of the ranked lists is shown below:

	System A: [- + - - - - - - - -]
	System B: [+ + - - - - - - - -]

where the leftmost entry corresponds to the highest ranked document, and the rightmost entry corresponds to the lowest ranked document. A “+” indicates a relevant document and a “-” corresponds to a non-relevant one. For example, the top ranked document retrieved by System A is non-relevant, whereas the top ranked one by B is relevant.

What is the precision at 10 documents of both systems?

P(A) = 9/10 P(B)= 8/10

P(A) = 1/10 P(B)= 2/10

P(A) = 1/40 P(B)= 2/40

P(A) = 1/4 P(B)= 2/4

低功耗蓝牙项目，需要一块懂省电的板

思澈 SF32LB52 芯片，BLE 协议栈深度优化，上手即开发

点击查看