{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T11:55:42Z","timestamp":1792756542817,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"UK Engineering and Physical Sciences Research Council (EPSRC)","award":["EP\/R014507\/1"],"award-info":[{"award-number":["EP\/R014507\/1"]}]},{"name":"China Scholarship Council (CSC)","award":["201706080010"],"award-info":[{"award-number":["201706080010"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3411983","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T06:32:45Z","timestamp":1603089165000},"page":"1813-1822","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["A Feature-Importance-Aware and Robust Aggregator for GCN"],"prefix":"10.1145","author":[{"given":"Li","family":"Zhang","sequence":"first","affiliation":[{"name":"Univerisity of Sheffield, Sheffield, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haiping","family":"Lu","sequence":"additional","affiliation":[{"name":"Univerisity of Sheffield, Sheffield, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"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 , Hrayr Harutyunyan , Nazanin Alipourfard , Kristina Lerman , Greg Ver Steeg, and Aram Galstyan . 2019 . MixHop: Higher- Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing. In ICML. Sami Abu-El-Haija, Bryan Perozzi, Amol Kapoor, Hrayr Harutyunyan, Nazanin Alipourfard, Kristina Lerman, Greg Ver Steeg, and Aram Galstyan. 2019. MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing. In ICML."},{"key":"e_1_3_2_2_2_1","unstructured":"James Atwood and Don Towsley. 2016. Diffusion-convolutional Neural Networks. In NeurIPS.  James Atwood and Don Towsley. 2016. Diffusion-convolutional Neural Networks. In NeurIPS."},{"key":"e_1_3_2_2_3_1","unstructured":"Dzmitry Bahdanau Kyunghyun Cho and Yoshua Bengio. 2015. Neural Machine Translation by Jointly Learning to Align and Translate. In ICLR.  Dzmitry Bahdanau Kyunghyun Cho and Yoshua Bengio. 2015. Neural Machine Translation by Jointly Learning to Align and Translate. In ICLR."},{"key":"e_1_3_2_2_4_1","unstructured":"Peter W Battaglia Jessica B Hamrick Victor Bapst Alvaro Sanchez-Gonzalez Vinicius Zambaldi Mateusz Malinowski Andrea Tacchetti David Raposo Adam Santoro Ryan Faulkner etal 2018. Relational inductive biases deep learning and graph networks. arXiv preprint arXiv:1806.01261 (2018).  Peter W Battaglia Jessica B Hamrick Victor Bapst Alvaro Sanchez-Gonzalez Vinicius Zambaldi Mateusz Malinowski Andrea Tacchetti David Raposo Adam Santoro Ryan Faulkner et al. 2018. Relational inductive biases deep learning and graph networks. arXiv preprint arXiv:1806.01261 (2018)."},{"key":"e_1_3_2_2_5_1","volume-title":"Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. Journal of machine learning research","author":"Belkin Mikhail","year":"2006","unstructured":"Mikhail Belkin , Partha Niyogi , and Vikas Sindhwani . 2006. Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. Journal of machine learning research ( 2006 ). Mikhail Belkin, Partha Niyogi, and Vikas Sindhwani. 2006. Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. Journal of machine learning research (2006)."},{"key":"e_1_3_2_2_6_1","unstructured":"Joan Bruna Wojciech Zaremba Arthur Szlam and Yann LeCun. 2014. Spectral networks and locally connected networks on graphs. In ICLR.  Joan Bruna Wojciech Zaremba Arthur Szlam and Yann LeCun. 2014. Spectral networks and locally connected networks on graphs. In ICLR."},{"key":"e_1_3_2_2_7_1","unstructured":"Jie Chen Tengfei Ma and Cao Xiao. 2018. FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling. In ICLR.  Jie Chen Tengfei Ma and Cao Xiao. 2018. FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling. In ICLR."},{"key":"e_1_3_2_2_8_1","volume-title":"Adversarial Attack on Graph Structured Data. In International Conference on Machine Learning (ICML).","author":"Dai Hanjun","year":"2019","unstructured":"Hanjun Dai , Hui Li , Tian Tian , Xin Huang , Lin Wang , Jun Zhu , and Le Song . 2019 . Adversarial Attack on Graph Structured Data. In International Conference on Machine Learning (ICML). Hanjun Dai, Hui Li, Tian Tian, Xin Huang, Lin Wang, Jun Zhu, and Le Song. 2019. Adversarial Attack on Graph Structured Data. In International Conference on Machine Learning (ICML)."},{"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","unstructured":"Hongyang Gao Zhengyang Wang and Shuiwang Ji. 2018. Large-Scale Learnable Graph Convolutional Networks. In SIGKDD.  Hongyang Gao Zhengyang Wang and Shuiwang Ji. 2018. Large-Scale Learnable Graph Convolutional Networks. In SIGKDD."},{"key":"e_1_3_2_2_11_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_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In SIGKDD.  Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In SIGKDD.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_14_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_15_1","volume-title":"Representation Learning on Graphs: Methods and Applications","author":"Hamilton William L.","year":"2017","unstructured":"William L. Hamilton , Rex Ying , and Jure Leskovec . 2017. Representation Learning on Graphs: Methods and Applications . IEEE Data Eng. Bull . ( 2017 ). William L. Hamilton, Rex Ying, and Jure Leskovec. 2017. Representation Learning on Graphs: Methods and Applications. IEEE Data Eng. Bull. (2017)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long Short-Term Memory. Neural Comput. (1997).  Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long Short-Term Memory. Neural Comput. (1997).","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"e_1_3_2_2_17_1","volume-title":"Approximation capabilities of multilayer feedforward networks. Neural networks","author":"Hornik Kurt","year":"1991","unstructured":"Kurt Hornik . 1991. Approximation capabilities of multilayer feedforward networks. Neural networks ( 1991 ). Kurt Hornik. 1991. Approximation capabilities of multilayer feedforward networks. Neural networks (1991)."},{"key":"e_1_3_2_2_18_1","volume-title":"Multilayer feedforward networks are universal approximators. Neural networks","author":"Hornik Kurt","year":"1989","unstructured":"Kurt Hornik , Maxwell Stinchcombe , and Halbert White . 1989. Multilayer feedforward networks are universal approximators. Neural networks ( 1989 ). Kurt Hornik, Maxwell Stinchcombe, and Halbert White. 1989. Multilayer feedforward networks are universal approximators. Neural networks (1989)."},{"key":"e_1_3_2_2_19_1","unstructured":"Sergey Ivanov and Evgeny Burnaev. 2018. Anonymous Walk Embeddings. In ICML.  Sergey Ivanov and Evgeny Burnaev. 2018. Anonymous Walk Embeddings. In ICML."},{"key":"e_1_3_2_2_20_1","volume-title":"Adam: A method for stochastic optimization. In ICLR.","author":"Kingma Diederik P","year":"2015","unstructured":"Diederik P Kingma and Jimmy Ba . 2015 . Adam: A method for stochastic optimization. In ICLR. Diederik P Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In ICLR."},{"key":"e_1_3_2_2_21_1","unstructured":"Thomas N Kipf and MaxWelling. 2017. Semi-supervised classification with graph convolutional networks. In ICLR.  Thomas N Kipf and MaxWelling. 2017. Semi-supervised classification with graph convolutional networks. In ICLR."},{"key":"e_1_3_2_2_22_1","unstructured":"Johannes Klicpera Stefan Wei\u00dfenberger and Stephan G\u00fcnnemann. 2019. Diffusion Improves Graph Learning. In NeurIPS.  Johannes Klicpera Stefan Wei\u00dfenberger and Stephan G\u00fcnnemann. 2019. Diffusion Improves Graph Learning. In NeurIPS."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3363574"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"e_1_3_2_2_26_1","volume-title":"Janossy Pooling: Learning Deep Permutation-Invariant Functions for Variable-Size Inputs. In ICLR.","author":"Murphy Ryan L.","year":"2019","unstructured":"Ryan L. Murphy , Balasubramaniam Srinivasan , Vinayak Rao , and Bruno Ribeiro . 2019 . Janossy Pooling: Learning Deep Permutation-Invariant Functions for Variable-Size Inputs. In ICLR. Ryan L. Murphy, Balasubramaniam Srinivasan, Vinayak Rao, and Bruno Ribeiro. 2019. Janossy Pooling: Learning Deep Permutation-Invariant Functions for Variable-Size Inputs. In ICLR."},{"key":"e_1_3_2_2_27_1","unstructured":"Mathias Niepert Mohamed Ahmed and Konstantin Kutzkov. 2016. Learning convolutional neural networks for graphs. In ICML.  Mathias Niepert Mohamed Ahmed and Konstantin Kutzkov. 2016. Learning convolutional neural networks for graphs. In ICML."},{"key":"e_1_3_2_2_28_1","volume-title":"GMNN: Graph Markov Neural Networks. In ICML.","author":"Qu Meng","year":"2019","unstructured":"Meng Qu , Yoshua Bengio , and Jian Tang . 2019 . GMNN: Graph Markov Neural Networks. In ICML. Meng Qu, Yoshua Bengio, and Jian Tang. 2019. GMNN: Graph Markov Neural Networks. In ICML."},{"key":"e_1_3_2_2_29_1","volume-title":"Markus Hagenbuchner, and Gabriele Monfardini.","author":"Scarselli Franco","year":"2009","unstructured":"Franco Scarselli , Marco Gori , Ah Chung Tsoi , Markus Hagenbuchner, and Gabriele Monfardini. 2009 . The Graph Neural Network Model. IEEE Transactions on Neural Networks ( 2009). Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and Gabriele Monfardini. 2009. The Graph Neural Network Model. IEEE Transactions on Neural Networks (2009)."},{"key":"e_1_3_2_2_30_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_31_1","unstructured":"Otilia Stretcu Krishnamurthy Viswanathan Dana Movshovitz-Attias Emmanouil Platanios Sujith Ravi and Andrew Tomkins. 2019. Graph Agreement Models for Semi-Supervised Learning. In NeurIPS.  Otilia Stretcu Krishnamurthy Viswanathan Dana Movshovitz-Attias Emmanouil Platanios Sujith Ravi and Andrew Tomkins. 2019. Graph Agreement Models for Semi-Supervised Learning. In NeurIPS."},{"key":"e_1_3_2_2_32_1","unstructured":"Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N. Gomez Lukasz Kaiser and Illia Polosukhin. 2017. Attention is All you Need. In NeurIPS.  Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N. Gomez Lukasz Kaiser and Illia Polosukhin. 2017. Attention is All you Need. In NeurIPS."},{"key":"e_1_3_2_2_33_1","unstructured":"Petar Velickovic Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2018. Graph attention networks. In ICLR.  Petar Velickovic Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2018. Graph attention networks. In ICLR."},{"key":"e_1_3_2_2_34_1","volume-title":"Osborne","author":"Wagstaff Edward","year":"2019","unstructured":"Edward Wagstaff , Fabian B. Fuchs , Martin Engelcke , Ingmar Posner , and Michael A . Osborne . 2019 . On the Limitations of Representing Functions on Sets. In ICML. Edward Wagstaff, Fabian B. Fuchs, Martin Engelcke, Ingmar Posner, and Michael A. Osborne. 2019. On the Limitations of Representing Functions on Sets. In ICML."},{"key":"e_1_3_2_2_35_1","unstructured":"B. Yu. Weisfeiler and A. A. Leman. 1968. Reduction of a graph to a canonical form and an algebra arising during this reduction.  B. Yu. Weisfeiler and A. A. Leman. 1968. Reduction of a graph to a canonical form and an algebra arising during this reduction."},{"key":"e_1_3_2_2_36_1","volume-title":"Neural networks: Tricks of the trade","author":"Weston Jason","unstructured":"Jason Weston , Fr\u00e9d\u00e9ric Ratle , Hossein Mobahi , and Ronan Collobert . 2012. Deep learning via semi-supervised embedding . In Neural networks: Tricks of the trade . Springer , 639--655. Jason Weston, Fr\u00e9d\u00e9ric Ratle, Hossein Mobahi, and Ronan Collobert. 2012. Deep learning via semi-supervised embedding. In Neural networks: Tricks of the trade. Springer, 639--655."},{"key":"e_1_3_2_2_37_1","unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks?. In ICLR.  Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks?. In ICLR."},{"key":"e_1_3_2_2_38_1","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 ICML.  Keyulu Xu Chengtao Li Yonglong Tian Tomohiro Sonobe Ken-ichi Kawarabayashi and Stefanie Jegelka. 2018. Representation Learning on Graphs with Jumping Knowledge Networks. In ICML."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_2_2_40_1","unstructured":"Rex Ying Dylan Bourgeois Jiaxuan You Marinka Zitnik and Jure Leskovec. 2019. GNN Explainer: A Tool for Post-hoc Explanation of Graph Neural Networks. In NeurIPS.  Rex Ying Dylan Bourgeois Jiaxuan You Marinka Zitnik and Jure Leskovec. 2019. GNN Explainer: A Tool for Post-hoc Explanation of Graph Neural Networks. In NeurIPS."},{"key":"e_1_3_2_2_41_1","volume-title":"Smola","author":"Zaheer Manzil","year":"2017","unstructured":"Manzil Zaheer , Satwik Kottur , Siamak Ravanbakhsh , Barnab\u00e1s P\u00f3czos , Ruslan Salakhutdinov , and Alexander J . Smola . 2017 . Deep Sets. In NeurIPS. Manzil Zaheer, Satwik Kottur, Siamak Ravanbakhsh, Barnab\u00e1s P\u00f3czos, Ruslan Salakhutdinov, and Alexander J. Smola. 2017. Deep Sets. In NeurIPS."},{"key":"e_1_3_2_2_42_1","volume-title":"Graph node-feature convolution for representation learning. arXiv preprint arXiv:1812.00086","author":"Zhang Li","year":"2018","unstructured":"Li Zhang , Heda Song , and Haiping Lu. 2018. Graph node-feature convolution for representation learning. arXiv preprint arXiv:1812.00086 ( 2018 ). Li Zhang, Heda Song, and Haiping Lu. 2018. Graph node-feature convolution for representation learning. arXiv preprint arXiv:1812.00086 (2018)."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Muhan Zhang Zhicheng Cui Marion Neumann and Yixin Chen. 2018. An End-to-End Deep Learning Architecture for Graph Classification. In AAAI.  Muhan Zhang Zhicheng Cui Marion Neumann and Yixin Chen. 2018. An End-to-End Deep Learning Architecture for Graph Classification. In AAAI.","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00454"},{"key":"e_1_3_2_2_45_1","unstructured":"Xiaojin Zhu Zoubin Ghahramani and John D Lafferty. 2003. Semi-supervised learning using gaussian fields and harmonic functions. In ICML.  Xiaojin Zhu Zoubin Ghahramani and John D Lafferty. 2003. Semi-supervised learning using gaussian fields and harmonic functions. In ICML."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Daniel Z\u00fcgner Amir Akbarnejad and Stephan G\u00fcnnemann. 2018. Adversarial attacks on neural networks for graph data. In SIGKDD.  Daniel Z\u00fcgner Amir Akbarnejad and Stephan G\u00fcnnemann. 2018. Adversarial attacks on neural networks for graph data. In SIGKDD.","DOI":"10.24963\/ijcai.2019\/872"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Daniel Z\u00fcgner and Stephan G\u00fcnnemann. 2019. Certifiable robustness and robust training for graph convolutional networks. In SIGKDD.  Daniel Z\u00fcgner and Stephan G\u00fcnnemann. 2019. Certifiable robustness and robust training for graph convolutional networks. In SIGKDD.","DOI":"10.1145\/3292500.3330905"}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Ireland","acronym":"CIKM '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 29th ACM International Conference on Information &amp; Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3411983","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3411983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:23Z","timestamp":1750197683000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3411983"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":47,"alternative-id":["10.1145\/3340531.3411983","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3411983","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}