coursera课程Text Retrieval and Search Engines之Week 4 Overview
Week 4 OverviewHelp Center
Week 4
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 4 Video Lectures | Sunday, April 19 (suggested) | 3 hours | |
![]() ![]() |
Programming Assignment 2 | Sunday, April 26 | 2–3 hours |
![]() ![]() |
Week 4 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 some of the main general challenges in creating a web search engine.
- Explain what a web crawler is and what factors have to be considered when designing a web crawler.
- Explain the basic idea of Google File System (GFS).
- Explain the basic idea of MapReduce and how we can use it to build an inverted index in parallel.
- Explain how links on the web can be leveraged to improve search results.
- Explain how PageRank and HITS algorithms work.
- Explain the basic idea of using machine learning to combine multiple features for ranking documents (aka learning to rank).
- Explain how we can extend a retrieval system to perform content-based information filtering (recommendation).
- Explain how we can use a linear utility function to evaluate an information filtering system.
- Explain the basic idea of collaborative filtering.
- Explain how the memory-based collaborative filtering algorithm works.
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.
- Scalability, efficiency
- Spam
- Crawler, focused crawling, incremental crawling
- Google File System (GFS)
- MapReduce
- Link analysis, anchor text
- PageRank, HITS
- Learning to rank, features, logistic regression
- Content-based filtering
- Collaborative filtering
- Beta-gamma threshold learning
- Linear utility
- User profile
- Exploration-exploitation tradeoff
- Memory-based collaborative filtering
- Cold start
Guiding Questions
Develop your answers to the following guiding questions while completing the readings and working on assignments throughout the week.
- What are some of the general challenges in building a web search engine?
- What is a crawler? How can we implement a simple crawler?
- What is focused crawling? What is incremental crawling?
- What kind of pages should have a higher priority for recrawling in incremental crawling?
- What can we do if the inverted index doesn’t fit in any single machine?
- What’s the basic idea of Google File System (GFS)?
- How does MapReduce work? What are the two key functions that a programmer needs to implement when programming with a MapReduce framework?
- How can we use MapReduce to build an inverted index in parallel?
- What is anchor text? Why is it useful for improving search accuracy?
- What is a hub page? What is an authority page?
- What kind of web pages tend to receive high scores from PageRank?
- How can we interpret PageRank from the perspective of a random surfer “walking” on the web?
- How exactly do you compute PageRank scores?
- How does the HITS algorithm work?
- What’s the basic idea of learning to rank?
- How can logistic regression be used to combine multiple features for improving ranking accuracy of a search engine?
- What is content-based information filtering?
- How can we use a linear utility function to evaluate a filtering system? How should we set the coefficients in such a linear utility function?
- How can we extend a retrieval system to perform content-based information filtering?
- What is exploration-exploitation tradeoff?
- How does the beta-gamma threshold learning algorithm work?
- What is the basic idea of collaborative filtering?
- How does the memory-based collaborative filtering algorithm work?
- What is the “cold start” problem in collaborative filtering?
Readings and Resources
All the readings are available online
- For web search, read chapters 19, 20, and 21 of the following book:
Introduction to Information Retrieval, by Christopher D. Manning, Prabhakar Raghavan, and Hinrich Schuetze, Cambridge University Press, 2007.
- For beta-gamma threshold learning, read the following paper:
Threshold Calibration in CLARIT Adaptive Filtering, by ChengXiang Zhai, Peter Jansen, Emilia Stoica, Norbert Grot, David A. Evans, Proceedings of TREC 1998.
- For content-based filtering in general and memory-based collaborative filtering, read Chapters 3 & 4 of the following book:
Recommender Systems Handbook, by Francesco Ricci, Lior Rokach, Bracha Shapira, Paul B. Kantor, Springer 2011.
Video Lectures
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 link at the top right of any course page. If you can not 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/Week4Overview
coursera课程Text Retrieval and Search Engines之Week 4 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 3 Overview
Week 3 OverviewHelp Center Week 3 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 ...
随机推荐
- USACO 6.3 Cryptcowgraphy
CryptcowgraphyBrian Dean The cows of Farmer Brown and Farmer John are planning a coordinated escape ...
- hive将数据导致本地磁盘
hive -e "select * from wyp" >> local/wyp.txt 其中我更喜欢弄好临时表,然后交互式查询时让相关人员自己去按逻辑处理数据,最 ...
- Bootstrap进阶七:LESS语法详解
1.变量 2.混合 3.带参数混合 4.模式匹配和导引表达式 5.嵌套规则 6.运算 7.Color函数 8.Math函数 9.命名空间 10.作用域 11.注释 12.Importing 13.字符 ...
- hdu-1540线段树刷题
title: hdu-1540线段树刷题 date: 2018-10-18 19:55:21 tags: acm 刷题 categories: ACM-线段树 概述 哇,,,这道线段树的题可以说是到目 ...
- 理解URI
---恢复内容开始--- 参考 https://zh.wikipedia.org/wiki/%E7%BB%9F%E4%B8%80%E8%B5%84%E6%BA%90%E6%A0%87%E5%BF%97 ...
- python 文件内容修改替换操作
当我们读取文件中内容后,如果想要修改文件中的某一行或者某一个位置的内容,在python中是没有办法直接实现的,如果想要实现这样的操作只能先把文件所有的内容全部读取出来,然后进行匹配修改后写入到新的文件 ...
- Educational Codeforces Round 46 (Div 2) (A~G)
目录 Codeforces 1000 A.Codehorses T-shirts B.Light It Up C.Covered Points Count(差分) D.Yet Another Prob ...
- 王彪-20162321-Java程序设计与数据结构2nd-第十周学习总结
学习目标 讨论有向图和无向图 定义带权图并讨论它们的应用 定义图的广度优先遍历和深度优先遍历 定义最小生成树 讨论图的实现策略 书中图的基本定义 图是由结点及结点间的连接组成的,结点称为顶点,结点间的 ...
- SQL2008″Unable to read the list of previously registered servers on this system”
打开SQL2008,弹出”Unable to read the list of previously registered servers on this system”错误, 微软官方的解决方法:h ...
- PowerDesigner关系线显示名称
选中关联关系线,右击选择“格式”,打开如下窗口,将“Name” 选项进行勾选上即可. 参考: http://loginleft.iteye.com/blog/2400980




4.1. Web Search: Introduction & Web Crawler