{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:19:46Z","timestamp":1785543586114,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":75,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Singapore Ministry of Education Academic Research Fund Tier 3","award":["MOE2017-T3-1-007"],"award-info":[{"award-number":["MOE2017-T3-1-007"]}]},{"name":"Departmental Start-up Fund from the Department of Computer Science Hong Kong Baptist University"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599321","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:13:58Z","timestamp":1691172838000},"page":"2326-2336","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Efficient and Effective Edge-wise Graph Representation Learning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9757-4347","authenticated-orcid":false,"given":"Hewen","family":"Wang","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7284-3096","authenticated-orcid":false,"given":"Renchi","family":"Yang","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong SAR, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2190-7114","authenticated-orcid":false,"given":"Keke","family":"Huang","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0914-4580","authenticated-orcid":false,"given":"Xiaokui","family":"Xiao","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Learning edge representations via low-rank asymmetric projections. CIKM","author":"Abu-El-Haija Sami","year":"2017","unstructured":"Sami Abu-El-Haija , Bryan Perozzi , and Rami Al-Rfou . 2017. Learning edge representations via low-rank asymmetric projections. CIKM ( 2017 ), 1787--1796. Sami Abu-El-Haija, Bryan Perozzi, and Rami Al-Rfou. 2017. Learning edge representations via low-rank asymmetric projections. CIKM (2017), 1787--1796."},{"key":"e_1_3_2_2_2_1","volume-title":"Edge classification in networks","author":"Aggarwal Charu","unstructured":"Charu Aggarwal , Gewen He , and Peixiang Zhao . 2016. Edge classification in networks . In ICDE. IEEE , 1038--1049. Charu Aggarwal, Gewen He, and Peixiang Zhao. 2016. Edge classification in networks. In ICDE. IEEE, 1038--1049."},{"key":"e_1_3_2_2_3_1","unstructured":"Sambaran Bandyopadhyay Anirban Biswas M. N. Murty and Ramasuri Narayanam. 2019. Beyond Node Embedding: A Direct Unsupervised Edge Representation Framework for Homogeneous Networks. (2019). arXiv:1912.05140  Sambaran Bandyopadhyay Anirban Biswas M. N. Murty and Ramasuri Narayanam. 2019. Beyond Node Embedding: A Direct Unsupervised Edge Representation Framework for Homogeneous Networks. (2019). arXiv:1912.05140"},{"key":"e_1_3_2_2_4_1","volume-title":"Speech Recognition With Deep Recurrent Neural Networks","author":"Beil Jonas","year":"2015","unstructured":"Jonas Beil , Gernot Perner , and Tamim Asfour . 2015. Speech Recognition With Deep Recurrent Neural Networks . IEEE ICRR ( 2015 ), 119--124. arXiv:1412.3555v1 Jonas Beil, Gernot Perner, and Tamim Asfour. 2015. Speech Recognition With Deep Recurrent Neural Networks. IEEE ICRR (2015), 119--124. arXiv:1412.3555v1"},{"key":"e_1_3_2_2_5_1","volume-title":"Chawla","author":"Bielak Piotr","year":"2022","unstructured":"Piotr Bielak , Tomasz Kajdanowicz , and Nitesh V . Chawla . 2022 . AttrE2vec: Unsupervised attributed edge representation learning. Inf. Sci. (Ny) . 592 (may 2022), 82--96. arXiv:2012.14727 Piotr Bielak, Tomasz Kajdanowicz, and Nitesh V. Chawla. 2022. AttrE2vec: Unsupervised attributed edge representation learning. Inf. Sci. (Ny). 592 (may 2022), 82--96. arXiv:2012.14727"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Aleksandar Bojchevski Johannes Klicpera Bryan Perozzi Amol Kapoor Martin Blais Benedek R\u00f3zemberczki Michal Lukasik and Stephan G\u00fcnnemann. 2020. Scaling Graph Neural Networks with Approximate PageRank. In SIGKDD.  Aleksandar Bojchevski Johannes Klicpera Bryan Perozzi Amol Kapoor Martin Blais Benedek R\u00f3zemberczki Michal Lukasik and Stephan G\u00fcnnemann. 2020. Scaling Graph Neural Networks with Approximate PageRank. In SIGKDD.","DOI":"10.1145\/3394486.3403296"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Aleksandar Bojchevski Johannes Klicpera Bryan Perozzi Amol Kapoor Martin Blais Benedek R\u00f3zemberczki Michal Lukasik and Stephan G\u00fcnnemann. 2020. Scaling graph neural networks with approximate pagerank. In SIGKDD. 2464--2473.  Aleksandar Bojchevski Johannes Klicpera Bryan Perozzi Amol Kapoor Martin Blais Benedek R\u00f3zemberczki Michal Lukasik and Stephan G\u00fcnnemann. 2020. Scaling graph neural networks with approximate pagerank. In SIGKDD. 2464--2473.","DOI":"10.1145\/3394486.3403296"},{"key":"e_1_3_2_2_8_1","unstructured":"Shaked Brody Uri Alon and Eran Yahav. 2022. How Attentive are Graph Attention Networks?. In ICLR. arXiv:2105.14491  Shaked Brody Uri Alon and Eran Yahav. 2022. How Attentive are Graph Attention Networks?. In ICLR. arXiv:2105.14491"},{"key":"e_1_3_2_2_9_1","volume-title":"Scalable Graph Neural Networks via Bidirectional Propagation. NeurIPS 33","author":"Chen Ming","year":"2020","unstructured":"Ming Chen , Zhewei Wei , Bolin Ding , Yaliang Li , Ye Yuan , Xiaoyong Du , and Ji-Rong Wen . 2020. Scalable Graph Neural Networks via Bidirectional Propagation. NeurIPS 33 ( 2020 ). Ming Chen, Zhewei Wei, Bolin Ding, Yaliang Li, Ye Yuan, Xiaoyong Du, and Ji-Rong Wen. 2020. Scalable Graph Neural Networks via Bidirectional Propagation. NeurIPS 33 (2020)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0708838104"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2849727"},{"key":"e_1_3_2_2_12_1","unstructured":"Johannes Gasteiger Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR.  Johannes Gasteiger Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR."},{"key":"e_1_3_2_2_13_1","volume-title":"Matrix computations","author":"Golub Gene H","year":"1996","unstructured":"Gene H Golub and Charles F Van Loan . 1996. Matrix computations . Johns Hopkins University , Press ( 1996 ). Gene H Golub and Charles F Van Loan. 1996. Matrix computations. Johns Hopkins University, Press (1996)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00943"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable Feature Learning for Networks. 855--864.  Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable Feature Learning for Networks. 855--864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"e_1_3_2_2_18_1","volume-title":"Graph representation learning","author":"Hamilton William L","unstructured":"William L Hamilton . 2020. Graph representation learning . Morgan & Claypool Publishers . William L Hamilton. 2020. Graph representation learning. Morgan & Claypool Publishers."},{"key":"e_1_3_2_2_19_1","volume-title":"NIPS","volume":"1035","author":"Hamilton William L.","year":"2017","unstructured":"William L. Hamilton , Rex Ying , and Jure Leskovec . 2017 . Inductive representation learning on large graphs . In NIPS , Vol. 2017-Decem. 1025-- 1035 . arXiv:1706.02216 William L. Hamilton, Rex Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NIPS, Vol. 2017-Decem. 1025--1035. arXiv:1706.02216"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Taher H Haveliwala. 2002. Topic-sensitive PageRank. In WWW.  Taher H Haveliwala. 2002. Topic-sensitive PageRank. In WWW.","DOI":"10.1145\/511446.511513"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Glen Jeh and Jennifer Widom. 2003. Scaling personalized web search. In WWW. 271--279.  Glen Jeh and Jennifer Widom. 2003. Scaling personalized web search. In WWW. 271--279.","DOI":"10.1145\/775152.775191"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/369"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"John Jumper Richard Evans Alexander Pritzel Tim Green Michael Figurnov Olaf Ronneberger Kathryn Tunyasuvunakool Russ Bates Augustin ?\u00eddek Anna Potapenko etal 2021. Highly accurate protein structure prediction with AlphaFold. Nature 596 7873 (2021) 583--589.  John Jumper Richard Evans Alexander Pritzel Tim Green Michael Figurnov Olaf Ronneberger Kathryn Tunyasuvunakool Russ Bates Augustin ?\u00eddek Anna Potapenko et al. 2021. Highly accurate protein structure prediction with AlphaFold. Nature 596 7873 (2021) 583--589.","DOI":"10.1038\/s41586-021-03819-2"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00822"},{"key":"e_1_3_2_2_26_1","volume-title":"Proc. IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recognit. 2019-June (2019","author":"Kim Jongmin","year":"1905","unstructured":"Jongmin Kim , Taesup Kim , Sungwoong Kim , and Chang D. Yoo . 2019. Edge-labeling graph neural network for few-shot learning . Proc. IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recognit. 2019-June (2019 ), 11--20. arXiv: 1905 .01436 Jongmin Kim, Taesup Kim, Sungwoong Kim, and Chang D. Yoo. 2019. Edge-labeling graph neural network for few-shot learning. Proc. IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recognit. 2019-June (2019), 11--20. arXiv:1905.01436"},{"key":"e_1_3_2_2_27_1","volume-title":"Kingma and Jimmy Lei Ba","author":"Diederik","year":"2015","unstructured":"Diederik P. Kingma and Jimmy Lei Ba . 2015 . Adam : A method for stochastic optimization. In arXiv Prepr . arXiv1412.6980. arXiv. arXiv:1412.6980 Diederik P. Kingma and Jimmy Lei Ba. 2015. Adam: A method for stochastic optimization. In arXiv Prepr. arXiv1412.6980. arXiv. arXiv:1412.6980"},{"key":"e_1_3_2_2_28_1","volume-title":"ICLR 2017 (sep","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks . ICLR 2017 (sep 2017 ). Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. ICLR 2017 (sep 2017)."},{"key":"e_1_3_2_2_29_1","unstructured":"Johannes Klicpera Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2019. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR.  Johannes Klicpera Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2019. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/aic.690370209"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Srijan Kumar William L Hamilton Jure Leskovec and Dan Jurafsky. 2018. Community interaction and conflict on the web. In WWW. 933--943.  Srijan Kumar William L Hamilton Jure Leskovec and Dan Jurafsky. 2018. Community interaction and conflict on the web. In WWW. 933--943.","DOI":"10.1145\/3178876.3186141"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Srijan Kumar Xikun Zhang and Jure Leskovec. 2019. Predicting dynamic embedding trajectory in temporal interaction networks. In SIGKDD. ACM 1269--1278.  Srijan Kumar Xikun Zhang and Jure Leskovec. 2019. Predicting dynamic embedding trajectory in temporal interaction networks. In SIGKDD. ACM 1269--1278.","DOI":"10.1145\/3292500.3330895"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1247"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3122100"},{"key":"e_1_3_2_2_35_1","volume-title":"Graph Representation Learning of Banking Transaction Network with Edge Weight-Enhanced Attention and Textual Information. In WWW 2022 - Companion Proc. Web Conf.","author":"Minakawa Naoto","year":"2022","unstructured":"Naoto Minakawa , Kiyoshi Izumi , Hiroki Sakaji , and Hitomi Sano . 2022 . Graph Representation Learning of Banking Transaction Network with Edge Weight-Enhanced Attention and Textual Information. In WWW 2022 - Companion Proc. Web Conf. 2022. Association for Computing Machinery, Inc, 630--637. Naoto Minakawa, Kiyoshi Izumi, Hiroki Sakaji, and Hitomi Sano. 2022. Graph Representation Learning of Banking Transaction Network with Edge Weight-Enhanced Attention and Textual Information. In WWW 2022 - Companion Proc. Web Conf. 2022. Association for Computing Machinery, Inc, 630--637."},{"key":"e_1_3_2_2_36_1","volume-title":"To embed or not: network embedding as a paradigm in computational biology. Frontiers in genetics 10","author":"Nelson Walter","year":"2019","unstructured":"Walter Nelson , Marinka Zitnik , Bo Wang , Jure Leskovec , Anna Goldenberg , and Roded Sharan . 2019. To embed or not: network embedding as a paradigm in computational biology. Frontiers in genetics 10 ( 2019 ), 381. Walter Nelson, Marinka Zitnik, Bo Wang, Jure Leskovec, Anna Goldenberg, and Roded Sharan. 2019. To embed or not: network embedding as a paradigm in computational biology. Frontiers in genetics 10 (2019), 381."},{"key":"e_1_3_2_2_37_1","volume-title":"Asymmetric transitivity preserving graph embedding. KDD 13--17-Augu","author":"Ou Mingdong","year":"2016","unstructured":"Mingdong Ou , Peng Cui , Jian Pei , Ziwei Zhang , and Wenwu Zhu . 2016. Asymmetric transitivity preserving graph embedding. KDD 13--17-Augu ( 2016 ), 1105--1114. Mingdong Ou, Peng Cui, Jian Pei, Ziwei Zhang, and Wenwu Zhu. 2016. Asymmetric transitivity preserving graph embedding. KDD 13--17-Augu (2016), 1105--1114."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Bryan Perozzi Rami Al-Rfou and Steven Skiena. 2014. DeepWalk: online learning of social representations. 701--710.  Bryan Perozzi Rami Al-Rfou and Steven Skiena. 2014. DeepWalk: online learning of social representations. 701--710.","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_40_1","unstructured":"Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Chi Wang Kuansan Wang and Jie Tang. 2019. NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization. In The WebConf. 1509--1520.  Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Chi Wang Kuansan Wang and Jie Tang. 2019. NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization. In The WebConf. 1509--1520."},{"key":"e_1_3_2_2_41_1","unstructured":"Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Kuansan Wang and Jie Tang. 2018. Network embedding as matrix factorization: Unifying deepwalk line pte and node2vec. In WSDM. 459--467.  Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Kuansan Wang and Jie Tang. 2018. Network embedding as matrix factorization: Unifying deepwalk line pte and node2vec. In WSDM. 459--467."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783370"},{"key":"e_1_3_2_2_43_1","volume-title":"Bo-june Paul Hsu, and Kuansan Wang","author":"Sinha Arnab","year":"2015","unstructured":"Arnab Sinha , Zhihong Shen , Yang Song , Hao Ma , Darrin Eide , Bo-june Paul Hsu, and Kuansan Wang . 2015 . An overview of microsoft academic service (mas) and applications. In WWW. ACM , 243--246. Arnab Sinha, Zhihong Shen, Yang Song, Hao Ma, Darrin Eide, Bo-june Paul Hsu, and Kuansan Wang. 2015. An overview of microsoft academic service (mas) and applications. In WWW. ACM, 243--246."},{"key":"e_1_3_2_2_44_1","volume-title":"Introduction to linear algebra","author":"Strang Gilbert","unstructured":"Gilbert Strang , Gilbert Strang , Gilbert Strang , and Gilbert Strang . 1993. Introduction to linear algebra . Vol. 3 . Wellesley-Cambridge Press . Gilbert Strang, Gilbert Strang, Gilbert Strang, and Gilbert Strang. 1993. Introduction to linear algebra. Vol. 3. Wellesley-Cambridge Press."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_2_46_1","volume-title":"Social Network Extraction of Academic Researchers. In ICDM'07","author":"Tang Jie","year":"2007","unstructured":"Jie Tang , Duo Zhang , and Limin Yao . 2007 . Social Network Extraction of Academic Researchers. In ICDM'07 . 292--301. Jie Tang, Duo Zhang, and Limin Yao. 2007. Social Network Extraction of Academic Researchers. In ICDM'07. 292--301."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186120"},{"key":"e_1_3_2_2_49_1","volume-title":"Graph Attention Networks. In ICLR","author":"Veli\u010dkovi\u0107 Petar","year":"2017","unstructured":"Petar Veli\u010dkovi\u0107 , Guillem Cucurull , Arantxa Casanova , Adriana Romero , Pietro Li\u00f2 , and Yoshua Bengio . 2017 . Graph Attention Networks. In ICLR 2018. Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2017. Graph Attention Networks. In ICLR 2018."},{"key":"e_1_3_2_2_50_1","unstructured":"Petar Veli\u010dkovi\u0107 William Fedus William L Hamilton Pietro Li\u00f2 Yoshua Bengio and R Devon Hjelm. 2018. Deep Graph Infomax. In ICLR.  Petar Veli\u010dkovi\u0107 William Fedus William L Hamilton Pietro Li\u00f2 Yoshua Bengio and R Devon Hjelm. 2018. Deep Graph Infomax. In ICLR."},{"key":"e_1_3_2_2_51_1","first-page":"4","article-title":"Edge2vec: Edge-based Social Network Embedding","volume":"14","author":"Wang Changping","year":"2020","unstructured":"Changping Wang , Chaokun Wang , Zheng Wang , Xiaojun Ye , and Philip S. Yu . 2020 . Edge2vec: Edge-based Social Network Embedding . TKDE 14 , 4 (jul 2020), 1--24. Changping Wang, Chaokun Wang, Zheng Wang, Xiaojun Ye, and Philip S. Yu. 2020. Edge2vec: Edge-based Social Network Embedding. TKDE 14, 4 (jul 2020), 1--24.","journal-title":"TKDE"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"crossref","unstructured":"Hanzhi Wang Mingguo He Zhewei Wei Sibo Wang Ye Yuan Xiaoyong Du and Ji-Rong Wen. 2021. Approximate graph propagation. In SIGKDD. 1686--1696.  Hanzhi Wang Mingguo He Zhewei Wei Sibo Wang Ye Yuan Xiaoyong Du and Ji-Rong Wen. 2021. Approximate graph propagation. In SIGKDD. 1686--1696.","DOI":"10.1145\/3447548.3467243"},{"key":"e_1_3_2_2_53_1","volume-title":"A Generic Edge-Empowered Graph Convolutional Network via Node-Edge Mutual Enhancement. WWW","author":"Wang Pengyang","year":"2020","unstructured":"Pengyang Wang , Jiaping Gui , Zhengzhang Chen , Junghwan Rhee , Haifeng Chen , and Yanjie Fu. 2020. A Generic Edge-Empowered Graph Convolutional Network via Node-Edge Mutual Enhancement. WWW ( 2020 ), 2144--2154. Pengyang Wang, Jiaping Gui, Zhengzhang Chen, Junghwan Rhee, Haifeng Chen, and Yanjie Fu. 2020. A Generic Edge-Empowered Graph Convolutional Network via Node-Edge Mutual Enhancement. WWW (2020), 2144--2154."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.37"},{"key":"e_1_3_2_2_55_1","volume-title":"MIND: A Large-scale Dataset for News Recommendation. ACL, 3597--3606.","author":"Wu Fangzhao","year":"2020","unstructured":"Fangzhao Wu , Ying Qiao , Jiun-Hung Chen , Chuhan Wu , Tao Qi , Jianxun Lian , Danyang Liu , Xing Xie , Jianfeng Gao , Winnie Wu , and Ming Zhou . 2020 . MIND: A Large-scale Dataset for News Recommendation. ACL, 3597--3606. Fangzhao Wu, Ying Qiao, Jiun-Hung Chen, Chuhan Wu, Tao Qi, Jianxun Lian, Danyang Liu, Xing Xie, Jianfeng Gao, Winnie Wu, and Ming Zhou. 2020. MIND: A Large-scale Dataset for News Recommendation. ACL, 3597--3606."},{"key":"e_1_3_2_2_56_1","volume-title":"Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Q Weinberger.","author":"Wu Felix","year":"2019","unstructured":"Felix Wu , Amauri H Souza Jr , Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Q Weinberger. 2019 . Simplifying Graph Convolutional Networks. In ICML. Felix Wu, Amauri H Souza Jr, Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Q Weinberger. 2019. Simplifying Graph Convolutional Networks. In ICML."},{"key":"e_1_3_2_2_57_1","volume-title":"Christopher Fifty, Tao Yu, and Kilian Q. Weinberger.","author":"Wu Felix","year":"2019","unstructured":"Felix Wu , Tianyi Zhang , Amauri Holanda de Souza , Christopher Fifty, Tao Yu, and Kilian Q. Weinberger. 2019 . Simplifying graph convolutional networks. In arXiv. Felix Wu, Tianyi Zhang, Amauri Holanda de Souza, Christopher Fifty, Tao Yu, and Kilian Q. Weinberger. 2019. Simplifying graph convolutional networks. In arXiv."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_2_59_1","first-page":"3894","article-title":"Fast network embedding enhancement via high order proximity approximation","volume":"17","author":"Yang Cheng","year":"2017","unstructured":"Cheng Yang , Maosong Sun , Zhiyuan Liu , and Cunchao Tu . 2017 . Fast network embedding enhancement via high order proximity approximation .. In IJCAI , Vol. 17. 3894 -- 3900 . Cheng Yang, Maosong Sun, Zhiyuan Liu, and Cunchao Tu. 2017. Fast network embedding enhancement via high order proximity approximation.. In IJCAI, Vol. 17. 3894--3900.","journal-title":"IJCAI"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"crossref","unstructured":"Renchi Yang Jieming Shi Keke Huang and Xiaokui Xiao. 2022. Scalable and Effective Bipartite Network Embedding. In SIGMOD. 1977--1991.  Renchi Yang Jieming Shi Keke Huang and Xiaokui Xiao. 2022. Scalable and Effective Bipartite Network Embedding. In SIGMOD. 1977--1991.","DOI":"10.1145\/3514221.3517838"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377376"},{"key":"e_1_3_2_2_62_1","first-page":"670","article-title":"Homogeneous network embedding for massive graphs via reweighted personalized pagerank","volume":"13","author":"Yang Renchi","year":"2020","unstructured":"Renchi Yang , Jieming Shi , Xiaokui Xiao , Yin Yang , and Sourav S. Bhowmick . 2020 . Homogeneous network embedding for massive graphs via reweighted personalized pagerank . VLDB 13 , 5 (2020), 670 -- 683 . arXiv:1906.06826 Renchi Yang, Jieming Shi, Xiaokui Xiao, Yin Yang, and Sourav S. Bhowmick. 2020. Homogeneous network embedding for massive graphs via reweighted personalized pagerank. VLDB 13, 5 (2020), 670--683. arXiv:1906.06826","journal-title":"VLDB"},{"key":"e_1_3_2_2_63_1","first-page":"37","article-title":"Scaling attributed network embedding to massive graphs","volume":"14","author":"Yang Renchi","year":"2020","unstructured":"Renchi Yang , Jieming Shi , Xiaokui Xiao , Yin Yang , Juncheng Liu , and Sourav S. Bhowmick . 2020 . Scaling attributed network embedding to massive graphs . VLDB 14 , 1 (2020), 37 -- 49 . arXiv:2009.00826 Renchi Yang, Jieming Shi, Xiaokui Xiao, Yin Yang, Juncheng Liu, and Sourav S. Bhowmick. 2020. Scaling attributed network embedding to massive graphs. VLDB 14, 1 (2020), 37--49. arXiv:2009.00826","journal-title":"VLDB"},{"key":"e_1_3_2_2_64_1","first-page":"593","article-title":"NENN: Incorporate Node and Edge Features in Graph Neural Networks","volume":"129","author":"Yang Yulei","year":"2020","unstructured":"Yulei Yang and Dongsheng Li . 2020 . NENN: Incorporate Node and Edge Features in Graph Neural Networks . In Proc. Mach. Learn. Res. , Vol. 129. 593 -- 608 . Yulei Yang and Dongsheng Li. 2020. NENN: Incorporate Node and Edge Features in Graph Neural Networks. In Proc. Mach. Learn. Res., Vol. 129. 593--608.","journal-title":"Proc. Mach. Learn. Res."},{"key":"e_1_3_2_2_65_1","unstructured":"Yongyi Yang Tang Liu Yangkun Wang Jinjing Zhou Quan Gan Zhewei Wei Zheng Zhang Zengfeng Huang and David Wipf. 2021. Graph neural networks inspired by classical iterative algorithms. In ICML. PMLR 11773--11783.  Yongyi Yang Tang Liu Yangkun Wang Jinjing Zhou Quan Gan Zhewei Wei Zheng Zhang Zengfeng Huang and David Wipf. 2021. Graph neural networks inspired by classical iterative algorithms. In ICML. PMLR 11773--11783."},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"crossref","unstructured":"Yuan Yin and Zhewei Wei. 2019. Scalable Graph Embeddings via Sparse Transpose Proximities.  Yuan Yin and Zhewei Wei. 2019. Scalable Graph Embeddings via Sparse Transpose Proximities.","DOI":"10.1145\/3292500.3330860"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz718"},{"key":"e_1_3_2_2_69_1","volume-title":"Prone: Fast and scalable network representation learning. In IJCAI. 4278--4284.","author":"Zhang Jie","year":"2019","unstructured":"Jie Zhang , Yuxiao Dong , Yan Wang , Jie Tang , and Ming Ding . 2019 . Prone: Fast and scalable network representation learning. In IJCAI. 4278--4284. Jie Zhang, Yuxiao Dong, Yan Wang, Jie Tang, and Ming Ding. 2019. Prone: Fast and scalable network representation learning. In IJCAI. 4278--4284."},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"crossref","unstructured":"Xingyi Zhang Kun Xie Sibo Wang and Zengfeng Huang. 2021. Learning Based Proximity Matrix Factorization for Node Embedding. In SIGKDD. 2243--2253.  Xingyi Zhang Kun Xie Sibo Wang and Zengfeng Huang. 2021. Learning Based Proximity Matrix Factorization for Node Embedding. In SIGKDD. 2243--2253.","DOI":"10.1145\/3447548.3467296"},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"crossref","unstructured":"Ziwei Zhang Peng Cui Xiao Wang Jian Pei Xuanrong Yao and Wenwu Zhu. 2018. Arbitrary-order proximity preserved network embedding. In SIGKDD. 2778--2786.  Ziwei Zhang Peng Cui Xiao Wang Jian Pei Xuanrong Yao and Wenwu Zhu. 2018. Arbitrary-order proximity preserved network embedding. In SIGKDD. 2778--2786.","DOI":"10.1145\/3219819.3219969"},{"key":"e_1_3_2_2_72_1","volume-title":"Arbitrary-order proximity preserved network embedding. KDD","author":"Zhang Ziwei","year":"2018","unstructured":"Ziwei Zhang , Jian Pei , Peng Cui , Xuanrong Yao , Xiao Wang , and Wenwu Zhu . 2018. Arbitrary-order proximity preserved network embedding. KDD ( 2018 ), 2778--2786. Ziwei Zhang, Jian Pei, Peng Cui, Xuanrong Yao, Xiao Wang, and Wenwu Zhu. 2018. Arbitrary-order proximity preserved network embedding. KDD (2018), 2778--2786."},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00354"},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"crossref","unstructured":"Chang Zhou Yuqiong Liu Xiaofei Liu Zhongyi Liu and Jun Gao. 2017. Scalable graph embedding for asymmetric proximity. In AAAI. 2942--2948.  Chang Zhou Yuqiong Liu Xiaofei Liu Zhongyi Liu and Jun Gao. 2017. Scalable graph embedding for asymmetric proximity. In AAAI. 2942--2948.","DOI":"10.1609\/aaai.v31i1.10878"},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352127"}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Long Beach CA USA","acronym":"KDD '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599321","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:47Z","timestamp":1750178267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":75,"alternative-id":["10.1145\/3580305.3599321","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599321","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}