{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T15:00:43Z","timestamp":1777474843838,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"guangdong provincial key laboratory of intellectual property and big data","award":["2018B030322016"],"award-info":[{"award-number":["2018B030322016"]}]},{"name":"special projects for key fields in higher education of guangdong, china","award":["2020ZDZX3077"],"award-info":[{"award-number":["2020ZDZX3077"]}]},{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["U1701266"],"award-info":[{"award-number":["U1701266"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"science and technology project of guangzhou city","award":["202002020035"],"award-info":[{"award-number":["202002020035"]}]},{"name":"characteristic innovation projects of ordinary universities in guangdong province, china","award":["2020KTSCX212"],"award-info":[{"award-number":["2020KTSCX212"]}]},{"name":"characteristic innovation projects of ordinary universities in guangdong province, china","award":["2019KTSCX245"],"award-info":[{"award-number":["2019KTSCX245"]}]},{"name":"projects of south china institute of software engineering of guangzhou university","award":["ky202012"],"award-info":[{"award-number":["ky202012"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Simple graph convolution (SGC) achieves competitive classification accuracy to graph convolutional networks (GCNs) in various tasks while being computationally more efficient and fitting fewer parameters. However, the width of SGC is narrow due to the over-smoothing of SGC with higher power, which limits the learning ability of graph representations. Here, we propose AdjMix, a simple and attentional graph convolutional model, that is scalable to wider structure and captures more nodes features information, by simultaneously mixing the adjacency matrices of different powers. We point out that the key factor of over-smoothing is the mismatched weights of adjacency matrices, and design AdjMix to address the over-smoothing of SGC and GCNs by adjusting the weights to matching values. Experiments on citation networks including Pubmed, Citeseer, and Cora show that our AdjMix improves over SGC by 2.4%, 2.2%, and 3.2%, respectively, while achieving same performance in terms of parameters and complexity, and obtains better performance in terms of classification accuracy, parameters, and complexity, compared to other baselines.<\/jats:p>","DOI":"10.1007\/s40747-021-00567-8","type":"journal-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T23:02:15Z","timestamp":1636412535000},"page":"1005-1014","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["AdjMix: simplifying and attending graph convolutional networks"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0368-7971","authenticated-orcid":false,"given":"Xun","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2059-8818","authenticated-orcid":false,"given":"Fangyuan","family":"Lei","sequence":"additional","affiliation":[]},{"given":"Guoqing","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Yikuan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wenguo","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,8]]},"reference":[{"key":"567_CR1","unstructured":"Abadi M, Agarwal A, Barham P, Brevdo E (2016) Tensorflow: large-scale machine learning on heterogeneous distributed systems. arXiv preprint. arXiv:1603.04467"},{"key":"567_CR2","unstructured":"Abu-El-Haija S, Kapoor A, Perozzi B, Lee J (2019) N-gcn: multi-scale graph convolution for semi-supervised node classification. In: UAI, pp 1\u20139"},{"key":"567_CR3","unstructured":"Abu-El-Haija S, Perozzi B, Kapoor A, Harutyunyan H, Alipourfard N, Lerman K, Steeg G, Galstyan A (2019) Mixhop: higher-order graph convolution architectures via sparsified neighborhood mixing. In: ICML, pp 21\u201329"},{"key":"567_CR4","unstructured":"Atwood J, Towsley D (2016) Diffusion-convolutional neural networks. In: NIPS, pp 1993\u20132001"},{"key":"567_CR5","unstructured":"Battaglia P, Hamrick J, Bapst V (2018) Relational inductive biases, deep learning, and graph networks. arXiv preprint. arXiv:1806.01261"},{"key":"567_CR6","unstructured":"Bruna J, Zaremba W, Szlam A, LeCun Y (2014) Spectral networks and locally connected networks on graphs. In: ICLR, pp 1\u201314"},{"key":"567_CR7","unstructured":"Chen J, Ma T, Xiao C (2018) Fastgcn: fast learning with graph convolutional networks via importance sampling. In: ICLR, pp 1\u201315"},{"key":"567_CR8","doi-asserted-by":"crossref","unstructured":"Chen L, Wu L, Hong R, Zhang K, Wang M (2020) Revisiting graph based collaborative filtering: a linear residual graph convolutional network approach. In: AAAI, pp 27\u201334","DOI":"10.1609\/aaai.v34i01.5330"},{"key":"567_CR9","doi-asserted-by":"publisher","first-page":"103255","DOI":"10.1109\/ACCESS.2019.2929266","volume":"7","author":"H Chiang","year":"2019","unstructured":"Chiang H, Chen M, Huang Y (2019) Wavelet-based EEG processing for epilepsy detection using fuzzy entropy and associative petri net. IEEE Access 7:103255\u2013103262","journal-title":"IEEE Access"},{"key":"567_CR10","unstructured":"Defferrard M, Bresson X, Vandergheynst P (2016) Convolutional neural networks on graphs with fast localized spectral filtering. In: NIPS, pp 3844\u20133852"},{"key":"567_CR11","unstructured":"Duvenaud D, Maclaurin D, Aguilera-Iparraguirre J, G\u00f3mez-Bombarelli R, Hirzel T (2015) Convolutional networks on graphs for learning molecular fingerprints. In: NIPS, pp 2224\u20132232"},{"key":"567_CR12","unstructured":"Gilmer J, Schoenholz S, Riley P, Vinyals O, Dahl G (2017) Neural message passing for quantum chemistry. In: ICML, pp 1263\u20131272"},{"key":"567_CR13","doi-asserted-by":"crossref","unstructured":"Guo S, Lin Y, Feng N, Song C, Wan H (2019) Attention based spatial-temporal graph convolutional networks for traffic flow forecasting. In: AAAI, pp 922\u2013929","DOI":"10.1609\/aaai.v33i01.3301922"},{"key":"567_CR14","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: NIPS, pp 1024\u20131034"},{"key":"567_CR15","doi-asserted-by":"crossref","unstructured":"Hariharan B, Arbel\u00e1ez P, Girshick R, Malik J (2015) Hypercolumns for object segmentation and fine-grained localization. In: CVPR, pp 447\u2013456","DOI":"10.1109\/CVPR.2015.7298642"},{"key":"567_CR16","doi-asserted-by":"crossref","unstructured":"He K, Sun J (2015) Convolutional neural networks at constrained time cost. In: CVPR, pp 5353\u20135360","DOI":"10.1109\/CVPR.2015.7299173"},{"issue":"4","key":"567_CR17","doi-asserted-by":"publisher","first-page":"448","DOI":"10.3390\/electronics10040448","volume":"10","author":"M Islas","year":"2021","unstructured":"Islas M, Rubio J, Mu\u00f1iz S, Ochoa G, Pacheco J, Meda-Campa\u00f1a J, Mujica-Vargas D, Aguilar-Iba\u00f1ez C, Gutierrez G, Zacarias A (2021) A fuzzy logic model for hourly electrical power demand modeling. Electronics 10(4):448","journal-title":"Electronics"},{"key":"567_CR18","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.ins.2021.05.018","volume":"569","author":"J de Jes\u00fas Rubio","year":"2021","unstructured":"de Jes\u00fas Rubio J, Lughofer E, Pieper J, Cruz P, Martinez D, Ochoa G, Islas M, Garcia E (2021) Adapting h-infinity controller for the desired reference tracking of the sphere position in the maglev process. Inf Sci 569:669\u2013686","journal-title":"Inf Sci"},{"key":"567_CR19","doi-asserted-by":"crossref","unstructured":"Kampffmeyer M, Chen Y, Liang X, Wang H, Zhang Y, Xing E (2019) Rethinking knowledge graph propagation for zero-shot learning. In: CVPR, pp 11487\u201311496","DOI":"10.1109\/CVPR.2019.01175"},{"key":"567_CR20","doi-asserted-by":"crossref","unstructured":"Kingma D, Ba J (2015) Adam: a method for stochastic optimization. In: ICLR, pp 1\u201315","DOI":"10.1007\/978-3-662-46214-0_1"},{"key":"567_CR21","unstructured":"Kipf T, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: ICLR, pp 1\u201314"},{"key":"567_CR22","doi-asserted-by":"crossref","unstructured":"Klicpera J, Bojchevski A, G\u00fcnnemann S (2019) Predict then propagate: graph neural networks meet personalized pagerank. In: ICLR, pp 1\u201315","DOI":"10.1145\/3394486.3403296"},{"issue":"6","key":"567_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3363574","volume":"13","author":"J Lee","year":"2019","unstructured":"Lee J, Rossi R, Kim S, Ahmed N, Koh E (2019) Attention models in graphs: a survey. ACM Trans Knowl Discov Data (TKDD) 13(6):1\u201325","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"567_CR24","doi-asserted-by":"crossref","unstructured":"Lei F, Liu X, Dai Q, Ling B, Zhao H, Liu Y (2020) Hybrid low-order and higher-order graph convolutional networks. Comput Intell Neurosci Vol.2020, 3283890:1\u20133283890:9","DOI":"10.1155\/2020\/3283890"},{"key":"567_CR25","doi-asserted-by":"crossref","unstructured":"Li J, Han Z, Cheng H, Su J, Wang P, Zhang J, Pan L (2019) Predicting path failure in time-evolving graphs. In: KDD, pp 1279\u20131289","DOI":"10.1145\/3292500.3330847"},{"key":"567_CR26","doi-asserted-by":"crossref","unstructured":"Li Q, Han Z, Wu X (2018) Deeper insights into graph convolutional networks for semi-supervised learning. In: AAAI, pp 3538\u20133545","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"567_CR27","doi-asserted-by":"crossref","unstructured":"Li Q, Wu X, Liu H, Zhang X, Guan Z (2019) Label efficient semi-supervised learning via graph filtering. In: CVPR, pp 9582\u20139591","DOI":"10.1109\/CVPR.2019.00981"},{"key":"567_CR28","unstructured":"Li Y, Tarlow D, Brockschmidt M, Zemel R (2015) Gated graph sequence neural networks. In: ICLR, pp 1\u201320"},{"key":"567_CR29","unstructured":"Liao R, Zhao Z, Urtasun R, Zemel R (2019) Lanczosnet: multi-scale deep graph convolutional networks. In: ICLR, pp 1\u201318"},{"key":"567_CR30","doi-asserted-by":"publisher","first-page":"31268","DOI":"10.1109\/ACCESS.2021.3060173","volume":"9","author":"X Liu","year":"2021","unstructured":"Liu X, Xia G, Lei F, Zhang Y, Chang S (2021) Higher-order graph convolutional networks with multi-scale neighborhood pooling for semi-supervised node classification. IEEE Access 9:31268\u201331275","journal-title":"IEEE Access"},{"key":"567_CR31","unstructured":"Luan S, Zhao M, Chang X, Precup D (2019) Break the ceiling: stronger multi-scale deep graph convolutional networks. In: NIPS, pp 10943\u201310953"},{"key":"567_CR32","doi-asserted-by":"publisher","first-page":"31968","DOI":"10.1109\/ACCESS.2018.2846483","volume":"6","author":"J Meda-Campa\u00f1a","year":"2018","unstructured":"Meda-Campa\u00f1a J (2018) On the estimation and control of nonlinear systems with parametric uncertainties and noisy outputs. IEEE Access 6:31968\u201331973","journal-title":"IEEE Access"},{"issue":"8","key":"567_CR33","doi-asserted-by":"publisher","first-page":"3510","DOI":"10.1109\/TNNLS.2020.3015200","volume":"32","author":"J de Rubio","year":"2021","unstructured":"de Rubio J (2021) Stability analysis of the modified Levenberg\u2013Marquardt algorithm for the artificial neural network training. IEEE Trans Neural Netw Learn Syst 32(8):3510\u20133524","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"3","key":"567_CR34","first-page":"93","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen P, Namata G, Bilgic M, Getoor L, Galligher B, Eliassi-Rad T (2008) Collective classification in network data. AI Mag 29(3):93\u201393","journal-title":"AI Mag"},{"key":"567_CR35","doi-asserted-by":"crossref","unstructured":"Soriano L, Zamora E, Vazquez-Nicolas J, Hern\u00e1ndez G, Madrigal J, Balderas D (2020) Pd control compensation based on a cascade neural network applied to a robot manipulator. Front Neurorobot Vol.14, 577749:1\u2013577749:9","DOI":"10.3389\/fnbot.2020.577749"},{"key":"567_CR36","doi-asserted-by":"crossref","unstructured":"Szegedy C, Liu W, Jia Y, Sermanet P, Reed S, Anguelov D, Erhan D, Vanhoucke V, Rabinovich A (2015) Going deeper with convolutions. In: CVPR, pp 1\u20139","DOI":"10.1109\/CVPR.2015.7298594"},{"key":"567_CR37","unstructured":"Thekumparampil K, Wang C, Oh S, Li L (2018) Attention-based graph neural network for semi-supervised learning. arXiv preprint. arXiv:1803.03735"},{"key":"567_CR38","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2018) Graph attention networks. In: ICLR, pp 1\u201312"},{"key":"567_CR39","unstructured":"Velickovic P, Fedus W, Hamilton W, Li\u00f2 P, Bengio Y, Hjelm R (2019) Deep graph infomax. In: ICLR, pp 1\u201319"},{"key":"567_CR40","unstructured":"Wu F, Zhang T, Souza J, Fifty C, Yu T, Weinberger K (2019) Simplifying graph convolutional networks. In: ICML, pp 6861\u20136871"},{"key":"567_CR41","doi-asserted-by":"crossref","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Yu P (2020) A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst 32(1):4\u201324","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"567_CR42","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2019) How powerful are graph neural networks? In: ICLR, pp 1\u201317"},{"key":"567_CR43","unstructured":"Yang Z, Cohen W, Salakhutdinov R (2016) Revisiting semi-supervised learning with graph embeddings. In: ICML, pp 40\u201348"},{"key":"567_CR44","unstructured":"Yu W, Qin Z (2020) Graph convolutional network for recommendation with low-pass collaborative filters. In: ICML, pp 10936\u201310945"},{"key":"567_CR45","unstructured":"Zhang J, Shi X, Xie J, Ma H, King I, Yeung D (2018) Gaan: Gated attention networks for learning on large and spatiotemporal graphs. In: UAI, pp 339\u2013349"},{"key":"567_CR46","unstructured":"Zhou J, Cui G, Zhang Z, Yang C, Liu Z, Wang L, Li C, Sun M (2018) Graph neural networks: a review of methods and applications. arXiv:1812.08434"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00567-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00567-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00567-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T18:32:25Z","timestamp":1673721145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00567-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,8]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["567"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00567-8","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,8]]},"assertion":[{"value":"4 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}