{"id":"https://openalex.org/W4416666137","doi":"https://doi.org/10.3390/a18120739","title":"GLADC: Global Linear Attention and Dual Constraint for Mitigating Over-Smoothing in Graph Neural Networks","display_name":"GLADC: Global Linear Attention and Dual Constraint for Mitigating Over-Smoothing in Graph Neural Networks","publication_year":2025,"publication_date":"2025-11-25","ids":{"openalex":"https://openalex.org/W4416666137","doi":"https://doi.org/10.3390/a18120739"},"language":"en","primary_location":{"id":"doi:10.3390/a18120739","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18120739","pdf_url":"https://www.mdpi.com/1999-4893/18/12/739/pdf?version=1764057595","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/18/12/739/pdf?version=1764057595","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059561550","display_name":"Zepeng Chen","orcid":"https://orcid.org/0000-0002-3767-6907"},"institutions":[{"id":"https://openalex.org/I198091727","display_name":"Tiangong University","ror":"https://ror.org/00xsr9m91","country_code":"CN","type":"education","lineage":["https://openalex.org/I198091727"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zepeng Chen","raw_affiliation_strings":["School of Artificial Intelligence, Tiangong University, Tianjin 300387, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Artificial Intelligence, Tiangong University, Tianjin 300387, China","institution_ids":["https://openalex.org/I198091727"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100318832","display_name":"Yang Yan","orcid":"https://orcid.org/0000-0001-7694-2801"},"institutions":[{"id":"https://openalex.org/I133270356","display_name":"Tianjin University of Technology and Education","ror":"https://ror.org/035gwtk09","country_code":"CN","type":"education","lineage":["https://openalex.org/I133270356"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yang Yan","raw_affiliation_strings":["School of Information Technology and Engineering, Tianjin University of Technology and Education, Tianjin 300222, China"],"raw_orcid":"https://orcid.org/0000-0001-7694-2801","affiliations":[{"raw_affiliation_string":"School of Information Technology and Engineering, Tianjin University of Technology and Education, Tianjin 300222, China","institution_ids":["https://openalex.org/I133270356"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101795819","display_name":"Qiuyan Wang","orcid":"https://orcid.org/0000-0001-5951-9219"},"institutions":[{"id":"https://openalex.org/I198091727","display_name":"Tiangong University","ror":"https://ror.org/00xsr9m91","country_code":"CN","type":"education","lineage":["https://openalex.org/I198091727"]},{"id":"https://openalex.org/I64449678","display_name":"Putian University","ror":"https://ror.org/00jmsxk74","country_code":"CN","type":"education","lineage":["https://openalex.org/I64449678"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Qiuyan Wang","raw_affiliation_strings":["Fujian Key Laboratory of Financial Information Processing, Putian University, Putian 351100, China","School of Computer Science and Technology, Tiangong University, Tianjin 300387, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fujian Key Laboratory of Financial Information Processing, Putian University, Putian 351100, China","institution_ids":["https://openalex.org/I64449678"]},{"raw_affiliation_string":"School of Computer Science and Technology, Tiangong University, Tianjin 300387, China","institution_ids":["https://openalex.org/I198091727"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036433213","display_name":"Hanning Chen","orcid":"https://orcid.org/0000-0003-1956-5135"},"institutions":[{"id":"https://openalex.org/I132369690","display_name":"Tianjin University of Science and Technology","ror":"https://ror.org/018rbtf37","country_code":"CN","type":"education","lineage":["https://openalex.org/I132369690"]},{"id":"https://openalex.org/I198091727","display_name":"Tiangong University","ror":"https://ror.org/00xsr9m91","country_code":"CN","type":"education","lineage":["https://openalex.org/I198091727"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hanning Chen","raw_affiliation_strings":["College of Artificial Intelligence, Tianjin University of Science and Technology, Tianjin 300457, China","School of Artificial Intelligence, Tiangong University, Tianjin 300387, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Artificial Intelligence, Tianjin University of Science and Technology, Tianjin 300457, China","institution_ids":["https://openalex.org/I132369690"]},{"raw_affiliation_string":"School of Artificial Intelligence, Tiangong University, Tianjin 300387, China","institution_ids":["https://openalex.org/I198091727"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5036433213","https://openalex.org/A5100318832","https://openalex.org/A5101795819"],"corresponding_institution_ids":["https://openalex.org/I132369690","https://openalex.org/I133270356","https://openalex.org/I198091727","https://openalex.org/I64449678"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1782},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1315507,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"12","first_page":"739","last_page":"739"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.0012000000569969416,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.0010999999940395355,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5723999738693237},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5220000147819519},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.4941999912261963},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.46389999985694885},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4578999876976013},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4226999878883362},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.39820000529289246},{"id":"https://openalex.org/keywords/attention-network","display_name":"Attention network","score":0.3723999857902527},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.36739999055862427}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7717000246047974},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5723999738693237},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5220000147819519},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.4941999912261963},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47530001401901245},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.46389999985694885},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4578999876976013},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4226999878883362},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.39820000529289246},{"id":"https://openalex.org/C2993807640","wikidata":"https://www.wikidata.org/wiki/Q103709453","display_name":"Attention network","level":2,"score":0.3723999857902527},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.36739999055862427},{"id":"https://openalex.org/C81363708","wikidata":"https://www.wikidata.org/wiki/Q17084460","display_name":"Convolutional neural network","level":2,"score":0.36469998955726624},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.3571000099182129},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.3303999900817871},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3260999917984009},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.32409998774528503},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.31279999017715454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.304500013589859},{"id":"https://openalex.org/C103275481","wikidata":"https://www.wikidata.org/wiki/Q6787889","display_name":"Matrix representation","level":3,"score":0.30329999327659607},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.2992999851703644},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C2777402240","wikidata":"https://www.wikidata.org/wiki/Q6783436","display_name":"Masking (illustration)","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2678999900817871},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2558000087738037},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.25440001487731934},{"id":"https://openalex.org/C2984842247","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep neural networks","level":3,"score":0.2522999942302704},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a18120739","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18120739","pdf_url":"https://www.mdpi.com/1999-4893/18/12/739/pdf?version=1764057595","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:08bcaedb43bb4e38b1d89761958dd00d","is_oa":true,"landing_page_url":"https://doaj.org/article/08bcaedb43bb4e38b1d89761958dd00d","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 18, Iss 12, p 739 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a18120739","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18120739","pdf_url":"https://www.mdpi.com/1999-4893/18/12/739/pdf?version=1764057595","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2272024944","display_name":null,"funder_award_id":"JXJS202507","funder_id":"https://openalex.org/F4320326529","funder_display_name":"Putian University"}],"funders":[{"id":"https://openalex.org/F4320326529","display_name":"Putian University","ror":"https://ror.org/00jmsxk74"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416666137.pdf","grobid_xml":"https://content.openalex.org/works/W4416666137.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W2964051675","https://openalex.org/W2990045899","https://openalex.org/W2998496395","https://openalex.org/W3040502399","https://openalex.org/W3081661078","https://openalex.org/W3209520664","https://openalex.org/W4200477411","https://openalex.org/W4290943435","https://openalex.org/W4291900448","https://openalex.org/W4382239899","https://openalex.org/W4399740943","https://openalex.org/W4400207826","https://openalex.org/W4401857222","https://openalex.org/W4405267333","https://openalex.org/W4408295653"],"related_works":[],"abstract_inverted_index":{"Graph":[0],"Convolutional":[1],"Networks":[2],"(GCNs)":[3],"enhance":[4],"node":[5,21,61],"representations":[6],"by":[7],"aggregating":[8],"information":[9,98],"from":[10,18,34],"neighboring":[11],"nodes,":[12],"but":[13,32],"deeper":[14],"layers":[15,45],"often":[16],"suffer":[17,33],"over-smoothing,":[19],"where":[20],"embeddings":[22],"become":[23],"indistinguishable.":[24],"Transformers":[25],"enable":[26],"global":[27,65,117],"dependency":[28,71],"modeling":[29],"on":[30,90,126],"graphs":[31],"high":[35],"computational":[36],"costs":[37],"and":[38,73,100,110,136,160],"can":[39],"exacerbate":[40],"over-smoothing":[41,159],"when":[42],"multiple":[43],"attention":[44,67],"are":[46],"stacked.":[47],"To":[48],"address":[49],"these":[50],"issues,":[51],"we":[52],"propose":[53],"GLADC,":[54],"a":[55,74],"novel":[56],"framework":[57],"designed":[58],"for":[59,68,78],"semi-supervised":[60],"classification.":[62],"It":[63],"integrates":[64],"linear":[66],"efficient":[69],"long-range":[70],"capture":[72],"dual":[75,82],"constraint":[76,83,104],"module":[77],"local":[79],"propagation.":[80],"The":[81],"consists":[84],"of":[85,154],"(1)":[86],"column-wise":[87],"random":[88],"masking":[89],"the":[91,151],"representation":[92,122],"matrix":[93],"to":[94,105,143],"dynamically":[95],"limit":[96],"redundant":[97],"aggregation,":[99],"(2)":[101],"row-wise":[102],"contrastive":[103],"explicitly":[106],"increase":[107],"inter-node":[108],"distance":[109],"preserve":[111],"distinctiveness.":[112],"This":[113],"design":[114],"achieves":[115],"linear-complexity":[116],"mixing":[118],"while":[119],"effectively":[120],"countering":[121],"homogenization.":[123],"Extensive":[124],"evaluations":[125],"seven":[127],"real-world":[128],"datasets":[129],"demonstrate":[130],"that":[131],"GLADC":[132],"delivers":[133],"competitive":[134],"performance":[135],"maintains":[137],"robustness":[138],"in":[139,157],"deep":[140],"architectures":[141],"(up":[142],"32":[144],"layers).":[145],"An":[146],"ablation":[147],"study":[148],"further":[149],"confirms":[150],"synergistic":[152],"effect":[153],"both":[155],"constraints":[156],"alleviating":[158],"preventing":[161],"premature":[162],"convergence.":[163]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-11-25T00:00:00"}