The 18th European Conference on Machine Learning (ECML) and the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD)

An Algorithm to find OverlappingCommunity Structure in Networks

author: Steve Gregory, University of Bristol

You might be experiencing some problems with Your Video player.

*Slides*
0:00	CONGA: An Algorithm to Find Overlapping Community Structure in Networks
0:23	Network clustering (1)
0:47	Network clustering (2)
1:14	Network clustering (3)
1:55	Network clustering (4)
2:16	Overlapping clusters
2:50	The GN algorithm (1)
3:43	The GN algorithm (2)
4:46	Edge betweenness
5:19	Splitting vertices
6:00	Split betweenness (1)
7:30	Split betweenness (2)
8:49	The CONGA algorithm
10:12	Split betweenness (contd.)
11:19	Calculating split betweenness
12:24	Experiments
14:08	Results: CONGA vs. GN
15:31	Results: CONGA vs. others
17:09	Conclusions

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.