Abstract
Given a graph G, a source node s and a target node t, the discounted hitting time (DHT) of t with respect to s is the expected steps that a random walk starting from s visits t for the first time. For a query node s, the single-source DHT (SSDHT) query returns the top-k nodes with the highest DHT values from all nodes in G. SSDHT is widely adopted in many applications such as query suggestion, link prediction, local community detection, graph clustering and so on. However, existing methods for SSDHT suffer from high computational costs or no guaranty of the results. In this paper, we propose FBRW, an effective SSDHT algorithm to compute the value of DHT with guaranteed results. We convert DHT to the ratio of personalized PageRank values. By combining Forward Push, Backward propagation and Random Walk, FBRW first evaluates personalized PageRank values then returns DHT values with low time complexity. To our knowledge, this is the first time to compute SSDHT with personalized PageRank. Extensive experiments demonstrate that FBRW is significantly ahead of the existing methods with promising effectiveness at the same time.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Aggarwal, C.C. (ed.): Social Network Data Analytics. Springer, Boston (2011). https://doi.org/10.1007/978-1-4419-8462-3
Aldous, D., Fill, J.: Reversible Markov chains and random walks on graphs (1995)
Andersen, R., Borgs, C., Chayes, J., Hopcraft, J., Mirrokni, V.S., Teng, S.-H.: Local computation of PageRank contributions. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 150–165. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-77004-6_12
Andersen, R., Chung, F.R.K., Lang, K.J.: Local graph partitioning using PageRank vectors. In: FOCS, pp. 475–486 (2006)
Avrachenkov, K., Litvak, N., Nemirovsky, D., Smirnova, E., Sokol, M.: Quick detection of top-k personalized PageRank lists. In: Frieze, A., Horn, P., Prałat, P. (eds.) WAW 2011. LNCS, vol. 6732, pp. 50–61. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21286-4_5
Brand, M.: A random walks perspective on maximizing satisfaction and profit. In: SDM, pp. 12–19 (2005)
Chen, M., Liu, J., Tang, X.: Clustering via random walk hitting time on directed graphs. In: AAAI, vol. 8, pp. 616–621 (2008)
Chung, F.R.K., Lu, L.: Concentration inequalities and martingale inequalities: a survey. Internet Math. 3(1), 79–127 (2006)
Fogaras, D., Rácz, B., Csalogány, K., Sarlós, T.: Towards scaling fully personalized PageRank: algorithms, lower bounds, and experiments. Internet Math. 2(3), 333–358 (2005)
Guan, Z., Wu, J., Zhang, Q., Singh, A.K., Yan, X.: Assessing and ranking structural correlations in graphs. In: SIGMOD, pp. 937–948 (2011)
Gupta, M.S., Pathak, A., Chakrabarti, S.: Fast algorithms for topk personalized PageRank queries. In: WWW, pp. 1225–1226 (2008)
Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39–43 (1953)
Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inform. Sci. Technol. 58(7), 1019–1031 (2007)
Lofgren, P., Banerjee, S., Goel, A.: Personalized PageRank estimation and search: a bidirectional approach. In: WSDM, pp. 163–172 (2016)
Lofgren, P., Banerjee, S., Goel, A., Comandur, S.: FAST-PPR: scaling personalized PageRank estimation for large graphs. In: ACM SIGKDD, pp. 1436–1445 (2014)
Mei, Q., Zhou, D., Church, K.: Query suggestion using hitting time. In: CIKM, pp. 469–478 (2008)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)
Sarkar, P., Moore, A.W.: A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In: UAI, pp. 335–343 (2007)
Sarkar, P., Moore, A.W.: Fast nearest-neighbor search in disk-resident graphs. In: ACM SIGKDD, pp. 513–522 (2010)
Sarkar, P., Moore, A.W., Prakash, A.: Fast incremental proximity search in large graphs. In: ICML, pp. 896–903 (2008)
Wang, R., Wang, S., Zhou, X.: Parallelizing approximate single-source personalized PageRank queries on shared memory. VLDB J. 28(6), 923–940 (2019). https://doi.org/10.1007/s00778-019-00576-7
Wang, S., Tang, Y., Xiao, X., Yang, Y., Li, Z.: HubPPR: effective indexing for approximate personalized PageRank. PVLDB 10(3), 205–216 (2016)
Wang, S., et al.: Efficient algorithms for approximate single-source personalized PageRank queries. ACM Trans. Database Syst. 44(4), 18:1–18:37 (2019)
Wang, S., Yang, R., Xiao, X., Wei, Z., Yang, Y.: FORA: simple and effective approximate single-source personalized PageRank. In: ACM SIGKDD, pp. 505–514 (2017)
Wei, Z., et al.: PRSim: sublinear time SimRank computation on large power-law graphs. In: SIGMOD, pp. 1042–1059. ACM (2019)
Wei, Z., He, X., Xiao, X., Wang, S., Shang, S., Wen, J.: TopPPR: top-k personalized PageRank queries with precision guarantees on large graphs. In: SIGMOD, pp. 441–456 (2018)
Wu, Y., Jin, R., Li, J., Zhang, X.: Robust local community detection: on free rider effect and its elimination. PVLDB 8(7), 798–809 (2015)
Wu, Y., Jin, R., Zhang, X.: Fast and unified local search for random walk based k-nearest-neighbor query in large graphs. In: SIGMOD, pp. 1139–1150 (2014)
Zhang, C., Shou, L., Chen, K., Chen, G., Bei, Y.: Evaluating geo-social influence in location-based social networks. In: CIKM, pp. 1442–1451 (2012)
Zhang, W., Cheng, R., Kao, B.: Evaluating multi-way joins over discounted hitting time. In: ICDE, pp. 724–735 (2014)
Acknowledgments
This work was supported by National Key R&D Program of China (2018YFB1404401, 2018YFB1402701), NSFC (91646202).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Liu, K., Zhang, Y., Xing, C. (2020). An Efficient Approximate Algorithm for Single-Source Discounted Hitting Time Query. In: Nah, Y., Cui, B., Lee, SW., Yu, J.X., Moon, YS., Whang, S.E. (eds) Database Systems for Advanced Applications. DASFAA 2020. Lecture Notes in Computer Science(), vol 12114. Springer, Cham. https://doi.org/10.1007/978-3-030-59419-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-59419-0_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-59418-3
Online ISBN: 978-3-030-59419-0
eBook Packages: Computer ScienceComputer Science (R0)