	Log in \| Register \|

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

A Scalable Pattern Mining Approach to Web Graph Compression with Communities

author: Greg Buehrer, Microsoft Research

You might be experiencing some problems with Your Video player.

*Slides*
0:00	A Scalable Pattern Mining Approach to Web Graph Compression with Communities
0:08	Motivation
0:51	Web Graph Compression
2:54	Our Approach Mine for Dense Bipartite Graphs
3:16	Virtual Node Miner
3:35	Finding Bipartite Graphs
5:49	Webgraph Compression via Probabilistic Itemset Mining
6:44	Step 1 - Clustering
7:11	Clustering (cont)
7:37	Clustering (cont)
8:52	Step 2 - Mining
9:38	Mining (cont)
9:58	Mining (cont)
10:46	Mining (cont)
12:16	Mining Stage (cont)
12:43	Mining (cont)
13:10	Empirical Evaluation
13:47	Compression Afforded by VNodes
14:11	Total Compression
14:35	Compression Comparison
14:55	Scalability
15:16	Total Compression
15:22	Scalability
15:28	Virtual Node Properties
15:57	Communities are far apart
16:50	Vs Traditional Mining
17:51	Take Home Message
18:39	Ongoing Work
19:15	Thanks!

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.