{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:13:50Z","timestamp":1775913230448,"version":"3.50.1"},"reference-count":65,"publisher":"Association for Computing Machinery (ACM)","issue":"9","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:p>\n            In bipartite graph analysis, similarity measures play a pivotal role in various applications. Among existing metrics, the Bidirectional Hidden Personalized PageRank (BHPP) stands out for its superior query quality. However, the computational expense of BHPP remains a bottleneck. Existing approximation methods either demand significant matrix storage or incur prohibitive time costs. For example, current state-of-the-art methods require over 3 hours to process a single-source BHPP query on the real-world bipartite graph\n            <jats:italic>Orkut<\/jats:italic>\n            , which contains approximately 3 \u00d7 10\n            <jats:sup>8<\/jats:sup>\n            edges.\n          <\/jats:p>\n          <jats:p>\n            We introduce BIRD, a novel algorithm designed for answering single-source BHPP queries on weighted bipartite graphs. Through meticulous theoretical analysis, we demonstrate that BIRD significantly improves time complexity to\n            <jats:italic>\u00d5<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            ), as compared to the previous best one,\n            <jats:italic>\u00d5<\/jats:italic>\n            (\n            <jats:italic>m<\/jats:italic>\n            ), under typical relative error setting and constant failure probability. (\n            <jats:italic>n, m<\/jats:italic>\n            denote the number of nodes and edges respectively.) Extensive experiments confirm that BIRD outperforms existing baselines by orders of magnitude in large-scale bipartite graphs. Notably, our proposed method accomplishes a single-source BHPP query on\n            <jats:italic>Orkut<\/jats:italic>\n            using merely 7 minutes.\n          <\/jats:p>","DOI":"10.14778\/3665844.3665855","type":"journal-article","created":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T22:19:07Z","timestamp":1722982747000},"page":"2255-2268","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["BIRD: Efficient Approximation of Bidirectional Hidden Personalized PageRank"],"prefix":"10.14778","volume":"17","author":[{"given":"Haoyu","family":"Liu","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore"}]},{"given":"Siqiang","family":"Luo","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2024,8,6]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"[n.d.]. https:\/\/drive.google.com\/file\/d\/1s0D8yT9RSIKKzJynh34H9uEogUUB6_7A\/view?usp=sharing."},{"key":"e_1_2_1_2_1","unstructured":"2003. MovieLens 1M Dataset. https:\/\/grouplens.org\/datasets\/movielens."},{"key":"e_1_2_1_3_1","unstructured":"2006. AOL Query Logs. http:\/\/www.cim.mcgill.ca\/~dudek\/206\/Logs\/AOL-user-ct-collection."},{"key":"e_1_2_1_4_1","unstructured":"2010. Last.fm Dataset Version 1.2. http:\/\/ocelma.net\/MusicRecommendationDataset\/lastfm-360K.html."},{"key":"e_1_2_1_5_1","unstructured":"2012. KDD Cup 2012 Track 2. https:\/\/www.kaggle.com\/c\/kddcup2012-track2."},{"key":"e_1_2_1_6_1","unstructured":"2014. Amazon product data. https:\/\/jmcauley.ucsd.edu\/data\/amazon."},{"key":"e_1_2_1_7_1","unstructured":"2015. Avito Context Ad Clicks. https:\/\/www.kaggle.com\/c\/avito-context-ad-clicks\/data."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 18th ACM conference on Information and knowledge management. 10","author":"Anastasakos Tasos","year":"2009","unstructured":"Tasos Anastasakos, Dustin Hillard, Sanjay Kshetramade, and Hema Raghavan. 2009. A collaborative filtering approach to ad recommendation using the query-ad click graph. In Proceedings of the 18th ACM conference on Information and knowledge management. 10.1145\/1645953.1646267"},{"key":"e_1_2_1_9_1","volume-title":"Algorithms and Models for the Web-Graph: 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11--12, 2007. Proceedings 5. Springer, 150--165","author":"Andersen Reid","year":"2007","unstructured":"Reid Andersen, Christian Borgs, Jennifer Chayes, John Hopcraft, Vahab S Mirrokni, and Shang-Hua Teng. 2007. Local computation of pagerank contributions. In Algorithms and Models for the Web-Graph: 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11--12, 2007. Proceedings 5. Springer, 150--165."},{"key":"e_1_2_1_10_1","volume-title":"2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)","author":"Andersen Reid","year":"2006","unstructured":"Reid Andersen, Fan Chung, and Kevin Lang. 2006. Local graph partitioning using pagerank vectors. In 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). IEEE, 475--486."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 17th international conference on World Wide Web. 1177--1178","author":"Antonellis Ioannis","year":"2008","unstructured":"Ioannis Antonellis, Hector Garcia-Molina, and Chi-Chao Chang. 2008. Simrank++ query rewriting through link analysis of the clickgraph (poster). In Proceedings of the 17th international conference on World Wide Web. 1177--1178."},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1137\/050643799","article-title":"Monte Carlo methods in PageRank computation: When one iteration is sufficient","volume":"45","author":"Avrachenkov Konstantin","year":"2007","unstructured":"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.","journal-title":"SIAM J. Numer. Anal."},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the fifth ACM conference on Recommender systems. 333--336","author":"Bellogin Alejandro","year":"2011","unstructured":"Alejandro Bellogin, Pablo Castells, and Ivan Cantador. 2011. Precision-oriented evaluation of recommender systems: an algorithmic comparison. In Proceedings of the fifth ACM conference on Recommender systems. 333--336."},{"key":"e_1_2_1_14_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Charikar Moses","unstructured":"Moses Charikar, Kevin Chen, and Martin Farach-Colton. 2002. Finding frequent items in data streams. In International Colloquium on Automata, Languages, and Programming. Springer, 693--703."},{"key":"e_1_2_1_15_1","volume-title":"The World Wide Web Conference. 2637--2643","author":"Chen Chih-Ming","year":"2019","unstructured":"Chih-Ming Chen, Chuan-Ju Wang, Ming-Feng Tsai, and Yi-Hsuan Yang. 2019. Collaborative similarity embedding for recommender systems. In The World Wide Web Conference. 2637--2643."},{"key":"e_1_2_1_16_1","volume-title":"A course in probability theory","author":"Chung Kai Lai","unstructured":"Kai Lai Chung. 2001. A course in probability theory. Academic press."},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1038\/s42005-022-00856-9","article-title":"Meta-validation of bipartite network projections","volume":"5","author":"Cimini Giulio","year":"2022","unstructured":"Giulio Cimini, Alessandro Carra, Luca Didomenicantonio, and Andrea Zaccaria. 2022. Meta-validation of bipartite network projections. Communications Physics 5, 1 (2022), 76.","journal-title":"Communications Physics"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. 239--248","author":"Deng Hongbo","year":"2009","unstructured":"Hongbo Deng, Michael R Lyu, and Irwin King. 2009. A generalized co-hits algorithm and its application to bipartite graphs. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. 239--248."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of The Web Conference","author":"Dey Prasenjit","year":"2020","unstructured":"Prasenjit Dey, Kunal Goel, and Rahul Agrawal. 2020. P-Simrank: Extending Simrank to Scale-free bipartite networks. In Proceedings of The Web Conference 2020. 3084--3090."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 23rd international conference on World wide web. 349--360","author":"Epasto Alessandro","year":"2014","unstructured":"Alessandro Epasto, Jon Feldman, Silvio Lattanzi, Stefano Leonardi, and Vahab Mirrokni. 2014. Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs. In Proceedings of the 23rd international conference on World wide web. 349--360."},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1080\/15427951.2005.10129104","article-title":"Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments","volume":"2","author":"Fogaras D\u00e1niel","year":"2005","unstructured":"D\u00e1niel Fogaras, Bal\u00e1zs R\u00e1cz, K\u00e1roly Csalog\u00e1ny, and Tam\u00e1s Sarl\u00f3s. 2005. Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Mathematics 2, 3 (2005), 333--358.","journal-title":"Internet Mathematics"},{"key":"e_1_2_1_22_1","volume-title":"Fast and exact top-k search for random walk with restart. arXiv preprint arXiv:1201.6566","author":"Fujiwara Yasuhiro","year":"2012","unstructured":"Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuka, and Masaru Kitsuregawa. 2012. Fast and exact top-k search for random walk with restart. arXiv preprint arXiv:1201.6566 (2012)."},{"key":"e_1_2_1_23_1","unstructured":"Qian Ge Yu Liu Yinghao Zhao Yuetian Sun Lei Zou Yuxing Chen and Anqun Pan. [n.d.]. Efficient and Accurate SimRank-based Similarity Joins: Experiments Analysis and Improvement. ([n. d.])."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 11th international conference on World Wide Web. 517--526","author":"Haveliwala Taher H","year":"2002","unstructured":"Taher H Haveliwala. 2002. Topic-sensitive pagerank. In Proceedings of the 11th international conference on World Wide Web. 517--526."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963772"},{"key":"e_1_2_1_27_1","first-page":"1","article-title":"Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme","volume":"1","author":"Hou Guanhao","year":"2023","unstructured":"Guanhao Hou, Qintian Guo, Fangyuan Zhang, Sibo Wang, and Zhewei Wei. 2023. Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme. Proceedings of the ACM on Management of Data 1, 1 (2023), 1--26.","journal-title":"Proceedings of the ACM on Management of Data"},{"key":"e_1_2_1_28_1","volume-title":"The distribution of the flora in the alpine zone. 1. New phytologist 11, 2","author":"Jaccard Paul","year":"1912","unstructured":"Paul Jaccard. 1912. The distribution of the flora in the alpine zone. 1. New phytologist 11, 2 (1912), 37--50."},{"key":"e_1_2_1_29_1","volume-title":"IR evaluation methods for retrieving highly relevant documents. ACM SIGIR forum","author":"Jaervelin Kalervo","year":"2017","unstructured":"Kalervo Jaervelin and Jaana Kekaelaeinen. 2017. IR evaluation methods for retrieving highly relevant documents. ACM SIGIR forum (2017)."},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. 538--543","author":"Jeh Glen","year":"2002","unstructured":"Glen Jeh and Jennifer Widom. 2002. Simrank: a measure of structural-context similarity. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. 538--543."},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining. 10","author":"Koren Yehuda","year":"2008","unstructured":"Yehuda Koren. 2008. Factorization meets the neighborhood. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining. 10.1145\/1401890.1401944"},{"key":"e_1_2_1_32_1","volume-title":"MapReduce-Based SimRank Computation and Its Application in Social Recommender System. In 2013 IEEE International Congress on Big Data. 10","author":"Li Lina","year":"2013","unstructured":"Lina Li, Cuiping Li, Hong Chen, and Xiaoyong Du. 2013. MapReduce-Based SimRank Computation and Its Application in Social Recommender System. In 2013 IEEE International Congress on Big Data. 10.1109\/bigdata.congress.2013.26"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.14778\/3583140.3583150","article-title":"Zebra: When Temporal Graph Neural Networks Meet Temporal Personalized PageRank","volume":"16","author":"Li Yiming","year":"2023","unstructured":"Yiming Li, Yanyan Shen, Lei Chen, and Mingxuan Yuan. 2023. Zebra: When Temporal Graph Neural Networks Meet Temporal Personalized PageRank. Proceedings of the VLDB Endowment 16, 6 (2023), 1332--1345.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3589305","article-title":"Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches","volume":"1","author":"Liao Meihao","year":"2023","unstructured":"Meihao Liao, Rong-Hua Li, Qiangqiang Dai, Hongyang Chen, Hongchao Qin, and Guoren Wang. 2023. Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches. Proceedings of the ACM on Management of Data 1, 2 (2023), 1--26.","journal-title":"Proceedings of the ACM on Management of Data"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 2022 International Conference on Management of Data. 2048--2061","author":"Liao Meihao","year":"2022","unstructured":"Meihao Liao, Rong-Hua Li, Qiangqiang Dai, and Guoren Wang. 2022. Efficient personalized PageRank computation: A spanning forests sampling based approach. In Proceedings of the 2022 International Conference on Management of Data. 2048--2061."},{"key":"e_1_2_1_36_1","volume-title":"SCARA: scalable graph neural networks with feature-oriented optimization. arXiv preprint arXiv:2207.09179","author":"Liao Ningyi","year":"2022","unstructured":"Ningyi Liao, Dingheng Mo, Siqiang Luo, Xiang Li, and Pengcheng Yin. 2022. SCARA: scalable graph neural networks with feature-oriented optimization. arXiv preprint arXiv:2207.09179 (2022)."},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/s00778-023-00829-6","article-title":"Scalable decoupling graph neural network with feature-oriented optimization","volume":"33","author":"Liao Ningyi","year":"2024","unstructured":"Ningyi Liao, Dingheng Mo, Siqiang Luo, Xiang Li, and Pengcheng Yin. 2024. Scalable decoupling graph neural network with feature-oriented optimization. The VLDB Journal 33, 3 (2024), 667--683.","journal-title":"The VLDB Journal"},{"key":"e_1_2_1_38_1","volume-title":"The World Wide Web Conference. 1130--1141","author":"Liu Boge","year":"2019","unstructured":"Boge Liu, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang, and Jingren Zhou. 2019. Efficient (&alpha;, \u03b2)-core computation: An index-based approach. In The World Wide Web Conference. 1130--1141."},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. 195--204","author":"Liu Qin","year":"2016","unstructured":"Qin Liu, Zhenguo Li, John CS Lui, and Jiefeng Cheng. 2016. Powerwalk: Scalable personalized pagerank via random walks with vertex-centric decomposition. In Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. 195--204."},{"key":"e_1_2_1_40_1","volume-title":"Algorithms and Models for the Web Graph: 12th International Workshop, WAW 2015, Eindhoven, The Netherlands, December 10--11, 2015, Proceedings 12","author":"Lofgren Peter","year":"2015","unstructured":"Peter Lofgren, Siddhartha Banerjee, and Ashish Goel. 2015. Bidirectional pagerank estimation: From average-case to worst-case. In Algorithms and Models for the Web Graph: 12th International Workshop, WAW 2015, Eindhoven, The Netherlands, December 10--11, 2015, Proceedings 12. Springer, 164--176."},{"key":"e_1_2_1_41_1","volume-title":"Algorithms and Models for the Web Graph: 12th International Workshop, WAW 2015, Eindhoven, The Netherlands, December 10--11, 2015, Proceedings 12","author":"Lofgren Peter","year":"2015","unstructured":"Peter Lofgren, Siddhartha Banerjee, and Ashish Goel. 2015. Bidirectional pagerank estimation: From average-case to worst-case. In Algorithms and Models for the Web Graph: 12th International Workshop, WAW 2015, Eindhoven, The Netherlands, December 10--11, 2015, Proceedings 12. Springer, 164--176."},{"key":"e_1_2_1_42_1","volume-title":"Personalized pagerank to a target node. arXiv preprint arXiv:1304.4658","author":"Lofgren Peter","year":"2013","unstructured":"Peter Lofgren and Ashish Goel. 2013. Personalized pagerank to a target node. arXiv preprint arXiv:1304.4658 (2013)."},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. 1436--1445","author":"Lofgren Peter A","year":"2014","unstructured":"Peter A Lofgren, Siddhartha Banerjee, Ashish Goel, and Comandur 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."},{"key":"e_1_2_1_44_1","first-page":"1897","article-title":"BATON: Batch one-hop personalized PageRanks with efficiency and accuracy","volume":"32","author":"Luo Siqiang","year":"2019","unstructured":"Siqiang Luo, Xiaokui Xiao, Wenqing Lin, and Ben Kao. 2019. BATON: Batch one-hop personalized PageRanks with efficiency and accuracy. IEEE Transactions on Knowledge and Data Engineering 32, 10 (2019), 1897--1908.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_2_1_45_1","volume-title":"Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher and Eli Upfal. 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge university press."},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 1315--1324","author":"Mo Dingheng","year":"2021","unstructured":"Dingheng Mo and Siqiang Luo. 2021. Agenda: Robust personalized PageRanks in evolving graphs. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 1315--1324."},{"key":"e_1_2_1_47_1","unstructured":"Netflix. 2009. Netflix Prize Data Set. (2009). http:\/\/archive.ics.uci.edu\/ml\/datasets\/Netflix+Prize"},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining. 875--884","author":"Ohsaka Naoto","year":"2015","unstructured":"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."},{"key":"e_1_2_1_50_1","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.ins.2009.10.014","article-title":"Generalization of the Jensen inequality for pseudo-integral","volume":"180","author":"Pap Endre","year":"2010","unstructured":"Endre Pap and Mirjana \u0160trboja. 2010. Generalization of the Jensen inequality for pseudo-integral. Information Sciences 180, 4 (2010), 543--548.","journal-title":"Information Sciences"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1093\/gigascience\/giy014"},{"key":"e_1_2_1_52_1","volume-title":"Ahmed","author":"Rossi Ryan A.","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. https:\/\/networkrepository.com"},{"key":"e_1_2_1_53_1","volume-title":"2008 International Conference on Apperceiving Computing and Intelligence Analysis. IEEE, 198--202","author":"Shang Ming-Sheng","year":"2008","unstructured":"Ming-Sheng Shang, Yan Fu, and Duan-Bin Chen. 2008. Personal recommendation using weighted bipartite graph projection. In 2008 International Conference on Apperceiving Computing and Intelligence Analysis. IEEE, 198--202."},{"key":"e_1_2_1_54_1","volume-title":"Graph-Based Representations in Pattern Recognition: 11th IAPR-TC-15 International Workshop, GbRPR 2017, Anacapri, Italy, May 16--18, 2017, Proceedings 11","author":"Stauffer Michael","year":"2017","unstructured":"Michael Stauffer, Thomas Tschachtli, Andreas Fischer, and Kaspar Riesen. 2017. A survey on applications of bipartite graph edit distance. In Graph-Based Representations in Pattern Recognition: 11th IAPR-TC-15 International Workshop, GbRPR 2017, Anacapri, Italy, May 16--18, 2017, Proceedings 11. Springer, 242--252."},{"key":"e_1_2_1_55_1","doi-asserted-by":"crossref","first-page":"2949","DOI":"10.14778\/3611479.3611500","article-title":"Estimating Single-Node PageRank in \u00d5(min{dt, [EQUATION]}) Time","volume":"16","author":"Wang Hanzhi","year":"2023","unstructured":"Hanzhi Wang and Zhewei Wei. 2023. Estimating Single-Node PageRank in \u00d5(min{dt, [EQUATION]}) Time. Proceedings of the VLDB Endowment 16, 11 (2023), 2949--2961.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_2_1_56_1","volume-title":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 657--667","author":"Wang Hanzhi","year":"2020","unstructured":"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."},{"key":"e_1_2_1_57_1","volume-title":"Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks. PVLDB","author":"Wang Kai","year":"2019","unstructured":"Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, and Ying Zhang. 2019. Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks. PVLDB (2019)."},{"key":"e_1_2_1_58_1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.14778\/3021924.3021936","article-title":"Hubppr: effective indexing for approximate personalized pagerank","volume":"10","author":"Wang Sibo","year":"2016","unstructured":"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.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 505--514","author":"Wang Sibo","year":"2017","unstructured":"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."},{"key":"e_1_2_1_60_1","volume-title":"Proceedings of the 42nd international ACM SIGIR conference on Research and development in Information Retrieval. 165--174","author":"Wang Xiang","year":"2019","unstructured":"Xiang Wang, Xiangnan He, Meng Wang, Fuli Feng, and Tat-Seng Chua. 2019. Neural graph collaborative filtering. In Proceedings of the 42nd international ACM SIGIR conference on Research and development in Information Retrieval. 165--174."},{"key":"e_1_2_1_61_1","volume-title":"2017 14th Web Information Systems and Applications Conference (WISA). IEEE, 205--210","author":"Wang Xiuli","year":"2017","unstructured":"Xiuli Wang, Zhuoming Xu, Xiutao Xia, and Chengwang Mao. 2017. Computing user similarity by combining simrank++ and cosine similarities to improve collaborative filtering. In 2017 14th Web Information Systems and Applications Conference (WISA). IEEE, 205--210."},{"key":"e_1_2_1_62_1","volume-title":"Proceedings of the 2018 International Conference on Management of Data. 441--456","author":"Wei Zhewei","year":"2018","unstructured":"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."},{"key":"e_1_2_1_63_1","volume-title":"Proceedings of the 2021 International Conference on Management of Data. 1996--2008","author":"Wu Hao","year":"2021","unstructured":"Hao Wu, Junhao Gan, Zhewei Wei, and Rui Zhang. 2021. Unifying the global and local approaches: an efficient power iteration with forward push. In Proceedings of the 2021 International Conference on Management of Data. 1996--2008."},{"key":"e_1_2_1_64_1","volume-title":"Proceedings of the ACM Web Conference","author":"Yang Renchi","year":"2022","unstructured":"Renchi Yang. 2022. Efficient and Effective Similarity Search over Bipartite Graphs. In Proceedings of the ACM Web Conference 2022. 308--318."},{"key":"e_1_2_1_65_1","volume-title":"Proceedings of the 2022 International Conference on Management of Data. 1977--1991","author":"Yang Renchi","year":"2022","unstructured":"Renchi Yang, Jieming Shi, Keke Huang, and Xiaokui Xiao. 2022. Scalable and Effective Bipartite Network Embedding. In Proceedings of the 2022 International Conference on Management of Data. 1977--1991."},{"key":"e_1_2_1_66_1","volume-title":"2018 IEEE 34th International Conference on Data Engineering (ICDE). IEEE, 1132--1143","author":"Yoon Minji","year":"2018","unstructured":"Minji Yoon, Jinhong Jung, and U Kang. 2018. Tpa: Fast, scalable, and accurate method for approximate random walk with restart on billion scale graphs. In 2018 IEEE 34th International Conference on Data Engineering (ICDE). IEEE, 1132--1143."},{"key":"e_1_2_1_67_1","volume-title":"Proceedings of the 2024 IEEE 40th International Conference on Data Engineering.","author":"Zhu Zulun","year":"2024","unstructured":"Zulun Zhu, Sibo Wang, Siqiang Luo, Dingheng Mo, Wenqing Lin, and Chunbo Li. 2024. Personalized PageRanks over Dynamic Graphs-The Case for Optimizing Quality of Service. In Proceedings of the 2024 IEEE 40th International Conference on Data Engineering."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3665844.3665855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T22:22:12Z","timestamp":1722982932000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3665844.3665855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":65,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["10.14778\/3665844.3665855"],"URL":"https:\/\/doi.org\/10.14778\/3665844.3665855","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2024,5]]},"assertion":[{"value":"2024-08-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}