Fast Change Point Detection on Dynamic Social Networks

May 20, 2017 ยท Declared Dead ยท ๐Ÿ› International Joint Conference on Artificial Intelligence

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Yu Wang, Aniket Chakrabarti, David Sivakoff, Srinivasan Parthasarathy arXiv ID 1705.07325 Category cs.SI: Social & Info Networks Cross-listed cs.AI Citations 58 Venue International Joint Conference on Artificial Intelligence Last Checked 3 months ago
Abstract
A number of real world problems in many domains (e.g. sociology, biology, political science and communication networks) can be modeled as dynamic networks with nodes representing entities of interest and edges representing interactions among the entities at different points in time. A common representation for such models is the snapshot model - where a network is defined at logical time-stamps. An important problem under this model is change point detection. In this work we devise an effective and efficient three-step-approach for detecting change points in dynamic networks under the snapshot model. Our algorithm achieves up to 9X speedup over the state-of-the-art while improving quality on both synthetic and real world networks.
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