Abstract
Personalized PageRank (PPR) is a popular node proximity metric in graph mining and network research. A single-source PPR (SSPPR) query asks for the PPR value of each node on the graph. Due to its importance and wide applications, decades of efforts have been devoted to the efficient processing of SSPPR queries. Among existing algorithms, LocalPush is a fundamental method for SSPPR queries and serves as a cornerstone for subsequent algorithms. In LocalPush, a push operation is a crucial primitive operation, which distributes the probability at a node u to ALL u's neighbors via the corresponding edges. Although this push operation works well on unweighted graphs, unfortunately, it can be rather inefficient on weighted graphs. In particular, on unbalanced weighted graphs where only a few of these edges take the majority of the total weight among them, the push operation would have to distribute "insignificant" probabilities along those edges which just take the minor weights, resulting in expensive overhead.
To resolve this issue, in this paper, we propose the EdgePush algorithm, a novel method for computing SSPPR queries on weighted graphs. EdgePush decomposes the aforementioned push operations in edge-based push, allowing the algorithm to operate at the edge level granularity. As a result, it can flexibly distribute the probabilities according to edge weights. Furthermore, our EdgePush allows a fine-grained termination threshold for each individual edge, leading to a superior complexity over LocalPush. Notably, we prove that EdgePush improves the theoretical query cost of LocalPush by an order of up to O(n) when the graph's weights are unbalanced. Our experimental results demonstrate that EdgePush significantly outperforms state-of-the-art baselines in terms of query efficiency on large motif-based and real-world weighted graphs.
- [n.d.]. https://arxiv.org/pdf/2203.07937.pdf.Google Scholar
- [n.d.]. https://blockchair.com.Google Scholar
- [n.d.]. http://snap.stanford.edu/data.Google Scholar
- [n.d.]. http://law.di.unimi.it/datasets.php.Google Scholar
- [n.d.]. http://www.cs.cornell.edu/~arb/data/.Google Scholar
- [n.d.]. https://gz.blockchair.com/bitcoin-cash/transactions/.Google Scholar
- [n.d.]. http://snap.stanford.edu/mappr/code.html.Google Scholar
- Reid Andersen, Christian Borgs, Jennifer Chayes, John Hopcraft, Vahab S Mirrokni, and Shang-Hua Teng. 2007. Local computation of PageRank contributions. In International Workshop on Algorithms and Models for the Web-Graph. Springer, 150--165.Google Scholar
Cross Ref
- Reid Andersen, Christian Borgs, Jennifer Chayes, John Hopcroft, Kamal Jain, Vahab Mirrokni, and Shanghua Teng. 2008. Robust pagerank and locally computable spam detection features. In Proceedings of the 4th international workshop on Adversarial information retrieval on the web. 69--76.Google Scholar
Digital Library
- Reid Andersen, Fan R. K. Chung, and Kevin J. Lang. 2006. Local Graph Partitioning using PageRank Vectors. In FOCS. 475--486.Google Scholar
- Konstantin Avrachenkov, Nelly Litvak, Danil Nemirovsky, and Natalia Osipova. 2007. Monte Carlo methods in PageRank computation: When one iteration is sufficient. SIAM J. Numer. Anal. 45, 2 (2007), 890--904.Google Scholar
Digital Library
- Lars Backstrom and Jure Leskovec. 2011. Supervised random walks: predicting and recommending links in social networks. In Proceedings of the fourth ACM international conference on Web search and data mining. 635--644.Google Scholar
Digital Library
- Austin R Benson, Rediet Abebe, Michael T Schaub, Ali Jadbabaie, and Jon Kleinberg. 2018. Simplicial closure and higher-order link prediction. Proceedings of the National Academy of Sciences 115, 48 (2018), E11221--E11230.Google Scholar
Cross Ref
- Aleksandar Bojchevski, Johannes Klicpera, Bryan Perozzi, Amol Kapoor, Martin Blais, Benedek Rózemberczki, Michal Lukasik, and Stephan Günnemann. 2020. Scaling Graph Neural Networks with Approximate PageRank. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, NY, USA.Google Scholar
Digital Library
- Paolo Boldi, Marco Rosa, Massimo Santini, and Sebastiano Vigna. 2011. Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. In Proceedings of the 20th international conference on World Wide Web, Sadagopan Srinivasan, Krithi Ramamritham, Arun Kumar, M. P. Ravindra, Elisa Bertino, and Ravi Kumar (Eds.). ACM Press, 587--596.Google Scholar
Digital Library
- Paolo Boldi and Sebastiano Vigna. 2004. The WebGraph Framework I: Compression Techniques. In Proc. of the Thirteenth International World Wide Web Conference (WWW 2004). ACM Press, Manhattan, USA, 595--601.Google Scholar
Digital Library
- Ming Chen, Zhewei Wei, Bolin Ding, Yaliang Li, Ye Yuan, Xiaoyong Du, and Ji-Rong Wen. 2020. Scalable Graph Neural Networks via Bidirectional Propagation. arXiv preprint arXiv.2010.15421 (2020).Google Scholar
- Fan Chung and Olivia Simpson. 2015. Distributed algorithms for finding local clusters using heat kernel pagerank. In International Workshop on Algorithms and Models for the Web-Graph. Springer, 177--189.Google Scholar
Digital Library
- Fan Chung and Olivia Simpson. 2018. Computing heat kernel pagerank and a local clustering algorithm. European Journal of Combinatorics 68 (2018), 96--119.Google Scholar
Cross Ref
- Wei Feng and Jianyong Wang. 2012. Incorporating heterogeneous information for personalized tag recommendation in social tagging systems. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. 1276--1284.Google Scholar
Digital Library
- Dániel Fogaras, Balázs Rácz, Károly Csalogány, and Tamás Sarlós. 2005. Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Mathematics 2, 3 (2005), 333--358.Google Scholar
Cross Ref
- Kimon Fountoulakis, Farbod Roosta-Khorasani, Julian Shun, Xiang Cheng, and Michael W Mahoney. 2019. Variational perspective on local graph clustering. Mathematical Programming 174, 1--2 (2019), 553--573.Google Scholar
Digital Library
- Michael L Fredman and Dan E Willard. 1993. Surpassing the information theoretic bound with fusion trees. Journal of computer and system sciences 47, 3 (1993), 424--436.Google Scholar
Digital Library
- Yasuhiro Fujiwara, Makoto Nakatsuji, Takeshi Yamamuro, Hiroaki Shiokawa, and Makoto Onizuka. 2012. Efficient personalized pagerank with accuracy assurance. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. 15--23.Google Scholar
Digital Library
- Bin Gao, Tie-Yan Liu, Wei Wei, Taifeng Wang, and Hang Li. 2011. Semi-supervised ranking on very large graphs with rich metadata. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. 96--104.Google Scholar
Digital Library
- Qing Guo, Zhu Sun, Jie Zhang, Qi Chen, and Yin-Leng Theng. 2017. Aspect-aware point-of-interest recommendation with geo-social influence. In Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization. 17--22.Google Scholar
Digital Library
- Pankaj Gupta, Ashish Goel, Jimmy Lin, Aneesh Sharma, Dong Wang, and Reza Zadeh. 2013. Wtf: The who to follow service at twitter. In Proceedings of the 22nd international conference on World Wide Web. 505--514.Google Scholar
Digital Library
- Guanhao Hou, Xingguang Chen, Sibo Wang, and Zhewei Wei. 2021. Massively Parallel Algorithms for Personalized PageRank. PROCEEDINGS OF THE VLDB ENDOWMENT 14, 9 (2021), 1668--1680.Google Scholar
Digital Library
- Glen Jeh and Jennifer Widom. 2003. Scaling personalized web search. In Proceedings of the 12th international conference on World Wide Web. 271--279.Google Scholar
Digital Library
- Johannes Klicpera, Aleksandar Bojchevski, and Stephan Günnemann. 2019. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR.Google Scholar
- Kyle Kloster and David F Gleich. 2014. Heat kernel based community detection. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. 1386--1395.Google Scholar
Digital Library
- Donald E Knuth. 1998. The Art of computer programming,Volume3: Sorting and searching (1973). Google Scholar Google Scholar Digital Library Digital Library (1998).Google Scholar
- Raunak Kumar, Paul Liu, Moses Charikar, and Austin R Benson. 2020. Retrieving Top Weighted Triangles in Graphs. In Proceedings of the 13th International Conference on Web Search and Data Mining. 295--303.Google Scholar
Digital Library
- Preethi Lahoti, Gianmarco De Francisci Morales, and Aristides Gionis. 2017. Finding topical experts in Twitter via query-dependent personalized PageRank. In Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 017. 155--162.Google Scholar
Digital Library
- Jure Leskovec, Kevin J Lang, Anirban Dasgupta, and Michael W Mahoney. 2009. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics 6, 1 (2009), 29--123.Google Scholar
Cross Ref
- Dandan Lin, Raymond Chi-Wing Wong, Min Xie, and Victor Junqiu Wei. 2020. Index-Free Approach with Theoretical Guarantee for Efficient Random Walk with Restart Query. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE, 913--924.Google Scholar
- Wenqing Lin. 2019. Distributed algorithms for fully personalized pagerank on large graphs. In The World Wide Web Conference. 1084--1094.Google Scholar
Digital Library
- Peter Lofgren. 2015. EFFICIENT ALGORITHMS FOR PERSONALIZED PAGERANK. Ph.D. Dissertation. STANFORD UNIVERSITY.Google Scholar
- Peter Lofgren, Siddhartha Banerjee, and Ashish Goel. 2015. Bidirectional pagerank estimation: From average-case to worst-case. In International Workshop on Algorithms and Models for the Web-Graph. Springer, 164--176.Google Scholar
Digital Library
- Peter Lofgren, Siddhartha Banerjee, and Ashish Goel. 2016. Personalized pagerank estimation and search: A bidirectional approach. In Proceedings of the Ninth ACM International Conference on Web Search and Data Mining. 163--172.Google Scholar
Digital Library
- Peter Lofgren and Ashish Goel. 2013. Personalized pagerank to a target node. arXiv preprint arXiv 1304.4658 (2013).Google Scholar
- Peter A Lofgren, Siddhartha Banerjee, Ashish Goel, and C Seshadhri. 2014. Fast-ppr: Scaling personalized pagerank estimation for large graphs. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. 1436--1445.Google Scholar
Digital Library
- Siqiang Luo. 2019. Distributed pagerank computation: An improved theoretical study. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 33. 4496--4503.Google Scholar
Digital Library
- Andrew Y Ng, Michael I Jordan, and Yair Weiss. 2002. On spectral clustering: Analysis and an algorithm. In Advances in neural information processing systems. 849--856.Google Scholar
- Naoto Ohsaka, Takanori Maehara, and Ken-ichi Kawarabayashi. 2015. Efficient pagerank tracking in evolving networks. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 875--884.Google Scholar
Digital Library
- Lawrence Page, Sergey Bring, Rajeev Motwani, and Terry Wino grad. 1999. The PageRank citation ranking: bringing order to the web. (1999).Google Scholar
- Amish Das Sarma, Anise Bahaman Moll, Gopal Pandurangan, and Eli Upfal. 2013. Fast distributed pagerank computation. In International Conference on Distributed Computing and Networking. Springer, 11--26.Google Scholar
Cross Ref
- Daniel A Spielman and Shang-Hua Teng. 2004. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In STOC. 81--90.Google Scholar
- J Michael Steele. 2004. The Cauchy-Schwarz master class: an introduction to the art of mathematical inequalities. Cambridge University Press.Google Scholar
- Mikkel Thorup. 1995. Equivalence between sorting and priority queues. Technical Report. Citeseer.Google Scholar
- Chu Wang, Babak Samari, Vladimir G Kim, Siddhartha Chaudhuri, and Kaleem Siddiqi. 2020. Affinity graph supervision for visual recognition. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 8247--8255.Google Scholar
Cross Ref
- Hanzhi Wang, Zhewei Wei, Junhao Gan, Sibo Wang, and Zengfeng Huang. 2020. Personalized pagerank to a target node, revisited. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 657--667.Google Scholar
Digital Library
- Sibo Wang, Youze Tang, Xiaokui Xiao, Yin Yang, and Zengxiang Li. 2016. Hubppr: effective indexing for approximate personalized pagerank. Proceedings of the VLDB Endowment 10, 3 (2016), 205--216.Google Scholar
Digital Library
- Sibo Wang, Renchi Yang, Xiaokui Xiao, Zhewei Wei, and Yin Yang. 2017. FORA: simple and effective approximate single-source personalized pagerank. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 505--514.Google Scholar
Digital Library
- Zhewei Wei, Xiaodong He, Xiaokui Xiao, Sibo Wang, Shuo Shang, and Ji-Rong Wen. 2018. Topppr: top-k personalized pagerank queries with precision guarantees on large graphs. In Proceedings of the 2018 International Conference on Management of Data. 441--456.Google Scholar
Digital Library
- Hao Wu, Junhao Gan, Zhewei Wei, and Rui Zhang. 2021. Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push. arXiv preprint arXiv:2101.03652 (2021).Google Scholar
- Wenlei Xie, David Bindel, Alan Demers, and Johannes Gehrke. 2015. Edge-weighted personalized pagerank: Breaking a decade-old performance barrier. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1325--1334.Google Scholar
Digital Library
- Wenpu Xing and Ali Ghorbani. 2004. Weighted pagerank algorithm. In Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004. IEEE, 305--314.Google Scholar
Cross Ref
- Rakesh Kumar Yadav, Shekhar Verma, S Venkatesan, et al. 2021. Cross-covariance based affinity for graphs. Applied Intelligence 51, 6 (2021), 3844--3864.Google Scholar
Digital Library
- Carl Yang and Kevin Chang. 2019. Relationship profiling over social networks: Reverse smoothness from similarity to closeness. In Proceedings of the 2019 SIAM International Conference on Data Mining. SIAM, 342--350.Google Scholar
Cross Ref
- Jaewon Yang and Jure Leskovec. 2015. Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems 42, 1 (2015), 181--213.Google Scholar
Digital Library
- Lei Yang, Xiaohang Zhan, Dapeng Chen, Junjie Yan, Chen Change Loy, and Dahua Lin. 2019. Learning to cluster faces on an affinity graph. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 2298--2306.Google Scholar
Cross Ref
- Renchi Yang, Xiaokui Xiao, Zhewei Wei, SouravS Bhowmick, Jun Zhao, and Rong-Hua Li. 2019. Efficient estimation of heat kernel pagerank for local clustering. In Proceedings of the 2019 International Conference on Management of Data. 1339--1356.Google Scholar
Digital Library
- Jianfeng Ye, Qilin Li, Jinlong Yu, Xincheng Wang, and Huaming Wang. 2020. Affinity Learning Via Self-Supervised Diffusion for Spectral Clustering. IEEE Access 9 (2020), 7170--7182.Google Scholar
Cross Ref
- Hao Yin, Austin R Benson, Jure Leskovec, and David F Gleich. 2017. Local higher-order graph clustering. In Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining. 555--564.Google Scholar
Digital Library
- Weiren Yu and Julie McCann. 2016. Random walk with restart over dynamic graphs. In 2016 IEEE 16th International Conference on Data Mining (ICDM). IEEE, 589--598.Google Scholar
Cross Ref
- Hongyang Zhang, Peter Lofgren, and Ashish Goel. 2016. Approximate personalized pagerank on dynamic graphs. In Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. 1315--1324.Google Scholar
Digital Library
- Dengyong Zhou, Olivier Bousquet, Thomas Navin Lal, Jason Weston, and Bernhard Schölkopf. 2004. Learning with local and global consistency. Advances in neural information processing systems 16, 16 (2004), 321--328.Google Scholar
Digital Library
- Xiatian Zhu, Chen Change Loy, and Shaogang Gong. 2014. Constructing robust affinity graphs for spectral clustering. In Proceedings of the IEEE conference on computer vision and pattern recognition. 1450--1457.Google Scholar
Digital Library
- Yangbo Zhu, Shaozhi Ye, and Xing Li. 2005. Distributed PageRank computation based on iterative aggregation-disaggregation methods. In Proceedings of the 14th ACM international conference on Information and knowledge management. 578--585.Google Scholar
Digital Library
Index Terms
(auto-classified)Edge-based local push for personalized PageRank
Recommendations
Perfect edge domination and efficient edge domination in graphs
Let G = (V,E) be a finite and undirected graph without loops and multiple edges. An edge is said to dominate itself and any edge adjacent to it. A subset D of E is called a perfect edge dominating set if every edge of E \ D is dominated by exactly one ...
Neighbour sum distinguishing edge-weightings with local constraints
AbstractA k-edge-weighting of G is a mapping ω : E ( G ) ⟶ { 1 , … , k }. The edge-weighting of G naturally induces a vertex-colouring σ ω : V ( G ) ⟶ N given by σ ω ( v ) = ∑ u ∈ N G ( v ) ω ( v u ) for every v ∈ V ( G ). The edge-weighting ω ...
Edge connection based Canny edge detection algorithm
Double threshold method of traditional Canny operator detects the edge rely on the information of gradient magnitude, which has a lower edge connectivity and incomplete image information. Aiming at this problem, we proposed an edge detection algorithm ...






Comments