The Spanning Tree based Approach for Solving the Shortest Path Problem in Social Graphs

Andrei Eremeev, Georgiy Korneev, Alexander Semenov, Jari Veijalainen

Abstract

Nowadays there are many social media sites with a very large number of users. Users of social media sites and relationships between them can be modelled as a graph. Such graphs can be analysed using methods from social network analysis (SNA). Many measures used in SNA rely on computation of shortest paths between nodes of a graph. There are many shortest path algorithms, but the majority of them suits only for small graphs, or work only with road network graphs that are fundamentally different from social graphs. This paper describes an efficient shortest path searching algorithm suitable for large social graphs. The described algorithm extends the Atlas algorithm. The proposed algorithm solves the shortest path problem in social graphs modelling sites with over 100 million users with acceptable response time (50 ms per query), memory usage (less than 15 GB of the primary memory) and applicable accuracy (higher than 90% of the queries return exact result).

References

  1. API OK. (2015, February 15). Retrieved from API OK: https://apiok.ru/wiki/display/api/friends.get.
  2. One-NIO. (2015). Retrieved from One-NIO: https://github.com/odnoklassniki/one-nio.
  3. Stanford Network Analysis Project. (2015, May 14). Retrieved May 14, 2015, from http://snap.stanford.edu.
  4. Akiba, T., Hayashi, T., Nori, N., Iwata, Y., & Yoshida, Y. (2015). Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. In 29th AAAI Conference on Artificial Intelligence.
  5. Bach, M. J. (1986). The design of the UNIX operating system. Vol. 5. Englewood Cliffs: NJ: Prentice-Hall.
  6. Cao, L., Zhao, X., Zheng, H., & Zhao, B. Y. (2011). Atlas: Approximating shortest paths in social graphs. Santa Barbara: Tech. rep. 2011-09, Department of Computer Science, University of California.
  7. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to algorithms. Cambridge: MIT press.
  8. Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999). On power-law relationships of the internet topology. In ACM SIGCOMM Computer Communication Review 29, 4. ACM, 251-262.
  9. Greenwald, G., & MacAskill, E. (2013). NSA Prism program taps in to user data of Apple, Google and others. The Guardian, 7(6), 1-43.
  10. Harary, F. (1969). Graph theory. Reading, MA: AddisonWesley.
  11. Marcus, S., Moy, M., & Coffman, T. (2007). Social network analysis. Mining graph data, 443-467.
  12. Qi, Z., Xiao, Y., Shao, B., & Wang, H. (2013). Toward a distance oracle for billion-node graphs. Proceedings of the VLDB Endowment, 7(1), 61-72.
  13. Semenov, A. (2013). Principles of social media monitoring and analysis software. Jyväskylä Studies in Computing, 168.
  14. Semenov, A., & Veijalainen, J. (2013). A modelling framework for social media monitoring. International Journal of Web Engineering and Technology 8.3, 217- 249.
  15. Trove. (2015, February 13). Retrieved from High Performance Collections for Java: http:// trove.starlight-systems.com/
  16. Tumasjan, A., Sprenger, T. O., Sandner, P. G., & Welpe, I. M. (2010). Election Forecasts With Twitter: How 140 Characters Reflect the Political Landscape. Social Science Computer Review.
  17. Ugander, J., Karrer, B., Backstrom, L., & Marlow, C. (2011). The anatomy of the facebook social graph.
  18. Wang, H., Can, D., Kazemzadeh, A., Bar, F., & Narayanan, S. (2012). A system for real-time twitter sentiment analysis of 2012 US presidential election cycle. Proceedings of the ACL 2012 System Demonstrations. Association for Computational Linguistics.
  19. Wilson, C., Boe, B., Sala, A., Puttaswamy, K. P., & Zhao, B. Y. (2009). User interactions in social networks and their implications. In Proceedings of the 4th ACM European conference on Computer systems, 205-218.
  20. Zhang, Z. M., Salerno, J. J., & Yu, P. S. (2003). Applying data mining in investigating money laundering crimes. 9th ACM SIGKDD international conference on Knowledge discovery and data mining, 747-752.
Download


Paper Citation


in Harvard Style

Eremeev A., Korneev G., Semenov A. and Veijalainen J. (2016). The Spanning Tree based Approach for Solving the Shortest Path Problem in Social Graphs . In Proceedings of the 12th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 978-989-758-186-1, pages 42-53. DOI: 10.5220/0005859400420053


in Bibtex Style

@conference{webist16,
author={Andrei Eremeev and Georgiy Korneev and Alexander Semenov and Jari Veijalainen},
title={The Spanning Tree based Approach for Solving the Shortest Path Problem in Social Graphs},
booktitle={Proceedings of the 12th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2016},
pages={42-53},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005859400420053},
isbn={978-989-758-186-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 12th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - The Spanning Tree based Approach for Solving the Shortest Path Problem in Social Graphs
SN - 978-989-758-186-1
AU - Eremeev A.
AU - Korneev G.
AU - Semenov A.
AU - Veijalainen J.
PY - 2016
SP - 42
EP - 53
DO - 10.5220/0005859400420053