Week 3 OverviewHelp Center

Week 3

On this page:

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)

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的更多相关文章

  1. 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 ...

  2. 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 ...

  3. 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 ...

  4. 【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 ...

  5. 【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 ...

  6. 【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 ...

  7. Coursera课程下载和存档计划[转载]

    上周三收到Coursera平台的群发邮件,大意是Coursera将在6月30号彻底关闭旧的课程平台,全面升级到新的课程平台上,一些旧的课程资源(课程视频.课程资料)将不再保存,如果你之前学习过相关的课 ...

  8. 【网页开发学习】Coursera课程《面向 Web 开发者的 HTML、CSS 与 Javascript》Week1课堂笔记

    Coursera课程<面向 Web 开发者的 HTML.CSS 与 Javascript> Johns Hopkins University Yaakov Chaikin Week1 In ...

  9. 【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 ...

随机推荐

  1. python和redis简单交互

    python和redis简单交互 1.安装redis模块 pip3 install redis 2.redis模块简单使用: # /usr/bin/env python3 import redis c ...

  2. 黑马程序员_java基础笔记(10)...JDK1.5的新特性

    —————————— ASP.Net+Android+IOS开发..Net培训.期待与您交流! —————————— 1:静态导入.2:for—each循环.3:自动装箱/拆箱.4:可变参数.5:枚举 ...

  3. 【Java】 Scanner类的几个方法

    通过 Scanner 类可以获取用户的输入,创建 Scanner 对象的基本语法如下: Scanner sc = new Scanner(System.in); nextInt().next()和ne ...

  4. python安装pip和使用pip安装Python库类比如pip安装beautifulsoup4

    初学Python时,看到很多不懂得东西,比如 pip, 是python 包管理工具,pip是easy_install的取代. Distribute是对标准库disutils模块的增强,我们知道disu ...

  5. Ionic Js三:下拉刷新

    在加载新数据的时候,我们需要实现下拉刷新效果,代码如下: HTML 代码 <body ng-app="starter" ng-controller="actions ...

  6. MySQL集群原理详解

    1. 为什么需要分布式数据库2. MySQL Cluster原理3. MySQL Cluster的优缺点4. MySQL Cluster国内应用5. 参考资料 1. 为什么需要分布式数据库 随着计算机 ...

  7. Little Elephant and Array 线段树

    题目:http://codeforces.com/problemset/problem/220/B 题意 给定一组数据,多次询问区间内某数字出现次数与该数字数值相同的数的个数 思路 一看到区间查询,就 ...

  8. Apache2.4使用require指令进行访问控制--允许或限制IP访问/通过User-Agent禁止不友好网络爬虫

    从Apache2.2.X到Apache2.4.X,在配置上稍微有点不同,需要特别注意.现在记录下关于访问控制的配置. 经过苦苦搜索,终于配置成功.参考了这篇文章:http://www.cnblogs. ...

  9. 监控 Linux 系统的 7 个命令行工具

    监控 Linux 系统的 7 个命令行工具: " 深入 关于Linux最棒的一件事之一是你能深入操作系统,来探索它是如何工作的,并寻找机会来微调性能或诊断问题.这里有一些基本的命令行工具,让 ...

  10. 【10.10校内测试】【线段树维护第k小+删除】【lca+主席树维护前驱后驱】

    贪心思想.将a排序后,对于每一个a,找到对应的删除m个后最小的b,每次更新答案即可. 如何删除才是合法并且最优的?首先,对于排了序的a,第$i$个那么之前就应该删除前$i-1$个a对应的b.剩下$m- ...