coursera课程Text Retrieval and Search Engines之Week 3 Overview
Week 3 OverviewHelp Center
Week 3
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 3 Video Lectures | Sunday, April 12 (suggested) |
3 hours | |
![]() ![]() |
Week 3 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 it should take approximately 6 hours of dedicated time to complete its readings and assignments.
Goals and Objectives
After you actively engage in the learning experiences in this module, you should be able to:
- Explain how to interpret p(R=1|q,d), and estimate it based on a large set of collected relevance judgments (or clickthrough information) about query q and document d.
- Explain how to interpret the conditional probability p(q|d) used for scoring documents in the query likelihood retrieval function.
- Explain Statistical Language Model and Unigram Language Model.
- Explain how to compute the maximum likelihood estimate of a Unigram Language Model.
- Explain how to use Unigram Language Models to discover semantically related words.
- Compute p(q|d) based on a given document language model p(w|d).
- Explain smoothing.
- Show that query likelihood retrieval function implements TF-IDF weighting if we smooth the document language model p(w|d) using the collection language model p(w|C) as a reference language model.
- Compute the estimate of p(w|d) using Jelinek-Mercer (JM) smoothing and Dirichlet Prior smoothing, respectively.
- Explain the similarity and differences in the three different kinds of feedback: relevance feedback, pseudo-relevance feedback, and implicit feedback.
- Explain how the Rocchio feedback algorithm works.
- Explain how the Kullback-Leibler (KL) divergence retrieval function generalizes the query likelihood retrieval function.
- Explain the basic idea of using a mixture model for feedback.
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.
- p(R=1|q,d) ; query likelihood, p(q|d)
- Statistical Language Model; Unigram Language Model
- Maximum likelihood estimate
- Background language model, collection language model, document language model
- Smoothing of Unigram Language Models
- Relation between query likelihood and TF-IDF weighting
- Linear interpolation (i.e., Jelinek-Mercer) smoothing
- Dirichlet Prior smoothing
- Relevance feedback, pseudo-relevance feedback, implicit feedback
- Rocchio
- Kullback-Leiber divergence (KL-divergence) retrieval function
- Mixture language model
Guiding Questions
Develop your answers to the following guiding questions while completing the readings and working on assignments throughout the week.
- Given a table of relevance judgments in the form of three columns (query, document, and binary relevance judgments), how can we estimate p(R=1|q,d)?
- How should we interpret the query likelihood conditional probability p(q|d)?
- What is a Statistical Language Model? What is a Unigram Language Model? How many parameters are there in a unigram language model?
- How do we compute the maximum likelihood estimate of the Unigram Language Model (based on a text sample)?
- What is a background language model? What is a collection language model? What is a document language model?
- Why do we need to smooth a document language model in the query likelihood retrieval model? What would happen if we don’t do smoothing?
- When we smooth a document language model using a collection language model as a reference language model, what is the probability assigned to an unseen word in a document?
- How can we prove that the query likelihood retrieval function implements TF-IDF weighting if we use a collection language model smoothing?
- How does linear interpolation (Jelinek-Mercer) smoothing work? What is the formula?
- How does Dirichlet Prior smoothing work? What is the formula?
- What are the similarity and difference between Jelinek-Mercer smoothing and Dirichlet Prior smoothing?
- What is relevance feedback? What is pseudo-relevance feedback? What is implicit feedback?
- How does Rocchio work? Why do we need to ensure that the original query terms have sufficiently large weights in feedback?
- What is the KL-divergence retrieval function? How is it related to the query likelihood retrieval function?
- What is the basic idea of the two-component mixture model for feedback?
Readings & Resources
Read ONLY Chapter 3 and part of Chapter 5 (pages 55–63)
- Zhai, ChengXiang. Statistical Language Models for Information Retrieval. Synthesis Lectures Series on Human Language Technologies. Morgan & Claypool Publishers, 2008.
Video Lectures
| Video Lecture | Lecture Notes | Transcript | Video Download | SRT Caption File | Forum |
|---|---|---|---|---|---|
3.1 Probabilistic Retrieval Model: Basic Idea(00:12:44) |
(17.1 MB) |
||||
3.2 Probabilistic Retrieval Model: Statistical Language Model (00:17:53) |
(24.3 MB) |
||||
3.3 Probabilistic Retrieval Model: Query Likelihood (00:12:07) |
(16.2 MB) |
||||
3.4 Probabilistic Retrieval Model: Statistical Language Model – Part 1 (00:12:15) |
(16.5 MB) |
||||
3.4 Probabilistic Retrieval Model: Statistical Language Model – Part 2(00:09:36) |
(13.5 MB) |
||||
3.5 Probabilistic Retrieval Model: Smoothing Methods – Part 1(00:09:54) |
(14.5 MB) |
||||
3.5 Probabilistic Retrieval Model: Smoothing Methods – Part 2(00:13:17) |
(18.4 MB) |
||||
3.6 Retrieval Methods: Feedback in Text Retrieval(00:06:49) |
(9.6 MB) |
||||
3.7 Feedback in Text Retrieval: Feedback in VSM (00:12:05) |
(16.7 MB) |
||||
3.8 Feedback in Text Retrieval: Feedback in LM (00:19:11) |
(26.4 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/Week3Overview
coursera课程Text Retrieval and Search Engines之Week 3 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 2 Overview
Week 2 OverviewHelp Center Week 2 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 ...
随机推荐
- bzoj 1879 容斥
暴力求容斥系数或者直接组合数求容斥系数都可以. #include<bits/stdc++.h> #define LL long long #define fi first #define ...
- hdoj2546 饭卡(DP,01背包)
题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=2546 思路 首先要判断卡里的钱是不是大于等于5元,如果不足5元,直接输出余额:如果大于等于5元,则先留 ...
- poj2387 Til the Cows Come Home(Dijkstra)
题目链接 http://poj.org/problem?id=2387 题意 有n个路标,编号1~n,输入路标编号及路标之间相隔的距离,求从路标n到路标1的最短路径(由于是无向图,所以也就是求从路标1 ...
- js javascript 原型链详解
看了许多大神的博文,才少许明白了js 中原型链的概念,下面给大家浅谈一下,顺便也是为了巩固自己 首先看原型链之前先来了解一下new关键字的作用,在许多高级语言中,new是必不可少的关键字,其作用是为了 ...
- GOF设计模式快速学习
这段时间,学习状态比较一般,空闲时基本都在打游戏,和研究如何打好游戏,终于通过戏命师烬制霸LOL,玩笑了.为了和"学习"之间的友谊小船不翻,决定对以往学习过的GOF设计模式做一个简 ...
- IdentityServer4之JWT签名(RSA加密证书)及验签
一.前言 在IdentityServer4中有两种令牌,一个是JWT和Reference Token,在IDS4中默认用的是JWT,那么这两者有什么区别呢? 二.JWT与Reference Token ...
- 深入理解ajax系列第七篇
前面的话 虽然ajax全称是asynchronous javascript and XML.但目前使用ajax技术时,传递JSON已经成为事实上的标准.因为相较于XML而言,JSON简单且方便.本文将 ...
- 验证码60s倒计时前端效果
<!doctype html> <html lang="en"> <head> <meta charset="UTF-8&quo ...
- 【贪心】【堆】Gym - 101775B - Scapegoat
题意:有n个事件,每个事件有一个严重程度,m个人(m>=n),你要让m个人去背锅,每个人只能背一个事件的锅,但是一个事件可以由很多人背.让你使得这m个人所承受的严重程度的方差最小化. 考虑一开始 ...
- 【推导】The 16th UESTC Programming Contest Preliminary L - Foxtrot
题意:有n瓶药剂,其中只有一瓶药剂有毒.让你用最少的小白鼠试出哪瓶有毒.你只有一次给任意只小白鼠各喂食任意种类药剂的机会. m只老鼠就能对应2^m种“生死状态”的组合,给每种状态分配一个种类的药剂,然 ...


3.1 Probabilistic Retrieval Model: Basic Idea