Theoretical analysis of Link Analysis Ranking

author: Panayiotis Tsaparas, University of Helsinki

Categories

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

You might be experiencing some problems with Your Video player.

*Slides*
0:01	Theoretical analysis of Link Analysis Ranking
0:25	Link Analysis Ranking
1:33	Why theoretical analysis of Link Analysis Ranking?
2:29	Link Analysis Ranking algorithm
3:02	Popular LAR algorithms
4:04	Properties of Interest
5:00	Distance between LAR vectors
5:47	Distance between LAR vectors
6:18	Stability: graph distance
7:05	Stability
7:51	Stability: Results
8:10	Perturbations of PageRank
9:00	Instability of PageRank
9:55	Singular Value Decomposition
10:44	Singular Value Decomposition
11:32	Instability of HITS
12:40	Stability of HITS
13:11	Similarity
13:45	Similarity: Results
14:13	Product Graphs
15:36	Product Graphs
16:23	Product Graphs
16:58	HITS and InDegree on Product Graphs
17:56	Experiments with real web graphs
18:35	Monotonicity
19:35	Locality
20:32	Label Independence
20:54	Axiomatic characterization of the InDegree algorithm
21:40	Other work
22:02	Open questions
23:04	Thank you!

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.