en
0.25
0.5
0.75
1.25
1.5
1.75
2
Using Strong Triadic Closure to Characterize Ties in Social Networks
Published on Oct 07, 20142378 Views
In the past few years there has been an explosion of social networks in the online world. Users flock these networks, creating profiles and linking themselves to other individuals. Connecting online h
Related categories
Chapter list
Using Strong Triadic Closure to Characterize Ties in Social Networks00:00
Introduction - 100:14
Introduction - 200:45
Our Goal01:16
Problem Definition - 101:41
Strong Triadic Closure intuition - 101:58
Strong Triadic Closure intuition - 202:13
Strong Triadic Closure intuition - 302:30
Strong Triadic Closure intuition - 402:33
Strong Triadic Closure for graphs - 102:52
Strong Triadic Closure for graphs - 203:20
Problem Definition - 203:36
Algorithms04:20
Complexity04:22
Approximation04:35
Coverage04:58
Vertex Cover05:38
Dual Graph05:57
Minimum Vertex Cover - MinSTC06:33
Approximation Algorithms07:26
Experiments - 108:14
Experimental Goal08:20
Datasets08:34
Experiments - 208:58
Measuring Tie Strength - 109:23
Measuring Tie Strength - 210:08
The Strength of Weak Ties10:56
Datasets with known communities11:49
Weak Edges as Bridges12:24
Karate Club graph13:44
Conclusion - 113:56
Related Work13:56
Conclusion - 214:17
Thank you!14:52