Efficient and Decentralized PageRank Approximation in a P2P Web Search Network

author: Josiane Parreira, Max Planck Institute

Categories

Top: Computer Science: Web Mining
Top: Computer Science: Network Analysis

You might be experiencing some problems with Your Video player.

*Slides*
0:00	Efficient and Decentralized PageRank Approximation in a P2P Network
0:02	Outline
0:22	Motivation
0:30	Motivation
0:35	Motivation
0:49	Motivation
1:22	Related Work
2:01	JXP Algorithm
2:35	World Node
2:44	World Node
2:57	World Node
3:09	World Node
3:12	World Node
3:24	World Node
3:38	World Node
4:03	World Node
4:16	The Algorithm
4:41	The Algorithm
5:40	Example
5:57	Example
6:02	Example
6:26	Peer Selection Strategy
7:09	Peer Selection Strategy
7:22	Peer Selection Strategy
7:37	Peer Selection Strategy
8:35	MIPs
8:39	MIPs Example
8:46	Pre-meetings Strategy
10:43	Pre-meetings Strategy
11:07	Mathematical Analysis
12:04	Mathematical Analysis
13:12	Mathematical Analysis
13:32	Mathematical Analysis
14:49	Mathematical Analysis
15:02	Mathematical Analysis
15:36	Mathematical Analysis
15:58	Setup
16:04	Setup
17:42	Setup
18:21	Overall performance comparison
18:26	Overall performance comparison
18:30	JXP in P2P Search
19:22	Results
19:34	Conclusions and Ongoing Work

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.