Progress on the connection between spectral embedding and network models used by the probability, statistics and machine-learning communities
58 mins 27 secs,
494.02 MB,
WebM
640x360,
29.97 fps,
44100 Hz,
1.12 Mbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Rubin-Delanchy, P
Thursday 1st March 2018 - 11:00 to 12:00 |
|---|
| Created: | 2018-03-01 14:08 |
|---|---|
| Collection: | Statistical scalability |
| Publisher: | Isaac Newton Institute |
| Copyright: | Rubin-Delanchy, P |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | In this talk, I give theoretical and methodological results, based on work spanning Johns Hopkins, the Heilbronn Institute for Mathematical Research, Imperial and Bristol, regarding the connection between various graph spectral methods and commonly used network models which are popular in the probability, statistics and machine-learning communities. An attractive feature of the results is that they lead to very simple take-home messages for network data analysis: a) when using spectral embedding, consider eigenvectors from both ends of the spectrum; b) when implementing spectral clustering, use Gaussian mixture models, not k-means; c) when interpreting spectral embedding, think of "mixtures of behaviour" rather than "distance". Results are illustrated with cyber-security applications. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.9 Mbits/sec | 836.00 MB | View | Download | |
| WebM * | 640x360 | 1.12 Mbits/sec | 494.02 MB | View | Download | |
| iPod Video | 480x270 | 492.43 kbits/sec | 210.75 MB | View | Download | |
| MP3 | 44100 Hz | 249.73 kbits/sec | 107.00 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||