SCAN: A Structural Clustering Algorithm for Networks thumbnail
slide-image
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

SCAN: A Structural Clustering Algorithm for Networks

Published on Sep 14, 200715246 Views

Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of intra-cluster edges. W

Related categories

Chapter list

SCAN: A Structural Clustering Algorithm for Networks 00:03
Network Clustering Problem00:24
An Example of Networks01:00
A Social Network Model02:00
The Neighborhood of a Vertex03:09
Structure Similarity04:01
Structural Connectivity [1]04:51
Structure-Connected Clusters07:06
Algorithm pt 108:59
Algorithm pt 209:07
Algorithm pt 309:35
Algorithm pt 410:05
Algorithm pt 510:11
Algorithm pt 610:15
Algorithm pt 710:17
Algorithm pt 810:21
Algorithm pt 910:44