Matrix completion in network analysis
Duration: 45 mins 31 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
Description: |
Levina, E
Wednesday 27th June 2018 - 09:45 to 10:30 |
---|
Created: | 2018-06-28 13:16 |
---|---|
Collection: | Statistical scalability |
Publisher: | Isaac Newton Institute |
Copyright: | Levina, E |
Language: | eng (English) |
Distribution: | World (downloadable) |
Explicit content: | No |
Aspect Ratio: | 16:9 |
Screencast: | No |
Bumper: | UCS Default |
Trailer: | UCS Default |
Abstract: | Matrix completion is an active area of research in itself, and a natural tool to apply to network data, since many real networks are observed incompletely and/or with noise. However, developing matrix completion algorithms for networks requires taking into account the network structure. This talk will discuss three examples of matrix completion used for network tasks. First, we discuss the use of matrix completion for cross-validation on network data, a long-standing problem in network analysis. Two other examples focus on reconstructing incompletely observed networks, with structured missingness resulting from network sampling mechanisms. One scenario we consider is egocentric sampling, where a set of nodes is selected first and then their connections to the entire network are observed. Another scenario focuses on data from surveys, where people are asked to name a given number of friends. We show that matrix completion, when used appropriately, can generally be very helpful in solving network problems. |
---|
Available Formats
Format | Quality | Bitrate | Size | |||
---|---|---|---|---|---|---|
MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 662.31 MB | View | Download | |
WebM | 640x360 | 643.01 kbits/sec | 214.44 MB | View | Download | |
iPod Video | 480x270 | 522.11 kbits/sec | 174.06 MB | View | Download | |
MP3 | 44100 Hz | 249.74 kbits/sec | 83.35 MB | Listen | Download | |
Auto * | (Allows browser to choose a format it supports) |