Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a Social Network thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a Social Network

Published on Oct 07, 20141702 Views

A topic propagating in a social network reaches its tipping point if the number of users discussing it in the network exceeds a critical threshold such that a wide cascade on the topic is likely to oc

Related categories

Chapter list

Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a Social Network00:00
Background - 100:16
Background - 200:24
Background - 300:34
Background - 400:38
Common Framework - 100:53
Common Framework - 201:17
Common Framework - 301:42
New Frontier01:54
Hot Topic - 102:07
Hot Topic - 202:29
Problem Definition02:56
An Example: Independent Cascade Model - 104:33
An Example: Independent Cascade Model - 204:56
An Example: Independent Cascade Model - 305:08
Nonsubmodularity of SM-PCG - 105:22
Nonsubmodularity of SM-PCG - 206:40
Nonsubmodularity of SM-PCG - 306:58
Nonsubmodularity of SM-PCG - 407:19
Nonsubmodularity of SM-PCG - 507:25
Nonsubmodularity of SM-PCG - 607:28
Nonsubmodularity of SM-PCG - 707:56
Idea08:02
Approximation Algorithm08:52
Analysis - 109:33
Analysis - 210:18
Experiments (Datasets)11:05
Experiments (Performance)11:13
Conclusion - 111:36
Conclusion - 212:17
Thank you13:04