Sign inSign up
Almost Linear-Time Algorithms for Adaptive Betweenness Centrality using Hypergraph Sketches thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Almost Linear-Time Algorithms for Adaptive Betweenness Centrality using Hypergraph Sketches

Published on Oct 07, 20141709 Views

Yuichi Yoshida

Betweenness centrality measures the importance of a vertex by quantifying the number of times it acts as a midpoint of the shortest paths between other vertices. This measure is widely used in network

Research Sessions

Related categories

Data MiningKnowledge Extraction

Chapter list

Almost Linear-Time Algorithms for Adaptive Betweenness Centrality Using Hypergraph Sketches00:00
Centrality00:05
Coverage centrality - 100:43
Coverage centrality - 201:03
Coverage centrality - 301:20
Coverage centrality - 401:24
Applications of CC / BC - 101:39
Applications of CC / BC - 202:09
Applications of CC / BC - 302:11
Applications of CC / BC - 402:16
Applications of CC / BC - 502:26
Applications of CC / BC - 602:28
Applications of CC / BC - 702:33
Adaptive centrality03:40
Our contributions - 104:38
Our contributions - 205:12
Rephrase the problem05:51
Our method: sketching by hypergraph - 107:19
Our method: sketching by hypergraph - 208:42
Correctness10:04
Experiments11:11
Centrality compared to the exact method11:16
Running time of computing adaptive CC - 112:03
Running time of computing adaptive CC - 212:57
Summary13:20