Reconstructing a cascade from temporal observations
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review
- F-Secure Corp.
temporal-consistency constraints. For the proposed problem we present three approximation algorithms. The best algorithm in terms of quality achieves a O(√k)-approximation guarantee, where k is the number of active nodes, while the most efficient algorithm has linearithmic running time, making it scalable to very large graphs. We evaluate our algorithms on real-world networks with both simulated and real cascades. Our results indicate that utilizing the available temporal information allows for more accurate cascade reconstruction. Furthermore, our objective leads to finding the “backbone”
of the cascade and it gives solutions of very high precision.
|Title of host publication||Proceedings of the 2018 SIAM International Conference on Data Mining|
|Publication status||Published - 2018|
|MoE publication type||A4 Article in a conference publication|
|Event||SIAM International Conference on Data Mining - San Diego, United States|
Duration: 3 May 2018 → 5 May 2018
|Conference||SIAM International Conference on Data Mining|
|Period||03/05/2018 → 05/05/2018|