Week 2 OverviewHelp Center

Week 2

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

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

    Week 3 OverviewHelp Center Week 3 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. 修改linux系统编码

    方法1: vi   /etc/sysconfig/i18n 默认为: LANG="en_US.UTF-8"SYSFONT="latarcyrheb-sun16" ...

  2. 【原创】获取MySQL crash 时的core file

    最近有台服务器的MySQL经常crash,为了进一步定位问题,开启了mysql core file功能,开启步骤如下,供参考 [开启步骤] 1. my.cnf文件中增加2个配置选项 [mysqld] ...

  3. C#语法文本字面量

    C#语法文本字面量 在日常生活中,文本用来表示除了数字以外的内容.例如有一个叫“比尔”的人,他的职位为“科长”.那么,“比尔”和“科长”都可以称为文本.在计算机里,现实世界中的文本通常被称为字符和字符 ...

  4. H5 video标签视频加载存在的问题

    客户发现上传的视频无法播放,然后主管让我解决这个问题,这个页面不是我负责的,我看了代码,发现视频用的h5标签video标签加载视频.我看了没问题,然后 我先用ie浏览器打开,视频加载没问题.然后我给主 ...

  5. Django Template Language 模板语言

    一.标签 tags 1.普通变量 普通变量用{{ }} 变量名由数字.字母.下划线组成 点.在模板语言中用来获取对象相应的属性值 示例 {# 取variable中的第一个参数 #} {{ variab ...

  6. android viewStub

    韩梦飞沙  韩亚飞  313134555@qq.com  yue31313  han_meng_fei_sha 开发应用的时候,需要根据条件决定显示某个视图, 这个时候可以用ViewStub Stub ...

  7. UVA1378 A funny stone game

    博弈论. 就是有一堆石子你拿走一堆中的一个,然后再向后面两堆中加两个问胜负 i<j<=k 所以我们可以直接通过sg函数计算,考虑问题的奇偶性,如果这一位是奇的我们才考虑,偶的可以模仿 然后 ...

  8. Android MediaCodec 的实例化方法

    *由于作者水平限制,文中难免有错误和不恰当之处,望批评指正. *转载请注明出处:http://www.cnblogs.com/roger-yu/ MediaCodec的实例化方法主要有两种: 1.使用 ...

  9. UVALive 5059 C - Playing With Stones 博弈论Sg函数

    C - Playing With Stones Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu S ...

  10. git一些命令

    ************git基本命令***************git config --global user.name "xielehe" 设置名字git config - ...