Handling oversampling in dynamic networks using link prediction

April 24, 2015 Β· Declared Dead Β· πŸ› ECML/PKDD

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Benjamin Fish, Rajmonda S. Caceres arXiv ID 1504.06667 Category cs.SI: Social & Info Networks Cross-listed cs.LG, physics.soc-ph Citations 15 Venue ECML/PKDD Last Checked 4 months ago
Abstract
Oversampling is a common characteristic of data representing dynamic networks. It introduces noise into representations of dynamic networks, but there has been little work so far to compensate for it. Oversampling can affect the quality of many important algorithmic problems on dynamic networks, including link prediction. Link prediction seeks to predict edges that will be added to the network given previous snapshots. We show that not only does oversampling affect the quality of link prediction, but that we can use link prediction to recover from the effects of oversampling. We also introduce a novel generative model of noise in dynamic networks that represents oversampling. We demonstrate the results of our approach on both synthetic and real-world data.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Social & Info Networks

Died the same way β€” πŸ‘» Ghosted