Bayesian Hierarchical Community Discovery
32 mins 35 secs,
124.58 MB,
iPod Video
480x270,
29.97 fps,
44100 Hz,
522.02 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
Description: |
Teh, Y W (University of Oxford, University of Oxford)
Tuesday 26th July 2016 - 14:00 to 14:30 |
---|
Created: | 2016-07-28 15:17 |
---|---|
Collection: | Theoretical Foundations for Statistical Network Analysis |
Publisher: | Isaac Newton Institute |
Copyright: | Teh, Y W |
Language: | eng (English) |
Distribution: | World (downloadable) |
Explicit content: | No |
Aspect Ratio: | 16:9 |
Screencast: | No |
Bumper: | UCS Default |
Trailer: | UCS Default |
Abstract: | Co-author: Charles Blundell (Google DeepMind)
We propose an efficient Bayesian nonparametric model for discovering hierarchical community structure in social networks. Our model is a tree-structured mixture of potentially exponentially many stochastic blockmodels. We describe a family of greedy agglomerative model selection algorithms whose worst case scales quadratically in the number of vertices of the network, but independent of the number of communities. Our algorithms are two orders of magnitude faster than the infinite relational model, achieving comparable or better accuracy. Related Links http://papers.nips.cc/paper/5048-bayesian-hierarchical-community-discovery - NIPS paper page |
---|
Available Formats
Format | Quality | Bitrate | Size | |||
---|---|---|---|---|---|---|
MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 474.31 MB | View | Download | |
WebM | 640x360 | 607.51 kbits/sec | 145.06 MB | View | Download | |
iPod Video * | 480x270 | 522.02 kbits/sec | 124.58 MB | View | Download | |
MP3 | 44100 Hz | 249.75 kbits/sec | 59.66 MB | Listen | Download | |
Auto | (Allows browser to choose a format it supports) |