Community Structure Based Shortest Path Finding for Social Networks
With the rapid expansion of communication data, research about analyzing social networks has become a hotspot. Finding the shortest path (SP) in social networks can help us to investigate the potential social relationships. However, it is an arduous task, especially on large-scale problems. There have been many previous studies on the SP problem, but very few of them considered the peculiarity of social networks. This paper proposed a community structure based method to accelerate answering the SP problem of social networks during online queries. We devise a two-stage strategy to strike a balance between offline pre-computation and online consultations. Our goal is to perform fast and accurate online approximations. Experiments show that our method can instantly return the SP result while satisfying accuracy constraint.
KeywordsShortest path Social network Community structure
This work was supported in part by the National Nature Science Foundation of China under the grants 61702285 and 61772289, the Natural Science Foundation of Tianjin under the grants 17JCQNJC00200, and the Fundamental Research Funds for the Central Universities under the grants 63181317.
- 2.Gong, M., Li, G.: An efficient shortest path approach for social networks based on community structure. CAAI 1(1), 114–123 (2016)Google Scholar
- 6.Goldberg, A.V., Harrelson, C.: Computing the shortest path: A* search meets graph theory. In: 16th SODA, pp. 156–165 (2005)Google Scholar
- 7.Akiba, T., Sommer, C.: Shortest-path queries for complex networks: exploiting low tree-width outside the core. In: EDBT, pp. 144–155 (2012)Google Scholar
- 8.Qiao, M., Cheng, H.: Approximate shortest distance computing: a query-dependent local landmark scheme. In: 28th ICDE, pp. 462–473 (2012)Google Scholar
- 9.Tretyakov, K.: Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In: 20th CIKM, pp. 1785–1794 (2012)Google Scholar
- 11.Jiang, M.: Hop doubling label indexing for point-to-point distance querying on scale-free networks. PVLDB 7, 1203–1214 (2014)Google Scholar
- 12.Akiba, T., Iwata, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD, pp. 349–360 (2013)Google Scholar
- 13.Goldberg, A.V., Kaplan, H.: Reach for A* shortest path algorithms with preprocessing. In: 9th DIMACS Implementation Challenge, vol. 74, pp. 93–139 (2009)Google Scholar
- 15.Chechik, S.: Approximate distance oracle with constant query time. arXiv abs/1305.3314 (2013)Google Scholar
- 17.Potamias, M., Bonchi, F.: Fast shortest path distance estimation in large networks. In: CIKM, pp. 867–876 (2009)Google Scholar
- 19.Xie, J.: SLPA: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: ICDMW, pp. 344–349 (2012)Google Scholar
- 22.Hayashi, T., Akiba, T., Kawarabayashi, K.I.: Fully dynamic shortest-path distance query acceleration on massive networks. In: CIKM, pp. 1533–1542 (2016)Google Scholar