Advertisement

The Network-Untangling Problem: From Interactions to Activity Timelines

  • Polina RozenshteinEmail author
  • Nikolaj Tatti
  • Aristides Gionis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10534)

Abstract

In this paper we study a problem of determining when entities are active based on their interactions with each other. More formally, we consider a set of entities V and a sequence of time-stamped edges E among the entities. Each edge \((u,v,t)\in E\) denotes an interaction between entities u and v that takes place at time t. We view this input as a temporal network. We then assume a simple activity model in which each entity is active during a short time interval. An interaction (uvt) can be explained if at least one of u or v are active at time t. Our goal is to reconstruct the activity intervals, for all entities in the network, so as to explain the observed interactions. This problem, which we refer to as the network-untangling problem, can be applied to discover timelines of events from complex interactions among entities.

We provide two formulations for the network-untangling problem: (i) minimizing the total interval length over all entities, and (ii) minimizing the maximum interval length. We show that the sum problem is NP-hard, while, surprisingly, the max problem can be solved optimally in linear time, using a mapping to 2-SAT. For the sum problem we provide efficient and effective algorithms based on realistic assumptions. Furthermore, we complement our study with an evaluation on synthetic and real-world datasets, which demonstrates the validity of our concepts and the good performance of our algorithms.

Keywords

Temporal networks Complex networks Timeline reconstruction Vertex cover Linear programming 2-SAT 

Notes

Acknowledgements

This work was supported by the Tekes project “Re:Know,” the Academy of Finland project “Nestor” (286211), and the EC H2020 RIA project “SoBigData” (654024).

References

  1. 1.
    Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. IPL 14(4), 195 (1982)CrossRefzbMATHGoogle Scholar
  2. 2.
    Becker, H., Naaman, M., Gravano, L.: Beyond trending topics: Real-world event identification on Twitter. In: ICWSM (2011)Google Scholar
  3. 3.
    Bellman, R.: On the approximation of curves by line segments using dynamic programming. CACM 4(6), 284 (1961)CrossRefzbMATHGoogle Scholar
  4. 4.
    Cataldi, M., Di Caro, L., Schifanella, C.: Emerging topic detection on twitter based on temporal and social terms evaluation. In: MDMKDD (2010)Google Scholar
  5. 5.
    Fung, G.P.C., Yu, J.X., Yu, P.S., Lu, H.: Parameter free bursty events detection in text streams. In: VLDB (2005)Google Scholar
  6. 6.
    Gary, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness (1979)Google Scholar
  7. 7.
    Guha, S., Koudas, N., Shim, K.: Approximation and streaming algorithms for histogram construction problems. TODS 31(1), 396–438 (2006)CrossRefGoogle Scholar
  8. 8.
    He, D., Parker, D.S.: Topic dynamics: an alternative model of bursts in streams of topics. In: KDD (2010)Google Scholar
  9. 9.
    Holme, P., Saramäki, J.: Temporal networks. Phys. Rep. 519(3), 97–125 (2012)CrossRefGoogle Scholar
  10. 10.
    Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms, vol. 175. Addison-Wesley, Boston (1983)zbMATHGoogle Scholar
  11. 11.
    Ihler, A., Hutchins, J., Smyth, P.: Adaptive event detection with time-varying Poisson processes. In: KDD (2006)Google Scholar
  12. 12.
    Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of computer computations (1972)Google Scholar
  13. 13.
    Khot, S., Regev, O.: Vertex cover might be hard to approximate to within \(2-\varepsilon \). JCSS 74(3), 335–349 (2008)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Kleinberg, J.: Bursty and hierarchical structure in streams. DMKD 7(4), 373–397 (2003)MathSciNetGoogle Scholar
  15. 15.
    Lappas, T., Arai, B., Platakis, M., Kotsakos, D., Gunopulos, D.: On burstiness-aware search for document sequences. In: KDD (2009)Google Scholar
  16. 16.
    Leskovec, J., Backstrom, L., Kleinberg, J.: Meme-tracking and the dynamics of the news cycle. In: KDD (2009)Google Scholar
  17. 17.
    Mathioudakis, M., Koudas, N.: TwitterMonitor: trend detection over the Twitter stream. In: KDD (2010)Google Scholar
  18. 18.
    Meladianos, P., Nikolentzos, G., Rousseau, F., Stavrakas, Y., Vazirgiannis, M.: Degeneracy-based real-time sub-event detection in Twitter stream. In: ICWSM (2015)Google Scholar
  19. 19.
    Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239–280 (2016)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Shahaf, D., Guestrin, C., Horvitz, E.: Metro maps of science. In: KDD (2012)Google Scholar
  21. 21.
    Shahaf, D., Guestrin, C., Horvitz, E.: Trains of thought: generating information maps. In: WWW (2012)Google Scholar
  22. 22.
    Shahaf, D., Yang, J., Suen, C., Jacobs, J., Wang, H., Leskovec, J.: Information cartography: creating zoomable, large-scale maps of information. In: KDD (2013)Google Scholar
  23. 23.
    Vlachos, M., Meek, C., Vagena, Z., Gunopulos, D.: Identifying similarities, periodicities and bursts for online search queries. In: SIGMOD (2004)Google Scholar
  24. 24.
    Weng, J., Lee, B.S.: Event detection in Twitter. In: ICWSM (2011)Google Scholar
  25. 25.
    Yang, J., Leskovec, J.: Patterns of temporal variation in online media. In: WSDM (2011)Google Scholar
  26. 26.
    Zhu, Y., Shasha, D.: Efficient elastic burst detection in data streams. In: KDD (2003)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Polina Rozenshtein
    • 1
    Email author
  • Nikolaj Tatti
    • 1
  • Aristides Gionis
    • 1
  1. 1.HIITAalto UniversityEspooFinland

Personalised recommendations