en
0.25
0.5
0.75
1.25
1.5
1.75
2
On the Permanence of Vertices in Network Communities
Published on Oct 07, 20142340 Views
Despite the prevalence of community detection algorithms, relatively less work has been done on understanding whether a network is indeed modular and how resilient the community structure is under per
Related categories
Chapter list
On the Permanence of Vertices in Network Communities00:00
Joint work of IIT Kharagpur and University of Nebraska00:10
Example - 100:22
Heuristic I01:52
Example - 202:26
Heuristic II03:39
Permanence - 104:13
Permanence - 205:43
Research Questions06:32
Test Suite of Networks08:21
Baseline Algorithms08:35
Permanence: A Better Community Scoring Function 08:48
Methodology08:57
Results10:19
Developing Community Detection Algorithm11:10
Major Limitations11:14
Community Detection Based on Maximizing Permanence11:42
Experimental Results12:11
LFR (µ = 0.1) vs. LFR (µ = 0.6) 12:30
Permanence is Nice13:22
Issues Related with Modularity Maximization13:51
Take Away14:18
Thank you14:59