	Log in \| Register \|

First ACM International Conference on Web Search and Data Mining - WSDM 2008

Crawl Ordering by Search Impact

author: Sandeep Pandey, Carnegie Mellon University

You might be experiencing some problems with Your Video player.

*Slides*
0:00	Crawl Ordering by Search Internet
0:20	Selecting Pages to Crawl Next
1:19	Crawlin Objective
2:03	Impact of Crawling Page p
3:14	Prestige ≠ Impact - 1
4:22	Prestige ≠ Impact - 2
4:52	Poor Correlation Between Prestige and Imapct
5:43	- Problem Formulation and Complexity
5:56	Ranking Crawled Pages
7:26	Ranking Crawled & Uncrawled Pages
8:04	Selecting Pages to Crawl
10:11	Complexity
10:59	- Our Approach
11:08	Relaxed Model - 1
11:39	Relaxed Model - 2
12:51	Three Hiccups - 1
14:16	Solution 1: Limit Number of Sketches
15:53	Three Hiccups - 2
15:56	Solution 2: Hybrid Impact Estimation
16:39	Experiments
17:59	Dataset - 1
18:37	Dataset - 2
19:13	Example - 1
19:46	Example - 2
20:06	Dataset - 2a
20:32	Related Work
21:20	- Questions

Lecture rating

People found this lecture:
Worth seeing
because it is:
Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.