coursera课程Text Retrieval and Search Engines之Week 2 Overview
Week 2 OverviewHelp Center
Week 2
On this page:
- Instructional Activities
- Time
- Goals and Objectives
- Key Phrases/Concepts
- Guiding Questions
- Readings and Resources
- Video Lectures
- Tips for Success
- Getting and Giving Help
Instructional Activities
Below is a list of the activities and assignments available to you this week. See the How to Pass the Class page to know which assignments pertain to the badge or badges you are pursuing. Click on the name of each activity for more detailed instructions.
| Relevant Badges | Activity | Due Date* | Estimated Time Required |
|---|---|---|---|
| Week 2 Video Lectures | Sunday, April 5 (Suggested) |
3 hours | |
![]() ![]() |
Programming Assignment Part 1 | Sunday, April 5 | 2-3 hours |
![]() ![]() |
Week 2 Quiz | Sunday, April 19 | ~0.5 hours |
* All deadlines are at 11:55 PM Central Time (time zone conversion) unless otherwise noted.
Time
This module will last 7 days and should take approximately 6 hours of dedicated time to complete, with its readings and assignments.
Goals and Objectives
After you actively engage in the learning experiences in this module, you should be able to:
- Explain what an inverted index is and how to construct it for a large set of text documents that do not fit into the memory.
- Explain how variable-length encoding can be used to compress integers and how unary coding and gamma-coding work.
- Explain how scoring of documents in response to a query can be done quickly by using an inverted index.
- Explain what Zipf’s law is.
- Explain what the Cranfield evaluation methodology is and how it works for evaluating a text retrieval system.
- Explain how to evaluate a set of retrieved documents and how to compute precision, recall, and F1.
- Explain how to evaluate a ranked list of documents.
- Explain how to compute and plot a precision-recall curve.
- Explain how to compute average precision and mean average precision (MAP).
- Explain how to evaluate a ranked list with multi-level relevance judgments.
- Explain how to compute normalized discounted cumulative gain.
- Explain why it is important to perform a statistical significance test.
Key Phrases/Concepts
Keep your eyes open for the following key terms or phrases as you complete the readings and interact with the lectures. These topics will help you better understand the content in this module.
- Inverted index; postings
- Binary coding; unary coding; gamma-coding; d-gap
- Zipf’s law
- Cranfield evaluation methodology
- Precision; recall
- Average precision; mean average precision (MAP); geometric mean average precision (gMAP)
- Reciprocal rank; mean reciprocal rank
- F-measure
- Normalized discounted cumulative gain (nDCG)
- Statistical significance test
Guiding Questions
Develop your answers to the following guiding questions while completing the readings and working on assignments throughout the week.
- What is the typical architecture of a text retrieval system?
- What is an inverted index?
- Why is it desirable for compressing an inverted index?
- How can we create an inverted index when the collection of documents does not fit into the memory?
- How can we leverage an inverted index to score documents quickly?
- Why is evaluation so critical for research and application development in text retrieval?
- How does Cranfield evaluation methodology work?
- How do we evaluate a set of retrieved documents?
- How do you compute precision, recall, and F1?
- How do we evaluate a ranked list of search results?
- How do you compute average precision? How do you compute mean average precision (MAP) and geometric mean average precision (gMAP)?
- What is mean reciprocal rank?
- Why is MAP more appropriate than precision at k documents when comparing two retrieval methods?
- Why is precision at k documents more meaningful than average precision from a user’s perspective?
- How can we evaluate a ranked list of search results using multi-level relevance judgments?
- How do you compute normalized discounted cumulative gain (nDCG)?
- Why is normalization necessary in nDCG? Does MAP need a similar normalization?
- Why is it important to perform a statistical significance test when we compare the retrieval accuracies of two search engine systems?
Readings and Resources
The following readings are optional:
- Mark Sanderson. "Test Collection Based Evaluation of Information Retrieval Systems." Foundations and Trends in Information Retrieval 4(4): 247-375 (2010).
- Ian H. Witten, Alistair Moffat, and Timothy C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images, Second Edition. Morgan Kaufmann, 1999.
Video Lectures
| Video Lecture | Lecture Notes | Transcript | Video Download | SRT Caption File | Forum |
|---|---|---|---|---|---|
2.1 Implementation of TR Systems(00:21:27) |
(28.3 MB) |
||||
2.2 System Implementation: Inverted Index Construction(00:18:21) |
(24.4 MB) |
||||
2.3 System Implementation: Fast Search(00:17:11) |
(23.0 MB) |
||||
2.4 Evaluation of TR Systems(00:10:10) |
(14.1 MB) |
||||
2.5 Evaluation of TR Systems: Basic Measures(00:12:54) |
(17.3 MB) |
||||
2.6 Evaluation of TR Systems: Evaluating a Ranked List - Part 1(00:15:51) |
(20.5 MB) |
||||
2.6 Evaluation of TR Systems: Evaluating a Ranked List - Part 2(00:10:01) |
(13.8 MB) |
||||
2.7 Evaluation of TR Systems: Multi-Level Judgements(00:10:48) |
(14.3 MB) |
||||
2.8 Evaluation of TR Systems: Practical Issues(00:15:14) |
(20.8 MB) |
Tips for Success
To do well this week, I recommend that you do the following:
- Review the video lectures a number of times to gain a solid understanding of the key questions and concepts introduced this week.
- When possible, provide tips and suggestions to your peers in this class. As a learning community, we can help each other learn and grow. One way of doing this is by helping to address the questions that your peers pose. By engaging with each other, we’ll all learn better.
- It’s always a good idea to refer to the video lectures and chapter readings we've read during this week and reference them in your responses. When appropriate, critique the information presented.
- Take notes while you read the materials and watch the lectures for this week. By taking notes, you are interacting with the material and will find that it is easier to remember and to understand. With your notes, you’ll also find that it’s easier to complete your assignments. So, go ahead, do yourself a favor; take some notes!
Getting and Giving Help
You can get/give help via the following means:
- Use the Learner Help Center to find information regarding specific technical problems. For example, technical problems would include error messages, difficulty submitting assignments, or problems with video playback. You can access the Help Center by clicking on theHelp Center link at the top right of any course page. If you cannot find an answer in the documentation, you can also report your problem to the Coursera staff by clicking on the Contact Us! link available on each topic's page within the Learner Help Center.
- Use the Content Issues forum to report errors in lecture video content, assignment questions and answers, assignment grading, text and links on course pages, or the content of other course materials. University of Illinois staff and Community TAs will monitor this forum and respond to issues.
As a reminder, the instructor is not able to answer emails sent directly to his account. Rather, all questions should be reported as described above.
from: https://class.coursera.org/textretrieval-001/wiki/Week2Overview
coursera课程Text Retrieval and Search Engines之Week 2 Overview的更多相关文章
- coursera课程Text Retrieval and Search Engines之Week 1 Overview
Week 1 OverviewHelp Center Week 1 On this page: Instructional Activities Time Goals and Objectives K ...
- coursera课程Text Retrieval and Search Engines之Week 3 Overview
Week 3 OverviewHelp Center Week 3 On this page: Instructional Activities Time Goals and Objectives K ...
- coursera课程Text Retrieval and Search Engines之Week 4 Overview
Week 4 OverviewHelp Center Week 4 On this page: Instructional Activities Time Goals and Objectives K ...
- 【Python学习笔记】Coursera课程《Using Databases with Python》 密歇根大学 Charles Severance——Week4 Many-to-Many Relationships in SQL课堂笔记
Coursera课程<Using Databases with Python> 密歇根大学 Week4 Many-to-Many Relationships in SQL 15.8 Man ...
- 【Python学习笔记】Coursera课程《Using Python to Access Web Data》 密歇根大学 Charles Severance——Week6 JSON and the REST Architecture课堂笔记
Coursera课程<Using Python to Access Web Data> 密歇根大学 Week6 JSON and the REST Architecture 13.5 Ja ...
- 【Python学习笔记】Coursera课程《Using Python to Access Web Data 》 密歇根大学 Charles Severance——Week2 Regular Expressions课堂笔记
Coursera课程<Using Python to Access Web Data > 密歇根大学 Charles Severance Week2 Regular Expressions ...
- Coursera课程下载和存档计划[转载]
上周三收到Coursera平台的群发邮件,大意是Coursera将在6月30号彻底关闭旧的课程平台,全面升级到新的课程平台上,一些旧的课程资源(课程视频.课程资料)将不再保存,如果你之前学习过相关的课 ...
- 【网页开发学习】Coursera课程《面向 Web 开发者的 HTML、CSS 与 Javascript》Week1课堂笔记
Coursera课程<面向 Web 开发者的 HTML.CSS 与 Javascript> Johns Hopkins University Yaakov Chaikin Week1 In ...
- 【DeepLearning学习笔记】Coursera课程《Neural Networks and Deep Learning》——Week2 Neural Networks Basics课堂笔记
Coursera课程<Neural Networks and Deep Learning> deeplearning.ai Week2 Neural Networks Basics 2.1 ...
随机推荐
- ASP.NET:MVC模板化机制
模版化的核心是定制ViewEngine.完整的模板化必须实现3个功能:1.网站的多套模版(razor)支持 2.模版的多样式(style)支持. 3.按需实现模版:没有实现的加载默认模版. 我们除了要 ...
- 【LOJ】#2062. 「HAOI2016」地图
题解 我对莫队真是一无所知 这个东西显然可以用圆方树转成一个dfs序列 然后呢,用莫队计算每个询问区间的每个数出现的次数,从而顺带计算每个数字的奇偶性 但是我们要查的数字也用一个范围,可以直接用分块维 ...
- 8-5 Wine trading in Gergovia Gergovia的酒交易 uva11054
等价转换思维题 题意: 直线上有n(2<=n<=100000)个等距的村庄 每个村庄要么买酒 要么卖酒 设第i个村庄对酒的需求量为ai 绝对值小于一千 其中ai大于0表示买酒 ...
- spring boot配置使用fastjson
一.前言 spring boot默认使用jackson来操作json数据,相比于jackson,fastjson更好用,功能也强大,所以这里记录一下在spring boot中配置使用fastjson的 ...
- 全局设置axios发送cookie(axios 默认不发送cookie)
import axios from 'axios' axios.defaults.withCredentials=true; 如图:
- 装部署VMware vSphere 5.5文档 (6-2) 为IBM x3850 X5服务器安装配置VMware ESXi
部署VMware vSphere 5.5 实施文档 ########################################################################## ...
- Navicat Premium 激活码 序列号。破解版。
韩梦飞沙 韩亚飞 313134555@qq.com yue31313 han_meng_fei_sha Navicat Premium 激活码 序列号.破解版.
- [BZOJ5287][HNOI2018]毒瘤(虚树DP)
暴力枚举非树边取值做DP可得75. 注意到每次枚举出一个容斥状态的时候,都要做大量重复操作. 建立虚树,预处理出虚树上两点间的转移系数.也可动态DP解决. 树上倍增.动态DP.虚树DP似乎是这种问题的 ...
- bzoj 3105
感觉这题出得真好. 我们将问题简化过后是这样的: 给定一个数集,找一个最大的非空子集(一个集合的大小是它的元素和)A,使得A不存在一个非空子集,其所有元素的异或和为0. 因为我们始终可以只选一个数,所 ...
- Mysql的学习随笔day1
关于mysql的基本语句 ps:[]是缺省 创建:CREATE DATABASE db.name CREATE TABLE name(列名,类型,[NULL])NOT NULL是不需要为空,NOT ...




2.1 Implementation of TR Systems