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

Disorder Inequality: A Combinatorial Approach to Nearest Neighbor Search

author:Yury Lifshits, Yahoo! Research
published: Feb. 25, 2008, recorded: February 2008, views: 241

You might be experiencing some problems with Your Video player.

Slides

Slides
0:00	Disorder Inequality: A Combinatorial Approach to Nearest Neighbor Search
0:12	Nearest Neighbors: an Example (1)
0:29	Nearest Neighbors: an Example (2)
0:40	Nearest Neighbors: an Example (3)
0:45	Nearest Neighbors
1:10	Contribution
1:47	Outline
1:51	Motivation
1:53	Similarity Search for the Web
2:19	Nearest Neighbors: Prior Work
2:37	Challenge: Separation Effect (1)
2:59	Challenge: Separation Effect (2)
3:50	Challenge: Separation Effect (3)
4:02	Combinatorial Framework
4:09	Comparison Oracle
5:13	Disorder Inequality (1)
6:01	Disorder Inequality (2)
6:16	Disorder Inequality (3)
7:04	Combinatorial Framework
7:23	Combinatorial Framework: FAQ
9:46	Combinatorial Framework: Pro & Contra (1)
11:33	Combinatorial Framework: Pro & Contra (2)
11:46	Disorder vs. Others
12:04	New Algorithms
12:11	Ranwalk Informally (1/2) (1)
12:44	Ranwalk Informally (1/2) (2)
12:50	Ranwalk Informally (1/2) (3)
13:00	Ranwalk Informally (1/2) (4)
13:03	Ranwalk Informally (1/2) (5)
13:05	Ranwalk Informally (1/2) (6)
13:16	Ranwalk Informally (2/2) (1)
13:32	Ranwalk Informally (2/2) (2)
13:44	Ranwalk Informally (2/2) (3)
13:54	Ranwalk Informally (2/2) (4)
14:08	Ranwalk Informally (2/2) (5)
14:17	Ranwalk Informally (2/2) (6)
15:38	Ranwalk Algorithm
16:08	Analysis of Ranwalk
16:35	Variation: Arwalk
17:11	Experiment
17:43	Directions for Further Research
17:46	Recent Results
19:02	Future of Combinatorial Framework
20:55	Sponsored Links
21:00	Summary (1)
21:01	Summary (2)
21:37	- Questions

Related content

Visitors who watched this lecture also watched...

03:21

K-nearest neighbor classification
5022 views - Antal van den Bosch, 2007

55:48

Web Information Management: Past, Present and Future
699 views - Hector Garcia-Molina, 2008

50:00

Fast, Exact Nearest Neighbor in Arbitrary Dimensions with a Cover Tree
1012 views - John Langford, 2004

24:40

Beyond Basic Faceted Search
227 views - Nadav Golbandi, 2008

26:18

Entropy of Search Logs: How Hard is Search? With Personalization? With Backoff?
531 views - Qiaozhu Mei, 2008

27:26

Ranking Web Sites with Real User Traffic
250 views - Mark Meiss, 2008

20:34

Can Social Bookmarks Improve Web Search?
725 views - Paul Heymann, 2008

25:37

Preferential Behavior in Online Groups
204 views - Jasmine Novak, 2008

55:10

Machine Reading at Web Scale
674 views - Oren Etzioni, 2008

26:41

On Placing Skips Optimally In Expectation
144 views - Alessandro Panconesi, 2008

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.

Lecture popularity: You need to login to cast your vote.

We are currently conducting a short survey. We value your feedback, and would appreciate if you took a few moments to respond to some questions. Click here to take the survey.