A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation

Published on Jan 14, 20133395 Views

A key problem in statistics and machine learning is the determination of network structure from data. We consider the case where the structure of the graph to be reconstructed is known to be scale-fre

Related categories

Chapter list

A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation00:00
Scale-free: Heavy tailed degree distribution00:01
Key Ideas00:50
Gene network reconstructions02:31