Searching the Web with Low Space Approximations

author: Andras Benczur, Hungarian Academy of Sciences

You might be experiencing some problems with Your Video player.

*Slides*
0:00	Searching the Web with Low Space Approximations
0:24	Contents
1:12	What’s Common?
3:04	Personalized PageRank – Preliminaries and Sampling
5:48	Personalized PageRank – Rounding and Sketching
7:13	New results – Rounding and Sketching
9:14	SimRank – Preliminaries and Sampling
10:45	SimRank – Reduction to Personalized PageRank
12:52	SimRank Example
14:27	Singular Value Decomposition
16:18	Fast Relative Error SVD via Random Projections
18:12	The Core Idea – Approximate Matrix Products
19:22	The Core Idea – Approximate Matrix Products Cont’d
20:30	Conclusion
21:04	References
21:19	References Cont’d
21:34	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.