{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T23:24:40Z","timestamp":1783380280672,"version":"3.54.6"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T00:00:00Z","timestamp":1776038400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T00:00:00Z","timestamp":1776038400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s12293-026-00503-8","type":"journal-article","created":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T06:59:48Z","timestamp":1776063588000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-objective optimization for enhanced graph neural networks"],"prefix":"10.1007","volume":"18","author":[{"given":"Ali","family":"Boufssasse","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"El Houssaine","family":"Hssayni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nour-Eddine","family":"Joudar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed","family":"Ettaouil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,13]]},"reference":[{"key":"503_CR1","first-page":"22118","volume":"33","author":"W Hu","year":"2020","unstructured":"Hu W, Fey M, Zitnik M, Dong Y, Ren H, Liu B, Catasta M, Leskovec J (2020) Open graph benchmark: Datasets for machine learning on graphs. Adv Neural Inf Process Syst 33:22118\u201322133","journal-title":"Adv Neural Inf Process Syst"},{"issue":"9","key":"503_CR2","doi-asserted-by":"publisher","first-page":"4785","DOI":"10.1109\/TNNLS.2021.3060872","volume":"33","author":"W Liu","year":"2021","unstructured":"Liu W, Zhang Y, Wang J, He Y, Caverlee J, Chan PP, Yeung DS, Heng P-A (2021) Item relationship graph neural networks for e-commerce. IEEE Transactions on Neural Networks and Learning Systems 33(9):4785\u20134799","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"12","key":"503_CR3","doi-asserted-by":"publisher","first-page":"12012","DOI":"10.1109\/TKDE.2021.3118815","volume":"35","author":"X Ma","year":"2021","unstructured":"Ma X, Wu J, Xue S, Yang J, Zhou C, Sheng QZ, Xiong H, Akoglu L (2021) A comprehensive survey on graph anomaly detection with deep learning. IEEE Trans Knowl Data Eng 35(12):12012\u201312038","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"503_CR4","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.neuroimage.2016.11.026","volume":"146","author":"C Nicolini","year":"2017","unstructured":"Nicolini C, Bordier C, Bifone A (2017) Community detection in weighted brain connectivity networks beyond the resolution limit. Neuroimage 146:28\u201339","journal-title":"Neuroimage"},{"key":"503_CR5","doi-asserted-by":"crossref","unstructured":"Hssayni Eh, Boufssasse A, Joudar N-E, Ettaouil M (2025) Novel dropout approach for mitigating over-smoothing in graph neural networks. Appl Intell 55(5):354","DOI":"10.1007\/s10489-025-06285-9"},{"issue":"3","key":"503_CR6","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1007\/s00521-021-06540-3","volume":"34","author":"EH Hssayni","year":"2022","unstructured":"Hssayni EH, Joudar N-E, Ettaouil M (2022) Krr-cnn: kernels redundancy reduction in convolutional neural networks. Neural Comput Appl 34(3):2443\u20132454","journal-title":"Neural Comput Appl"},{"key":"503_CR7","doi-asserted-by":"crossref","unstructured":"Boufssasse A, Hssayni Eh, Joudar N-E, Ettaouil M, et al (2023) A multi-objective optimization model for redundancy reduction in convolutional neural networks. Neural Processing Letters, 1\u201321","DOI":"10.1007\/s11063-023-11223-2"},{"key":"503_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116796","volume":"200","author":"A Zeb","year":"2022","unstructured":"Zeb A, Saif S, Chen J, Haq AU, Gong Z, Zhang D (2022) Complex graph convolutional network for link prediction in knowledge graphs. Expert Syst Appl 200:116796","journal-title":"Expert Syst Appl"},{"issue":"1","key":"503_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Philip SY (2020) A comprehensive survey on graph neural networks. IEEE transactions on neural networks and learning systems 32(1):4\u201324","journal-title":"IEEE transactions on neural networks and learning systems"},{"key":"503_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.future.2024.04.052","volume":"158","author":"N Hu","year":"2024","unstructured":"Hu N, Zhang D, Xie K, Liang W, Li K-C, Zomaya AY (2024) Dynamic multi-scale spatial-temporal graph convolutional network for traffic flow prediction. Futur Gener Comput Syst 158:323\u2013332","journal-title":"Futur Gener Comput Syst"},{"key":"503_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.109542","volume":"139","author":"J Lu","year":"2025","unstructured":"Lu J, Chen Z, Deng X (2025) A graph convolutional neural network model based on fused multi-subgraph as input and fused feature information as output. Eng Appl Artif Intell 139:109542","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"503_CR12","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1109\/TKDE.2021.3072345","volume":"35","author":"Y Ye","year":"2021","unstructured":"Ye Y, Ji S (2021) Sparse graph attention networks. IEEE Trans Knowl Data Eng 35(1):905\u2013916","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"503_CR13","doi-asserted-by":"crossref","unstructured":"Li Q, Han Z, Wu X-M (2018) Deeper insights into graph convolutional networks for semi-supervised learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, 32","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"503_CR14","unstructured":"Huang K, Wang YG, Li M, et al (2024) How universal polynomial bases enhance spectral graph neural networks: Heterophily, over-smoothing, and over-squashing. arXiv preprint arXiv:2405.12474"},{"key":"503_CR15","unstructured":"Chen M, Wei Z, Huang Z, Ding B, Li Y (2020) Simple and deep graph convolutional networks. In: International Conference on Machine Learning, 1725\u20131735. PMLR"},{"key":"503_CR16","doi-asserted-by":"crossref","unstructured":"Hamilton WL (2020) Graph Representation Learning. Morgan & Claypool Publishers","DOI":"10.1007\/978-3-031-01588-5"},{"key":"503_CR17","doi-asserted-by":"crossref","unstructured":"Li G, Muller M, Thabet A, Ghanem B (2019) Deepgcns: Can gcns go as deep as cnns? In: Proceedings of the IEEE\/CVF International Conference on Computer Vision, 9267\u20139276","DOI":"10.1109\/ICCV.2019.00936"},{"key":"503_CR18","doi-asserted-by":"crossref","unstructured":"Huang G, Liu Z, Van Der Maaten L, Weinberger KQ (2017) Densely connected convolutional networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 4700\u20134708","DOI":"10.1109\/CVPR.2017.243"},{"key":"503_CR19","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907"},{"key":"503_CR20","doi-asserted-by":"crossref","unstructured":"He K, Zhang X, Ren S, Sun J (2016) Deep residual learning for image recognition. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 770\u2013778","DOI":"10.1109\/CVPR.2016.90"},{"key":"503_CR21","doi-asserted-by":"crossref","unstructured":"Pham T, Tran T, Phung D, Venkatesh S (2017) Column networks for collective classification. In: Proceedings of the AAAI Conference on Artificial Intelligence, 31","DOI":"10.1609\/aaai.v31i1.10851"},{"key":"503_CR22","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.neunet.2022.03.008","volume":"150","author":"A Rassil","year":"2022","unstructured":"Rassil A, Chougrad H, Zouaki H (2022) Augmented graph neural network with hierarchical global-based residual connections. Neural Netw 150:149\u2013166","journal-title":"Neural Netw"},{"key":"503_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109567","volume":"253","author":"EH Hssayni","year":"2022","unstructured":"Hssayni EH, Joudar N-E, Ettaouil M (2022) An adaptive drop method for deep neural networks regularization: Estimation of dropconnect hyperparameter using generalization gap. Knowl-Based Syst 253:109567","journal-title":"Knowl-Based Syst"},{"key":"503_CR24","doi-asserted-by":"crossref","unstructured":"Fang T, Xiao Z, Wang C, Xu J, Yang X, Yang Y (2023) Dropmessage: Unifying random dropping for graph neural networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, 37, 4267\u20134275","DOI":"10.1609\/aaai.v37i4.25545"},{"key":"503_CR25","first-page":"5812","volume":"33","author":"Y You","year":"2020","unstructured":"You Y, Chen T, Sui Y, Chen T, Wang Z, Shen Y (2020) Graph contrastive learning with augmentations. Adv Neural Inf Process Syst 33:5812\u20135823","journal-title":"Adv Neural Inf Process Syst"},{"key":"503_CR26","first-page":"22092","volume":"33","author":"W Feng","year":"2020","unstructured":"Feng W, Zhang J, Dong Y, Han Y, Luan H, Xu Q, Yang Q, Kharlamov E, Tang J (2020) Graph random neural networks for semi-supervised learning on graphs. Adv Neural Inf Process Syst 33:22092\u201322103","journal-title":"Adv Neural Inf Process Syst"},{"key":"503_CR27","unstructured":"Zou D, Hu Z, Wang Y, Jiang S, Sun Y, Gu Q (2019) Layer-dependent importance sampling for training deep and large graph convolutional networks. Advances in neural information processing systems 32"},{"key":"503_CR28","unstructured":"Chen J, Ma T, Xiao C (2018) Fastgcn: fast learning with graph convolutional networks via importance sampling. arXiv preprint arXiv:1801.10247"},{"key":"503_CR29","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. Advances in neural information processing systems 30"},{"key":"503_CR30","unstructured":"Rong Y, Huang W, Xu T, Huang J (2019) Dropedge: Towards deep graph convolutional networks on node classification. arXiv preprint arXiv:1907.10903"},{"key":"503_CR31","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.neunet.2023.03.022","volume":"163","author":"B Jiang","year":"2023","unstructured":"Jiang B, Chen Y, Wang B, Xu H, Luo B (2023) Dropagg: Robust graph neural networks via drop aggregation. Neural Netw 163:65\u201374","journal-title":"Neural Netw"},{"issue":"4","key":"503_CR32","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MSP.2017.2693418","volume":"34","author":"MM Bronstein","year":"2017","unstructured":"Bronstein MM, Bruna J, LeCun Y, Szlam A, Vandergheynst P (2017) Geometric deep learning: going beyond euclidean data. IEEE Signal Process Mag 34(4):18\u201342","journal-title":"IEEE Signal Process Mag"},{"key":"503_CR33","unstructured":"Bruna J, Zaremba W, Szlam A, LeCun Y (2013) Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203"},{"key":"503_CR34","unstructured":"Defferrard. M, Bresson X, Vandergheynst P (2016) Convolutional neural networks on graphs with fast localized spectral filtering. Advances in neural information processing systems 29"},{"key":"503_CR35","unstructured":"Gilmer J, Schoenholz SS, Riley PF, Vinyals O, Dahl GE (2017) Neural message passing for quantum chemistry. In: International Conference on Machine Learning, 1263\u20131272 . PMLR"},{"key":"503_CR36","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv preprint arXiv:1710.10903"},{"key":"503_CR37","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2018) How powerful are graph neural networks? arXiv preprint arXiv:1810.00826"},{"key":"503_CR38","unstructured":"Weisfeiler B, Leman A (1968) The reduction of a graph to canonical form and the algebra which appears therein. nti, Series 2(9):12\u201316"},{"key":"503_CR39","doi-asserted-by":"crossref","unstructured":"Figueira J, Greco S, Ehrgott M (2005) Multiple criteria decision analysis: state of the art surveys","DOI":"10.1007\/b100605"},{"key":"503_CR40","doi-asserted-by":"crossref","unstructured":"Zitzler E, Thiele L (1998) Multiobjective optimization using evolutionary algorithms\u2014a comparative case study. In: International Conference on Parallel Problem Solving from Nature, 292\u2013301. Springer","DOI":"10.1007\/BFb0056872"},{"issue":"2","key":"503_CR41","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: Empirical results. Evol Comput 8(2):173\u2013195","journal-title":"Evol Comput"},{"key":"503_CR42","doi-asserted-by":"crossref","unstructured":"Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii. In: International Conference on Parallel Problem Solving from Nature, 849\u2013858. Springer","DOI":"10.1007\/3-540-45356-3_83"},{"key":"503_CR43","unstructured":"Abu-El-Haija S, Perozzi B, Kapoor A, Alipourfard N. Lerman K, Harutyunyan H, Ver Steeg G, Galstyan A (2019) Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing. In: International Conference on Machine Learning, 21\u201329. PMLR"},{"key":"503_CR44","unstructured":"Xu K, Li C, Tian Y, Sonobe T, Kawarabayashi K-i, Jegelka S (2018) Representation learning on graphs with jumping knowledge networks. In: International Conference on Machine Learning, 5453\u20135462 . PMLR"},{"issue":"3","key":"503_CR45","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":"503_CR46","doi-asserted-by":"crossref","unstructured":"Zhao T, Zhang X, Wang S (2021) Graphsmote: Imbalanced node classification on graphs with graph neural networks. In: Proceedings of the 14th ACM International Conference on Web Search and Data Mining, 833\u2013841","DOI":"10.1145\/3437963.3441720"},{"issue":"1","key":"503_CR47","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1038\/s41597-020-0543-2","volume":"7","author":"J Xu","year":"2020","unstructured":"Xu J, Kim S, Song M, Jeong M, Kim D, Kang J, Rousseau JF, Li X, Xu W, Torvik VI (2020) etal Building a pubmed knowledge graph. Scientific data 7(1):205","journal-title":"Scientific data"},{"key":"503_CR48","unstructured":"Shchur O, Mumme M, Bojchevski A, G\u00fcnnemann S (2018) Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868"},{"key":"503_CR49","unstructured":"Yang Z, Cohen W, Salakhudinov R (2016) Revisiting semi-supervised learning with graph embeddings. In: International Conference on Machine Learning, 40\u201348. PMLR"},{"key":"503_CR50","unstructured":"Qu M, Bengio Y, Tang J (2019) Gmnn: Graph markov neural networks. In: International Conference on Machine Learning, 5241\u20135250. PMLR"},{"key":"503_CR51","unstructured":"Gasteiger J, Bojchevski A, G\u00fcnnemann S (2018) Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997"},{"key":"503_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119463","volume":"647","author":"K Guo","year":"2023","unstructured":"Guo K, Cao X, Liu Z, Chang Y (2023) Taming over-smoothing representation on heterophilic graphs. Inf Sci 647:119463","journal-title":"Inf Sci"},{"key":"503_CR53","doi-asserted-by":"crossref","unstructured":"Guo C, Guo X, Huang S, Su Y, Zhu D, Xiahou J (2025) Immunizing over-smoothing: Dual-channel graph convolutional network. Expert Systems with Applications, 128976","DOI":"10.2139\/ssrn.5167400"},{"key":"503_CR54","doi-asserted-by":"crossref","unstructured":"Jin W, Derr T, Wang Y, Ma Y, Liu Z, Tang J (2021) Node similarity preserving graph convolutional networks. In: Proceedings of the 14th ACM International Conference on Web Search and Data Mining, 148\u2013156","DOI":"10.1145\/3437963.3441735"},{"key":"503_CR55","doi-asserted-by":"crossref","unstructured":"Hoseinnia F, Ghatee M, Chehreghani MH (2025) Mitigating over-smoothing in graph neural networks for node classification through adaptive early embedding and biased dropedge procedures. Knowledge-Based Systems, 113615","DOI":"10.1016\/j.knosys.2025.113615"},{"key":"503_CR56","unstructured":"Li Y, Jin W, Xu H, Tang J (2020) Deeprobust: A pytorch library for adversarial attacks and defenses. arXiv preprint arXiv:2005.06149"},{"key":"503_CR57","doi-asserted-by":"crossref","unstructured":"Z\u00fcgner D, Akbarnejad A, G\u00fcnnemann S (2018) Adversarial attacks on neural networks for graph data. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2847\u20132856","DOI":"10.1145\/3219819.3220078"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-026-00503-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-026-00503-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-026-00503-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T05:45:10Z","timestamp":1783057510000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-026-00503-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,13]]},"references-count":57,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["503"],"URL":"https:\/\/doi.org\/10.1007\/s12293-026-00503-8","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,13]]},"assertion":[{"value":"21 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"21"}}