{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T18:46:24Z","timestamp":1791485184363,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Shanghai Science and Technology Committee General Program","award":["22ZR1419900"],"award-info":[{"award-number":["22ZR1419900"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202172"],"award-info":[{"award-number":["62202172"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Pujiang Talent Program","award":["21PJ1402900"],"award-info":[{"award-number":["21PJ1402900"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,21]]},"DOI":"10.1145\/3583780.3614985","type":"proceedings-article","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T07:45:26Z","timestamp":1697874326000},"page":"3094-3103","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["MUSE: Multi-View Contrastive Learning for Heterophilic Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-3521-5997","authenticated-orcid":false,"given":"Mengyi","family":"Yuan","sequence":"first","affiliation":[{"name":"East China Normal University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2528-1518","authenticated-orcid":false,"given":"Minjie","family":"Chen","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0945-145X","authenticated-orcid":false,"given":"Xiang","family":"Li","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"international conference on machine learning. PMLR, 21--29","author":"Abu-El-Haija Sami","year":"2019","unstructured":"Sami Abu-El-Haija , Bryan Perozzi , Amol Kapoor , Nazanin Alipourfard , Kristina Lerman , Hrayr Harutyunyan , Greg Ver Steeg , and Aram Galstyan . 2019 . Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing . In international conference on machine learning. PMLR, 21--29 . Sami Abu-El-Haija, Bryan Perozzi, Amol Kapoor, Nazanin Alipourfard, Kristina Lerman, Hrayr Harutyunyan, Greg Ver Steeg, and Aram Galstyan. 2019. Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing. In international conference on machine learning. PMLR, 21--29."},{"key":"e_1_3_2_2_2_1","volume-title":"Proceedings of ICML workshop on unsupervised and transfer learning. JMLR Workshop and Conference Proceedings, 17--36","author":"Bengio Yoshua","year":"2012","unstructured":"Yoshua Bengio . 2012 . Deep learning of representations for unsupervised and transfer learning . In Proceedings of ICML workshop on unsupervised and transfer learning. JMLR Workshop and Conference Proceedings, 17--36 . Yoshua Bengio. 2012. Deep learning of representations for unsupervised and transfer learning. In Proceedings of ICML workshop on unsupervised and transfer learning. JMLR Workshop and Conference Proceedings, 17--36."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380214"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557478"},{"key":"e_1_3_2_2_6_1","volume-title":"International conference on machine learning. PMLR, 1725--1735","author":"Chen Ming","year":"2020","unstructured":"Ming Chen , Zhewei Wei , Zengfeng Huang , Bolin Ding , and Yaliang Li . 2020 b. Simple and deep graph convolutional networks . In International conference on machine learning. PMLR, 1725--1735 . Ming Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding, and Yaliang Li. 2020b. Simple and deep graph convolutional networks. In International conference on machine learning. PMLR, 1725--1735."},{"key":"e_1_3_2_2_7_1","volume-title":"International conference on machine learning. PMLR, 1597--1607","author":"Chen Ting","year":"2020","unstructured":"Ting Chen , Simon Kornblith , Mohammad Norouzi , and Geoffrey Hinton . 2020 a. A simple framework for contrastive learning of visual representations . In International conference on machine learning. PMLR, 1597--1607 . Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey Hinton. 2020a. A simple framework for contrastive learning of visual representations. In International conference on machine learning. PMLR, 1597--1607."},{"key":"e_1_3_2_2_8_1","volume-title":"Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997","author":"Gasteiger Johannes","year":"2018","unstructured":"Johannes Gasteiger , Aleksandar Bojchevski , and Stephan G\u00fcnnemann . 2018. Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997 ( 2018 ). Johannes Gasteiger, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997 (2018)."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_10_1","volume-title":"Inductive representation learning on large graphs. Advances in neural information processing systems","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton , Zhitao Ying , and Jure Leskovec . 2017. Inductive representation learning on large graphs. Advances in neural information processing systems , Vol. 30 ( 2017 ). Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. Advances in neural information processing systems, Vol. 30 (2017)."},{"key":"e_1_3_2_2_11_1","volume-title":"Semi-implicit graph variational auto-encoders. Advances in neural information processing systems","author":"Hasanzadeh Arman","year":"2019","unstructured":"Arman Hasanzadeh , Ehsan Hajiramezanali , Krishna Narayanan , Nick Duffield , Mingyuan Zhou , and Xiaoning Qian . 2019. Semi-implicit graph variational auto-encoders. Advances in neural information processing systems , Vol. 32 ( 2019 ). Arman Hasanzadeh, Ehsan Hajiramezanali, Krishna Narayanan, Nick Duffield, Mingyuan Zhou, and Xiaoning Qian. 2019. Semi-implicit graph variational auto-encoders. Advances in neural information processing systems, Vol. 32 (2019)."},{"key":"e_1_3_2_2_12_1","volume-title":"International conference on machine learning. PMLR, 4116--4126","author":"Hassani Kaveh","year":"2020","unstructured":"Kaveh Hassani and Amir Hosein Khasahmadi . 2020 . Contrastive multi-view representation learning on graphs . In International conference on machine learning. PMLR, 4116--4126 . Kaveh Hassani and Amir Hosein Khasahmadi. 2020. Contrastive multi-view representation learning on graphs. In International conference on machine learning. PMLR, 4116--4126."},{"key":"e_1_3_2_2_13_1","volume-title":"Reducing the dimensionality of data with neural networks. science","author":"Hinton Geoffrey E","year":"2006","unstructured":"Geoffrey E Hinton and Ruslan R Salakhutdinov . 2006. Reducing the dimensionality of data with neural networks. science , Vol. 313 , 5786 ( 2006 ), 504--507. Geoffrey E Hinton and Ruslan R Salakhutdinov. 2006. Reducing the dimensionality of data with neural networks. science, Vol. 313, 5786 (2006), 504--507."},{"key":"e_1_3_2_2_14_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma and Jimmy Ba . 2014 . Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014). Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_2_15_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016a. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 ( 2016 ). Thomas N Kipf and Max Welling. 2016a. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_2_16_1","volume-title":"Variational graph auto-encoders. arXiv preprint arXiv:1611.07308","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016b. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 ( 2016 ). Thomas N Kipf and Max Welling. 2016b. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)."},{"key":"e_1_3_2_2_17_1","volume-title":"International Conference on Machine Learning. PMLR, 13242--13256","author":"Li Xiang","year":"2022","unstructured":"Xiang Li , Renyu Zhu , Yao Cheng , Caihua Shan , Siqiang Luo , Dongsheng Li , and Weining Qian . 2022 . Finding global homophily in graph neural networks when meeting heterophily . In International Conference on Machine Learning. PMLR, 13242--13256 . Xiang Li, Renyu Zhu, Yao Cheng, Caihua Shan, Siqiang Luo, Dongsheng Li, and Weining Qian. 2022. Finding global homophily in graph neural networks when meeting heterophily. In International Conference on Machine Learning. PMLR, 13242--13256."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3134200"},{"key":"e_1_3_2_2_19_1","volume-title":"Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating. arXiv preprint arXiv:2211.14065","author":"Liu Yixin","year":"2022","unstructured":"Yixin Liu , Yizhen Zheng , Daokun Zhang , Vincent Lee , and Shirui Pan . 2022 . Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating. arXiv preprint arXiv:2211.14065 (2022). Yixin Liu, Yizhen Zheng, Daokun Zhang, Vincent Lee, and Shirui Pan. 2022. Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating. arXiv preprint arXiv:2211.14065 (2022)."},{"key":"e_1_3_2_2_20_1","volume-title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification? arXiv preprint arXiv:2109.05641","author":"Luan Sitao","year":"2021","unstructured":"Sitao Luan , Chenqing Hua , Qincheng Lu , Jiaqi Zhu , Mingde Zhao , Shuyuan Zhang , Xiao-Wen Chang , and Doina Precup . 2021. Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification? arXiv preprint arXiv:2109.05641 ( 2021 ). Sitao Luan, Chenqing Hua, Qincheng Lu, Jiaqi Zhu, Mingde Zhao, Shuyuan Zhang, Xiao-Wen Chang, and Doina Precup. 2021. Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification? arXiv preprint arXiv:2109.05641 (2021)."},{"key":"e_1_3_2_2_21_1","volume-title":"Is homophily a necessity for graph neural networks? arXiv preprint arXiv:2106.06134","author":"Ma Yao","year":"2021","unstructured":"Yao Ma , Xiaorui Liu , Neil Shah , and Jiliang Tang . 2021. Is homophily a necessity for graph neural networks? arXiv preprint arXiv:2106.06134 ( 2021 ). Yao Ma, Xiaorui Liu, Neil Shah, and Jiliang Tang. 2021. Is homophily a necessity for graph neural networks? arXiv preprint arXiv:2106.06134 (2021)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00662"},{"key":"e_1_3_2_2_23_1","volume-title":"Yu Lei, and Bo Yang.","author":"Pei Hongbin","year":"2020","unstructured":"Hongbin Pei , Bingzhe Wei , Kevin Chen-Chuan Chang , Yu Lei, and Bo Yang. 2020 . Geom-gcn : Geometric graph convolutional networks. arXiv preprint arXiv:2002.05287 (2020). Hongbin Pei, Bingzhe Wei, Kevin Chen-Chuan Chang, Yu Lei, and Bo Yang. 2020. Geom-gcn: Geometric graph convolutional networks. arXiv preprint arXiv:2002.05287 (2020)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380112"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403168"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"e_1_3_2_2_27_1","volume-title":"Collective classification in network data. AI magazine","author":"Sen Prithviraj","year":"2008","unstructured":"Prithviraj Sen , Galileo Namata , Mustafa Bilgic , Lise Getoor , Brian Galligher , and Tina Eliassi-Rad . 2008. Collective classification in network data. AI magazine , Vol. 29 , 3 ( 2008 ), 93--93. Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Galligher, and Tina Eliassi-Rad. 2008. Collective classification in network data. AI magazine, Vol. 29, 3 (2008), 93--93."},{"key":"e_1_3_2_2_28_1","volume-title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization. arXiv preprint arXiv:1908.01000","author":"Sun Fan-Yun","year":"2019","unstructured":"Fan-Yun Sun , Jordan Hoffmann , Vikas Verma , and Jian Tang . 2019 . Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization. arXiv preprint arXiv:1908.01000 (2019). Fan-Yun Sun, Jordan Hoffmann, Vikas Verma, and Jian Tang. 2019. Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization. arXiv preprint arXiv:1908.01000 (2019)."},{"key":"e_1_3_2_2_29_1","volume-title":"Breaking the limit of graph neural networks by improving the assortativity of graphs with local mixing patterns. arXiv preprint arXiv:2106.06586","author":"Suresh Susheel","year":"2021","unstructured":"Susheel Suresh , Vinith Budde , Jennifer Neville , Pan Li , and Jianzhu Ma. 2021. Breaking the limit of graph neural networks by improving the assortativity of graphs with local mixing patterns. arXiv preprint arXiv:2106.06586 ( 2021 ). Susheel Suresh, Vinith Budde, Jennifer Neville, Pan Li, and Jianzhu Ma. 2021. Breaking the limit of graph neural networks by improving the assortativity of graphs with local mixing patterns. arXiv preprint arXiv:2106.06586 (2021)."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_2_31_1","volume-title":"Graph auto-encoder via neighborhood wasserstein reconstruction. arXiv preprint arXiv:2202.09025","author":"Tang Mingyue","year":"2022","unstructured":"Mingyue Tang , Carl Yang , and Pan Li. 2022. Graph auto-encoder via neighborhood wasserstein reconstruction. arXiv preprint arXiv:2202.09025 ( 2022 ). Mingyue Tang, Carl Yang, and Pan Li. 2022. Graph auto-encoder via neighborhood wasserstein reconstruction. arXiv preprint arXiv:2202.09025 (2022)."},{"key":"e_1_3_2_2_32_1","volume-title":"Mehdi Azabou, Eva L Dyer, Remi Munos, Petar Velivc kovi?, and Michal Valko.","author":"Thakoor Shantanu","year":"2021","unstructured":"Shantanu Thakoor , Corentin Tallec , Mohammad Gheshlaghi Azar , Mehdi Azabou, Eva L Dyer, Remi Munos, Petar Velivc kovi?, and Michal Valko. 2021 . Large-scale representation learning on graphs via bootstrapping. arXiv preprint arXiv:2102.06514 (2021). Shantanu Thakoor, Corentin Tallec, Mohammad Gheshlaghi Azar, Mehdi Azabou, Eva L Dyer, Remi Munos, Petar Velivc kovi?, and Michal Valko. 2021. Large-scale representation learning on graphs via bootstrapping. arXiv preprint arXiv:2102.06514 (2021)."},{"key":"e_1_3_2_2_33_1","volume-title":"Graph attention networks. arXiv preprint arXiv:1710.10903","author":"Petar Velivc","year":"2017","unstructured":"Petar Velivc kovi?, Guillem Cucurull , Arantxa Casanova , Adriana Romero , Pietro Lio , and Yoshua Bengio . 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 ( 2017 ). Petar Velivc kovi?, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)."},{"key":"e_1_3_2_2_34_1","first-page":"4","article-title":"Deep graph infomax","volume":"2","author":"Velickovic Petar","year":"2019","unstructured":"Petar Velickovic , William Fedus , William L Hamilton , Pietro Li\u00f2 , Yoshua Bengio , and R Devon Hjelm . 2019 . Deep graph infomax . ICLR (Poster) , Vol. 2 , 3 (2019), 4 . Petar Velickovic, William Fedus, William L Hamilton, Pietro Li\u00f2, Yoshua Bengio, and R Devon Hjelm. 2019. Deep graph infomax. ICLR (Poster), Vol. 2, 3 (2019), 4.","journal-title":"ICLR (Poster)"},{"key":"e_1_3_2_2_35_1","volume-title":"Attributed graph clustering: A deep attentional embedding approach. arXiv preprint arXiv:1906.06532","author":"Wang Chun","year":"2019","unstructured":"Chun Wang , Shirui Pan , Ruiqi Hu , Guodong Long , Jing Jiang , and Chengqi Zhang . 2019. Attributed graph clustering: A deep attentional embedding approach. arXiv preprint arXiv:1906.06532 ( 2019 ). Chun Wang, Shirui Pan, Ruiqi Hu, Guodong Long, Jing Jiang, and Chengqi Zhang. 2019. Attributed graph clustering: A deep attentional embedding approach. arXiv preprint arXiv:1906.06532 (2019)."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132967"},{"key":"e_1_3_2_2_37_1","volume-title":"International conference on machine learning. PMLR, 6861--6871","author":"Wu Felix","year":"2019","unstructured":"Felix Wu , Amauri Souza , Tianyi Zhang , Christopher Fifty , Tao Yu , and Kilian Weinberger . 2019 . Simplifying graph convolutional networks . In International conference on machine learning. PMLR, 6861--6871 . Felix Wu, Amauri Souza, Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In International conference on machine learning. PMLR, 6861--6871."},{"key":"e_1_3_2_2_38_1","first-page":"620","article-title":"Decoupled Self-supervised Learning for Graphs","volume":"35","author":"Xiao Teng","year":"2022","unstructured":"Teng Xiao , Zhengyu Chen , Zhimeng Guo , Zeyang Zhuang , and Suhang Wang . 2022 . Decoupled Self-supervised Learning for Graphs . Advances in Neural Information Processing Systems , Vol. 35 (2022), 620 -- 634 . Teng Xiao, Zhengyu Chen, Zhimeng Guo, Zeyang Zhuang, and Suhang Wang. 2022. Decoupled Self-supervised Learning for Graphs. Advances in Neural Information Processing Systems, Vol. 35 (2022), 620--634.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_39_1","volume-title":"International conference on machine learning. PMLR, 5453--5462","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu , Chengtao Li , Yonglong Tian , Tomohiro Sonobe , Ken-ichi Kawarabayashi, and Stefanie Jegelka . 2018 . Representation learning on graphs with jumping knowledge networks . In International conference on machine learning. PMLR, 5453--5462 . Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, and Stefanie Jegelka. 2018. Representation learning on graphs with jumping knowledge networks. In International conference on machine learning. PMLR, 5453--5462."},{"key":"e_1_3_2_2_40_1","volume-title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. arXiv preprint arXiv:2102.06462","author":"Yan Yujun","year":"2021","unstructured":"Yujun Yan , Milad Hashemi , Kevin Swersky , Yaoqing Yang , and Danai Koutra . 2021. Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. arXiv preprint arXiv:2102.06462 ( 2021 ). Yujun Yan, Milad Hashemi, Kevin Swersky, Yaoqing Yang, and Danai Koutra. 2021. Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. arXiv preprint arXiv:2102.06462 (2021)."},{"key":"e_1_3_2_2_41_1","volume-title":"International conference on machine learning. PMLR, 40--48","author":"Yang Zhilin","year":"2016","unstructured":"Zhilin Yang , William Cohen , and Ruslan Salakhudinov . 2016 . Revisiting semi-supervised learning with graph embeddings . In International conference on machine learning. PMLR, 40--48 . Zhilin Yang, William Cohen, and Ruslan Salakhudinov. 2016. Revisiting semi-supervised learning with graph embeddings. In International conference on machine learning. PMLR, 40--48."},{"key":"e_1_3_2_2_42_1","volume-title":"Graph contrastive learning with augmentations. Advances in neural information processing systems","author":"You Yuning","year":"2020","unstructured":"Yuning You , Tianlong Chen , Yongduo Sui , Ting Chen , Zhangyang Wang , and Yang Shen . 2020. Graph contrastive learning with augmentations. Advances in neural information processing systems , Vol. 33 ( 2020 ), 5812--5823. Yuning You, Tianlong Chen, Yongduo Sui, Ting Chen, Zhangyang Wang, and Yang Shen. 2020. Graph contrastive learning with augmentations. Advances in neural information processing systems, Vol. 33 (2020), 5812--5823."},{"key":"e_1_3_2_2_43_1","volume-title":"Attributed graph clustering via adaptive graph convolution. arXiv preprint arXiv:1906.01210","author":"Zhang Xiaotong","year":"2019","unstructured":"Xiaotong Zhang , Han Liu , Qimai Li , and Xiao-Ming Wu. 2019. Attributed graph clustering via adaptive graph convolution. arXiv preprint arXiv:1906.01210 ( 2019 ). Xiaotong Zhang, Han Liu, Qimai Li, and Xiao-Ming Wu. 2019. Attributed graph clustering via adaptive graph convolution. arXiv preprint arXiv:1906.01210 (2019)."},{"key":"e_1_3_2_2_44_1","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume":"33","author":"Zhu Jiong","year":"2020","unstructured":"Jiong Zhu , Yujun Yan , Lingxiao Zhao , Mark Heimann , Leman Akoglu , and Danai Koutra . 2020 b. Beyond homophily in graph neural networks: Current limitations and effective designs . Advances in Neural Information Processing Systems , Vol. 33 (2020), 7793 -- 7804 . Jiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann, Leman Akoglu, and Danai Koutra. 2020b. Beyond homophily in graph neural networks: Current limitations and effective designs. Advances in Neural Information Processing Systems, Vol. 33 (2020), 7793--7804.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_45_1","volume-title":"Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131","author":"Zhu Yanqiao","year":"2020","unstructured":"Yanqiao Zhu , Yichen Xu , Feng Yu , Qiang Liu , Shu Wu , and Liang Wang . 2020a. Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131 ( 2020 ). Yanqiao Zhu, Yichen Xu, Feng Yu, Qiang Liu, Shu Wu, and Liang Wang. 2020a. Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131 (2020)."}],"event":{"name":"CIKM '23: The 32nd ACM International Conference on Information and Knowledge Management","location":"Birmingham United Kingdom","acronym":"CIKM '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 32nd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3614985","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583780.3614985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:44Z","timestamp":1750178204000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3614985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,21]]},"references-count":45,"alternative-id":["10.1145\/3583780.3614985","10.1145\/3583780"],"URL":"https:\/\/doi.org\/10.1145\/3583780.3614985","relation":{},"subject":[],"published":{"date-parts":[[2023,10,21]]},"assertion":[{"value":"2023-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}