{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T16:48:54Z","timestamp":1785602934013,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1918483, IIS-1618690,CCF-0939370"],"award-info":[{"award-number":["CCF-1918483, IIS-1618690,CCF-0939370"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,14]]},"DOI":"10.1145\/3447548.3467373","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T06:12:09Z","timestamp":1628748729000},"page":"1541-1551","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":77,"title":["Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns"],"prefix":"10.1145","author":[{"given":"Susheel","family":"Suresh","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vinith","family":"Budde","sequence":"additional","affiliation":[{"name":"Amazon, Seattle, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jennifer","family":"Neville","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pan","family":"Li","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianzhu","family":"Ma","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Greg Ver Steeg, and Aram Galstyan","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. ICML ( 2019). 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. ICML (2019)."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601438"},{"key":"e_1_3_2_2_3_1","volume-title":"Learning to represent programs with graphs. ICLR","author":"Allamanis Miltiadis","year":"2018","unstructured":"Miltiadis Allamanis , Marc Brockschmidt , and Mahmoud Khademi . 2018. Learning to represent programs with graphs. ICLR ( 2018 ). Miltiadis Allamanis, Marc Brockschmidt, and Mahmoud Khademi. 2018. Learning to represent programs with graphs. ICLR (2018)."},{"key":"e_1_3_2_2_4_1","volume-title":"Special interest tracks and posters of the 14th international conference on World Wide Web.","author":"Boldi Paolo","unstructured":"Paolo Boldi . 2005. TotalRank: Ranking without damping . In Special interest tracks and posters of the 14th international conference on World Wide Web. Paolo Boldi. 2005. TotalRank: Ranking without damping. In Special interest tracks and posters of the 14th international conference on World Wide Web."},{"key":"e_1_3_2_2_5_1","volume-title":"Mixing patterns and individual differences in networks. Physical Review E","author":"Cantwell George T","year":"2019","unstructured":"George T Cantwell and MEJ Newman . 2019. Mixing patterns and individual differences in networks. Physical Review E ( 2019 ). George T Cantwell and MEJ Newman. 2019. Mixing patterns and individual differences in networks. Physical Review E (2019)."},{"key":"e_1_3_2_2_6_1","volume-title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy. arXiv preprint arXiv:2005.03675","author":"Chami Ines","year":"2020","unstructured":"Ines Chami , Sami Abu-El-Haija , Bryan Perozzi , Christopher R\u00e9 , and Kevin Murphy . 2020. Machine Learning on Graphs: A Model and Comprehensive Taxonomy. arXiv preprint arXiv:2005.03675 ( 2020 ). Ines Chami, Sami Abu-El-Haija, Bryan Perozzi, Christopher R\u00e9, and Kevin Murphy. 2020. Machine Learning on Graphs: A Model and Comprehensive Taxonomy. arXiv preprint arXiv:2005.03675 (2020)."},{"key":"e_1_3_2_2_7_1","volume-title":"On Graph Neural Networks versus Graph-Augmented MLPs. arXiv preprint arXiv:2010.15116","author":"Chen Lei","year":"2020","unstructured":"Lei Chen , Zhengdao Chen , and Joan Bruna . 2020. On Graph Neural Networks versus Graph-Augmented MLPs. arXiv preprint arXiv:2010.15116 ( 2020 ). Lei Chen, Zhengdao Chen, and Joan Bruna. 2020. On Graph Neural Networks versus Graph-Augmented MLPs. arXiv preprint arXiv:2010.15116 (2020)."},{"key":"e_1_3_2_2_8_1","volume-title":"Adaptive Universal Generalized PageRank Graph Neural Network. In International Conference on Learning Representations. https:\/\/openreview. net\/forum.","author":"Chien Eli","year":"2021","unstructured":"Eli Chien , Jianhao Peng , Pan Li , and Olgica Milenkovic . 2021 . Adaptive Universal Generalized PageRank Graph Neural Network. In International Conference on Learning Representations. https:\/\/openreview. net\/forum. Eli Chien, Jianhao Peng, Pan Li, and Olgica Milenkovic. 2021. Adaptive Universal Generalized PageRank Graph Neural Network. In International Conference on Learning Representations. https:\/\/openreview. net\/forum."},{"key":"e_1_3_2_2_9_1","unstructured":"Micha\u00ebl Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In NeurIPS.  Micha\u00ebl Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In NeurIPS."},{"key":"e_1_3_2_2_10_1","volume-title":"Graph signal processing for machine learning: A review and new perspectives. arXiv preprint arXiv:2007.16061","author":"Dong Xiaowen","year":"2020","unstructured":"Xiaowen Dong , Dorina Thanou , Laura Toni , Michael Bronstein , and Pascal Frossard . 2020. Graph signal processing for machine learning: A review and new perspectives. arXiv preprint arXiv:2007.16061 ( 2020 ). Xiaowen Dong, Dorina Thanou, Laura Toni, Michael Bronstein, and Pascal Frossard. 2020. Graph signal processing for machine learning: A review and new perspectives. arXiv preprint arXiv:2007.16061 (2020)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Claire Donnat Marinka Zitnik David Hallac and Jure Leskovec. 2018. Learning structural node embeddings via diffusion wavelets. In KDD.  Claire Donnat Marinka Zitnik David Hallac and Jure Leskovec. 2018. Learning structural node embeddings via diffusion wavelets. In KDD.","DOI":"10.1145\/3219819.3220025"},{"key":"e_1_3_2_2_12_1","unstructured":"David K Duvenaud Dougal Maclaurin Jorge Iparraguirre Rafael Bombarell Timothy Hirzel Al\u00e1n Aspuru-Guzik and Ryan P Adams. 2015. Convolutional networks on graphs for learning molecular fingerprints. In NeurIPS.  David K Duvenaud Dougal Maclaurin Jorge Iparraguirre Rafael Bombarell Timothy Hirzel Al\u00e1n Aspuru-Guzik and Ryan P Adams. 2015. Convolutional networks on graphs for learning molecular fingerprints. In NeurIPS."},{"key":"e_1_3_2_2_13_1","volume-title":"Barakeel Fanseu Kamhoua, and James Cheng","author":"Fu Guoji","year":"2020","unstructured":"Guoji Fu , Yifan Hou , Jian Zhang , Kaili Ma , Barakeel Fanseu Kamhoua, and James Cheng . 2020 . Understanding Graph Neural Networks from Graph Signal Denoising Perspectives . arXiv preprint arXiv:2006.04386 (2020). Guoji Fu, Yifan Hou, Jian Zhang, Kaili Ma, Barakeel Fanseu Kamhoua, and James Cheng. 2020. Understanding Graph Neural Networks from Graph Signal Denoising Perspectives. arXiv preprint arXiv:2006.04386 (2020)."},{"key":"e_1_3_2_2_14_1","unstructured":"Justin Gilmer Samuel S Schoenholz Patrick F Riley Oriol Vinyals and George E Dahl. 2017. Neural Message Passing for Quantum Chemistry. In ICML.  Justin Gilmer Samuel S Schoenholz Patrick F Riley Oriol Vinyals and George E Dahl. 2017. Neural Message Passing for Quantum Chemistry. In ICML."},{"key":"e_1_3_2_2_15_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS.  Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"William L Hamilton. 2020. Graph representation learning. (2020).  William L Hamilton. 2020. Graph representation learning. (2020).","DOI":"10.1007\/978-3-031-01588-5"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Keith Henderson Brian Gallagher Tina Eliassi-Rad Hanghang Tong Sugato Basu Leman Akoglu Danai Koutra Christos Faloutsos and Lei Li. 2012. Rolx: structural role extraction & mining in large graphs. In KDD.  Keith Henderson Brian Gallagher Tina Eliassi-Rad Hanghang Tong Sugato Basu Leman Akoglu Danai Koutra Christos Faloutsos and Lei Li. 2012. Rolx: structural role extraction & mining in large graphs. In KDD.","DOI":"10.2172\/1111134"},{"key":"e_1_3_2_2_18_1","volume-title":"Hongzhi Chen, and Ming-Chang Yang.","author":"Hou Yifan","year":"2019","unstructured":"Yifan Hou , Jian Zhang , James Cheng , Kaili Ma , Richard TB Ma , Hongzhi Chen, and Ming-Chang Yang. 2019 . Measuring and improving the use of graph information in graph neural networks. In ICLR. Yifan Hou, Jian Zhang, James Cheng, Kaili Ma, Richard TB Ma, Hongzhi Chen, and Ming-Chang Yang. 2019. Measuring and improving the use of graph information in graph neural networks. In ICLR."},{"key":"e_1_3_2_2_19_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_20_1","volume-title":"Semi-supervised classification with graph convolutional networks. ICLR","author":"Kipf Thomas N","year":"2017","unstructured":"Thomas N Kipf and Max Welling . 2017. Semi-supervised classification with graph convolutional networks. ICLR ( 2017 ). Thomas N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. ICLR (2017)."},{"key":"e_1_3_2_2_21_1","volume-title":"2019 a. Predict then propagate: Graph neural networks meet personalized pagerank. ICLR","author":"Klicpera Johannes","year":"2019","unstructured":"Johannes Klicpera , Aleksandar Bojchevski , and Stephan G\u00fcnnemann . 2019 a. Predict then propagate: Graph neural networks meet personalized pagerank. ICLR ( 2019 ). Johannes Klicpera, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2019 a. Predict then propagate: Graph neural networks meet personalized pagerank. ICLR (2019)."},{"key":"e_1_3_2_2_22_1","unstructured":"Johannes Klicpera Stefan Wei\u00dfenberger and Stephan G\u00fcnnemann. 2019 b. Diffusion improves graph learning. In NeurIPS.  Johannes Klicpera Stefan Wei\u00dfenberger and Stephan G\u00fcnnemann. 2019 b. Diffusion improves graph learning. In NeurIPS."},{"key":"e_1_3_2_2_23_1","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Li Pan","year":"2019","unstructured":"Pan Li , Eli Chien , and Olgica Milenkovic . 2019 . Optimizing generalized pagerank methods for seed-expansion community detection . Advances in Neural Information Processing Systems , Vol. 32 (2019). Pan Li, Eli Chien, and Olgica Milenkovic. 2019. Optimizing generalized pagerank methods for seed-expansion community detection. Advances in Neural Information Processing Systems, Vol. 32 (2019)."},{"key":"e_1_3_2_2_24_1","volume-title":"Distance Encoding--Design Provably More Powerful GNNs for Structural Representation Learning. NeurIPS","author":"Li Pan","year":"2020","unstructured":"Pan Li , Yanbang Wang , Hongwei Wang , and Jure Leskovec . 2020. Distance Encoding--Design Provably More Powerful GNNs for Structural Representation Learning. NeurIPS ( 2020 ). Pan Li, Yanbang Wang, Hongwei Wang, and Jure Leskovec. 2020. Distance Encoding--Design Provably More Powerful GNNs for Structural Representation Learning. NeurIPS (2020)."},{"key":"e_1_3_2_2_25_1","volume-title":"Deeper insights into graph convolutional networks for semi-supervised learning. arXiv preprint arXiv:1801.07606","author":"Li Qimai","year":"2018","unstructured":"Qimai Li , Zhichao Han , and Xiao-Ming Wu. 2018. Deeper insights into graph convolutional networks for semi-supervised learning. arXiv preprint arXiv:1801.07606 ( 2018 ). Qimai Li, Zhichao Han, and Xiao-Ming Wu. 2018. Deeper insights into graph convolutional networks for semi-supervised learning. arXiv preprint arXiv:1801.07606 (2018)."},{"key":"e_1_3_2_2_26_1","volume-title":"The link-prediction problem for social networks. Journal of the American society for information science and technology","author":"Liben-Nowell David","year":"2007","unstructured":"David Liben-Nowell and Jon Kleinberg . 2007. The link-prediction problem for social networks. Journal of the American society for information science and technology ( 2007 ). David Liben-Nowell and Jon Kleinberg. 2007. The link-prediction problem for social networks. Journal of the American society for information science and technology (2007)."},{"key":"e_1_3_2_2_27_1","volume-title":"Non-Local Graph Neural Networks. arXiv preprint arXiv:2005.14612","author":"Liu Meng","year":"2020","unstructured":"Meng Liu , Zhengyang Wang , and Shuiwang Ji. 2020. Non-Local Graph Neural Networks. arXiv preprint arXiv:2005.14612 ( 2020 ). Meng Liu, Zhengyang Wang, and Shuiwang Ji. 2020. Non-Local Graph Neural Networks. arXiv preprint arXiv:2005.14612 (2020)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2504730.2504735"},{"key":"e_1_3_2_2_29_1","volume-title":"Birds of a feather: Homophily in social networks. Annual review of sociology","author":"McPherson Miller","year":"2001","unstructured":"Miller McPherson , Lynn Smith-Lovin , and James M Cook . 2001. Birds of a feather: Homophily in social networks. Annual review of sociology ( 2001 ). Miller McPherson, Lynn Smith-Lovin, and James M Cook. 2001. Birds of a feather: Homophily in social networks. Annual review of sociology (2001)."},{"key":"e_1_3_2_2_30_1","volume-title":"Scattering GCN: Overcoming Oversmoothness in Graph Convolutional Networks. arXiv preprint arXiv:2003.08414","author":"Min Yimeng","year":"2020","unstructured":"Yimeng Min , Frederik Wenkel , and Guy Wolf . 2020. Scattering GCN: Overcoming Oversmoothness in Graph Convolutional Networks. arXiv preprint arXiv:2003.08414 ( 2020 ). Yimeng Min, Frederik Wenkel, and Guy Wolf. 2020. Scattering GCN: Overcoming Oversmoothness in Graph Convolutional Networks. arXiv preprint arXiv:2003.08414 (2020)."},{"key":"e_1_3_2_2_31_1","volume-title":"Gaurav Rattan, and Martin Grohe.","author":"Morris Christopher","year":"2019","unstructured":"Christopher Morris , Martin Ritzert , Matthias Fey , William L Hamilton , Jan Eric Lenssen , Gaurav Rattan, and Martin Grohe. 2019 . Weisfeiler and leman go neural: Higher-order graph neural networks. In AAAI. Christopher Morris, Martin Ritzert, Matthias Fey, William L Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe. 2019. Weisfeiler and leman go neural: Higher-order graph neural networks. In AAAI."},{"key":"e_1_3_2_2_32_1","unstructured":"Galileo Namata Ben London Lise Getoor Bert Huang and UMD EDU. 2012. Query-driven active surveying for collective classification.  Galileo Namata Ben London Lise Getoor Bert Huang and UMD EDU. 2012. Query-driven active surveying for collective classification."},{"key":"e_1_3_2_2_33_1","volume-title":"Mixing patterns in networks. Physical review E","author":"Newman Mark EJ","year":"2003","unstructured":"Mark EJ Newman . 2003. Mixing patterns in networks. Physical review E , Vol. 67 , 2 ( 2003 ), 026126. Mark EJ Newman. 2003. Mixing patterns in networks. Physical review E, Vol. 67, 2 (2003), 026126."},{"key":"e_1_3_2_2_34_1","volume-title":"Revisiting graph neural networks: All we have is low-pass filters. arXiv preprint arXiv:1905.09550","author":"Takanori Maehara Hoang","year":"2019","unstructured":"Hoang NT and Takanori Maehara . 2019. Revisiting graph neural networks: All we have is low-pass filters. arXiv preprint arXiv:1905.09550 ( 2019 ). Hoang NT and Takanori Maehara. 2019. Revisiting graph neural networks: All we have is low-pass filters. arXiv preprint arXiv:1905.09550 (2019)."},{"key":"e_1_3_2_2_35_1","volume-title":"Multiscale mixing patterns in networks. PNAS","author":"Peel Leto","year":"2018","unstructured":"Leto Peel , Jean-Charles Delvenne , and Renaud Lambiotte . 2018. Multiscale mixing patterns in networks. PNAS ( 2018 ). Leto Peel, Jean-Charles Delvenne, and Renaud Lambiotte. 2018. Multiscale mixing patterns in networks. PNAS (2018)."},{"key":"e_1_3_2_2_36_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. ICLR ( 2020). Hongbin Pei, Bingzhe Wei, Kevin Chen-Chuan Chang, Yu Lei, and Bo Yang. 2020. Geom-gcn: Geometric graph convolutional networks. ICLR (2020)."},{"key":"e_1_3_2_2_37_1","volume-title":"Pedro HP Saverese, and Daniel R Figueiredo","author":"Ribeiro Leonardo FR","year":"2017","unstructured":"Leonardo FR Ribeiro , Pedro HP Saverese, and Daniel R Figueiredo . 2017 . struc2vec: Learning node representations from structural identity. In KDD. Leonardo FR Ribeiro, Pedro HP Saverese, and Daniel R Figueiredo. 2017. struc2vec: Learning node representations from structural identity. In KDD."},{"key":"e_1_3_2_2_38_1","volume-title":"Multi-scale attributed node embedding. arXiv preprint arXiv:1909.13021","author":"Rozemberczki Benedek","year":"2019","unstructured":"Benedek Rozemberczki , Carl Allen , and Rik Sarkar . 2019. Multi-scale attributed node embedding. arXiv preprint arXiv:1909.13021 ( 2019 ). Benedek Rozemberczki, Carl Allen, and Rik Sarkar. 2019. Multi-scale attributed node embedding. arXiv preprint arXiv:1909.13021 (2019)."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Stan Salvador and Philip Chan. 2007. Toward Accurate Dynamic Time Warping in Linear Time and Space. Intell. Data Anal. (2007).  Stan Salvador and Philip Chan. 2007. Toward Accurate Dynamic Time Warping in Linear Time and Space. Intell. Data Anal. (2007).","DOI":"10.3233\/IDA-2007-11508"},{"key":"e_1_3_2_2_40_1","volume-title":"A survey on the expressive power of graph neural networks. arXiv preprint arXiv:2003.04078","author":"Sato Ryoma","year":"2020","unstructured":"Ryoma Sato . 2020. A survey on the expressive power of graph neural networks. arXiv preprint arXiv:2003.04078 ( 2020 ). Ryoma Sato. 2020. A survey on the expressive power of graph neural networks. arXiv preprint arXiv:2003.04078 (2020)."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"e_1_3_2_2_42_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 ( 2008 ). Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Galligher, and Tina Eliassi-Rad. 2008. Collective classification in network data. AI magazine (2008)."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Jie Tang Jimeng Sun Chi Wang and Zi Yang. 2009. Social Influence Analysis in Large-Scale Networks. In KDD.  Jie Tang Jimeng Sun Chi Wang and Zi Yang. 2009. Social Influence Analysis in Large-Scale Networks. In KDD.","DOI":"10.1145\/1557019.1557108"},{"key":"e_1_3_2_2_44_1","volume-title":"Graph attention networks. ICLR","author":"Petar Velivc","year":"2018","unstructured":"Petar Velivc kovi\u0107, Guillem Cucurull , Arantxa Casanova , Adriana Romero , Pietro Lio , and Yoshua Bengio . 2018. Graph attention networks. ICLR ( 2018 ). Petar Velivc kovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2018. Graph attention networks. ICLR (2018)."},{"key":"e_1_3_2_2_45_1","volume-title":"Dynamic graph cnn for learning on point clouds. ACM Transactions On Graphics (tog)","author":"Wang Yue","year":"2019","unstructured":"Yue Wang , Yongbin Sun , Ziwei Liu , Sanjay E Sarma , Michael M Bronstein , and Justin M Solomon . 2019. Dynamic graph cnn for learning on point clouds. ACM Transactions On Graphics (tog) ( 2019 ). Yue Wang, Yongbin Sun, Ziwei Liu, Sanjay E Sarma, Michael M Bronstein, and Justin M Solomon. 2019. Dynamic graph cnn for learning on point clouds. ACM Transactions On Graphics (tog) (2019)."},{"key":"e_1_3_2_2_46_1","unstructured":"B. Y. Weisfeiler and A. Leman. 1968. Reduction of a graph to a canonical form and an algebra arising during this reduction (in Russian). Nauchno-Technicheskaya Informatsia (1968).  B. Y. Weisfeiler and A. Leman. 1968. Reduction of a graph to a canonical form and an algebra arising during this reduction (in Russian). Nauchno-Technicheskaya Informatsia (1968)."},{"key":"e_1_3_2_2_47_1","volume-title":"Net: Degree-specific graph neural networks for node and graph classification. In KDD.","author":"Wu Jun","year":"2019","unstructured":"Jun Wu , Jingrui He , and Jiejun Xu . 2019 . Net: Degree-specific graph neural networks for node and graph classification. In KDD. Jun Wu, Jingrui He, and Jiejun Xu. 2019. Net: Degree-specific graph neural networks for node and graph classification. In KDD."},{"key":"e_1_3_2_2_48_1","volume-title":"How powerful are graph neural networks? ICLR","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu , Weihua Hu , Jure Leskovec , and Stefanie Jegelka . 2018a. How powerful are graph neural networks? ICLR ( 2018 ). Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018a. How powerful are graph neural networks? ICLR (2018)."},{"key":"e_1_3_2_2_49_1","volume-title":"Representation learning on graphs with jumping knowledge networks. ICML","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu , Chengtao Li , Yonglong Tian , Tomohiro Sonobe , Ken-ichi Kawarabayashi, and Stefanie Jegelka . 2018b. Representation learning on graphs with jumping knowledge networks. ICML ( 2018 ). Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, and Stefanie Jegelka. 2018b. Representation learning on graphs with jumping knowledge networks. ICML (2018)."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Rex Ying Ruining He Kaifeng Chen Pong Eksombatchai William L Hamilton and Jure Leskovec. 2018. Graph convolutional neural networks for web-scale recommender systems. In KDD.  Rex Ying Ruining He Kaifeng Chen Pong Eksombatchai William L Hamilton and Jure Leskovec. 2018. Graph convolutional neural networks for web-scale recommender systems. In KDD.","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_2_51_1","volume-title":"Deep learning on graphs: A survey","author":"Zhang Ziwei","year":"2020","unstructured":"Ziwei Zhang , Peng Cui , and Wenwu Zhu . 2020. Deep learning on graphs: A survey . IEEE TKDE ( 2020 ). Ziwei Zhang, Peng Cui, and Wenwu Zhu. 2020. Deep learning on graphs: A survey. IEEE TKDE (2020)."},{"key":"e_1_3_2_2_52_1","volume-title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs. NeurIPS","author":"Zhu Jiong","year":"2020","unstructured":"Jiong Zhu , Yujun Yan , Lingxiao Zhao , Mark Heimann , Leman Akoglu , and Danai Koutra . 2020. Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs. NeurIPS ( 2020 ). Jiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann, Leman Akoglu, and Danai Koutra. 2020. Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs. NeurIPS (2020)."}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","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 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467373","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3447548.3467373","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467373","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:23Z","timestamp":1750191503000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":52,"alternative-id":["10.1145\/3447548.3467373","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467373","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}