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. s12-day01-work02 python多级菜单展示

    README # README.md # day001-work-2 @南非波波 功能实现:多级菜单展示 流程图: ![](http://i.imgur.com/VTPPhZU.jpg) 程序实现: ...

  2. 【LOJ】#2028. 「SHOI2016」随机序列

    题解 我们发现只有从第一个往后数,用乘号联通的块是有贡献的 为什么,因为后面所有表达式 肯定会有 + ,还会有个-,贡献全都被抵消了 所以我们处理出前缀乘积,然后乘上表达式的方案数 答案就是\(\su ...

  3. Java访问者模式

    结构对象会遍历它自己所保存的聚集中的所有节点,在本系统中就是节点NodeA和NodeB.首先NodeA会被访问到,这个访问是由以下的操作组成的: (1)NodeA对象的接受方法accept()被调用, ...

  4. CROC 2016 - Elimination Round (Rated Unofficial Edition) E - Intellectual Inquiry dp

    E - Intellectual Inquiry 思路:我自己YY了一个算本质不同子序列的方法, 发现和网上都不一样. 我们从每个点出发向其后面第一个a, b, c, d ...连一条边,那么总的不同 ...

  5. 8-15 Shuffle uva12174

    题意: 你正在使用的音乐播放器有一个所谓的乱序功能,即随机打乱歌曲的播放顺序.假设一共有s首歌,则一开始会给这s首歌随机排序,全部播放完毕后再重新随机排序.继续播放,依此类推.注意,当s首歌播放完毕之 ...

  6. BigDecimal 两种方式

    第一种: Double a=0.06; Double b=0.01; BigDecimal addend = BigDecimal.valueOf(a); BigDecimal augend = Bi ...

  7. 【基础知识】ASP.NET[基础一(ashx)]

    一.ASP.NET介绍 1.ASP.NET包括: 一般处理程序(ashx):WebForm ( aspx ):MVC(Model view con~~): 2.ASP.NET的常用文件(重点): 1& ...

  8. 磁盘备份工具dcfldd

    磁盘备份工具dcfldd   dcfldd是Kali Linux自带的一款磁盘备份工具.该工具是dd工具的增强版,更适合渗透测试和安全领域.dcfldd提供实时哈希校验功能,确保数据的安全.同时,它还 ...

  9. python functools.wraps

    我们在使用装饰器的时候,有些函数的功能会丢失,比如func.__name__,func.__doc__,func.__module__ 比如下面这个例子: In [16]: def logged(fu ...

  10. [ 转载 ]学习笔记-深入剖析Java中的装箱和拆箱

    深入剖析Java中的装箱和拆箱 自动装箱和拆箱问题是Java中一个老生常谈的问题了,今天我们就来一些看一下装箱和拆箱中的若干问题.本文先讲述装箱和拆箱最基本的东西,再来看一下面试笔试中经常遇到的与装箱 ...