{"id":"https://openalex.org/W4391661613","doi":"https://doi.org/10.1109/tcsii.2024.3364090","title":"A Robust Proportionate Graph Recursive Least Squares Algorithm for Adaptive Graph Signal Recovery","display_name":"A Robust Proportionate Graph Recursive Least Squares Algorithm for Adaptive Graph Signal Recovery","publication_year":2024,"publication_date":"2024-02-08","ids":{"openalex":"https://openalex.org/W4391661613","doi":"https://doi.org/10.1109/tcsii.2024.3364090"},"language":"en","primary_location":{"id":"doi:10.1109/tcsii.2024.3364090","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcsii.2024.3364090","pdf_url":null,"source":{"id":"https://openalex.org/S93916849","display_name":"IEEE Transactions on Circuits & Systems II Express Briefs","issn_l":"1549-7747","issn":["1549-7747","1558-3791"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Circuits and Systems II: Express Briefs","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008741161","display_name":"Alireza Naeimi Sadigh","orcid":"https://orcid.org/0000-0001-9225-649X"},"institutions":[{"id":"https://openalex.org/I928334797","display_name":"Semnan University","ror":"https://ror.org/029gksw03","country_code":"IR","type":"education","lineage":["https://openalex.org/I928334797"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Alireza Naeimi Sadigh","raw_affiliation_strings":["Department of Computer Science, Semnan University, Semnan, Iran"],"raw_orcid":"https://orcid.org/0000-0001-9225-649X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Semnan University, Semnan, Iran","institution_ids":["https://openalex.org/I928334797"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046308590","display_name":"Hadi Zayyani","orcid":"https://orcid.org/0000-0001-6350-6541"},"institutions":[{"id":"https://openalex.org/I4210157736","display_name":"Qom University of Technology","ror":"https://ror.org/04zepk655","country_code":"IR","type":"education","lineage":["https://openalex.org/I4210157736"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Hadi Zayyani","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Qom University of Technology, Qom, Iran","Department of Electrical and Computer Engineering, Qom University of Technology (QUT), Qom, Iran"],"raw_orcid":"https://orcid.org/0000-0001-6350-6541","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Qom University of Technology, Qom, Iran","institution_ids":["https://openalex.org/I4210157736"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Qom University of Technology (QUT), Qom, Iran","institution_ids":["https://openalex.org/I4210157736"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061528856","display_name":"Mehdi Korki","orcid":"https://orcid.org/0000-0002-9914-1852"},"institutions":[{"id":"https://openalex.org/I57093077","display_name":"Swinburne University of Technology","ror":"https://ror.org/031rekg67","country_code":"AU","type":"education","lineage":["https://openalex.org/I57093077"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Mehdi Korki","raw_affiliation_strings":["School of Science, Computing, and Engineering Technologies, Swinburne University of Technology, Melbourne, VIC, Australia"],"raw_orcid":"https://orcid.org/0000-0002-9914-1852","affiliations":[{"raw_affiliation_string":"School of Science, Computing, and Engineering Technologies, Swinburne University of Technology, Melbourne, VIC, Australia","institution_ids":["https://openalex.org/I57093077"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008741161"],"corresponding_institution_ids":["https://openalex.org/I928334797"],"apc_list":null,"apc_paid":null,"fwci":1.6557,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.8517104,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"71","issue":"7","first_page":"3608","last_page":"3612"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9961000084877014,"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.9961000084877014,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9904000163078308,"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"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9855999946594238,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5806344747543335},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5313518643379211},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5041552782058716},{"id":"https://openalex.org/keywords/recursive-least-squares-filter","display_name":"Recursive least squares filter","score":0.5006065368652344},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.4814838171005249},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.47579440474510193},{"id":"https://openalex.org/keywords/adaptive-filter","display_name":"Adaptive filter","score":0.4618368148803711},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45292675495147705},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37069180607795715},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3434871435165405},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11006227135658264}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5806344747543335},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5313518643379211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5041552782058716},{"id":"https://openalex.org/C145249878","wikidata":"https://www.wikidata.org/wiki/Q2835868","display_name":"Recursive least squares filter","level":3,"score":0.5006065368652344},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.4814838171005249},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.47579440474510193},{"id":"https://openalex.org/C102248274","wikidata":"https://www.wikidata.org/wiki/Q168388","display_name":"Adaptive filter","level":2,"score":0.4618368148803711},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45292675495147705},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37069180607795715},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3434871435165405},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11006227135658264},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcsii.2024.3364090","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcsii.2024.3364090","pdf_url":null,"source":{"id":"https://openalex.org/S93916849","display_name":"IEEE Transactions on Circuits & Systems II Express Briefs","issn_l":"1549-7747","issn":["1549-7747","1558-3791"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Circuits and Systems II: Express Briefs","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W30287484","https://openalex.org/W613054787","https://openalex.org/W1540550726","https://openalex.org/W1996124770","https://openalex.org/W2101491865","https://openalex.org/W2117869333","https://openalex.org/W2473995246","https://openalex.org/W2755388561","https://openalex.org/W2796431263","https://openalex.org/W2949959605","https://openalex.org/W2949991997","https://openalex.org/W2977861416","https://openalex.org/W2999687012","https://openalex.org/W3032985158","https://openalex.org/W3036074714","https://openalex.org/W3037100382","https://openalex.org/W3061819606","https://openalex.org/W3092017660","https://openalex.org/W3098927376","https://openalex.org/W3113157637","https://openalex.org/W3116642445","https://openalex.org/W3198051232","https://openalex.org/W4212881889","https://openalex.org/W4213058999","https://openalex.org/W4296564843","https://openalex.org/W4377971443","https://openalex.org/W6843171768","https://openalex.org/W7000859859"],"related_works":["https://openalex.org/W1600697972","https://openalex.org/W2081837274","https://openalex.org/W2027630946","https://openalex.org/W3119704784","https://openalex.org/W2164852895","https://openalex.org/W4282823030","https://openalex.org/W2544484136","https://openalex.org/W2529395309","https://openalex.org/W3134357585","https://openalex.org/W2182582018"],"abstract_inverted_index":{"In":[0,28],"this":[1,29,50],"brief,":[2],"we":[3,121],"propose":[4],"a":[5,31,39,64,84],"robust":[6],"proportionate":[7,77],"Recursive":[8],"Least":[9],"Square":[10],"(RLS)":[11],"algorithm":[12,57,157],"to":[13,91,111],"address":[14],"the":[15,23,53,59,76,88,93,127,137,141,150,153,164],"problem":[16,98],"of":[17,25,41,152,163,166,170],"adaptive":[18,47],"graph":[19,32,43,55,78],"signal":[20,33,44],"recovery":[21],"in":[22,45,58,63,87,161,168],"presence":[24,169],"impulsive":[26,119,171],"noise.":[27,172],"problem,":[30],"should":[34],"be":[35],"recovered":[36],"from":[37,126],"only":[38],"subset":[40],"sampled":[42],"an":[46,71,96,132],"manner.":[48],"To":[49,115],"end,":[51],"first,":[52],"classical":[54],"RLS":[56,79,156],"literature":[60],"is":[61,68,80,104,109],"written":[62],"standard":[65],"way,":[66],"which":[67],"represented":[69],"by":[70,82],"error":[72],"correction":[73],"term.":[74],"Second,":[75],"formulated":[81],"adding":[83],"gain":[85,94],"matrix":[86],"recursion.":[89],"Then,":[90],"calculate":[92],"matrix,":[95],"optimization":[97],"with":[99],"non-negative":[100],"and":[101,140],"scaling":[102],"constraints":[103],"suggested.":[105],"The":[106],"active-set":[107],"approach":[108],"utilized":[110],"handle":[112],"these":[113],"constraints.":[114],"enhance":[116],"robustness":[117],"against":[118],"noise,":[120],"utilize":[122],"optimized":[123],"coefficients":[124],"derived":[125],"minimum":[128,138],"disturbance":[129,139],"principle.":[130],"Moreover,":[131],"analytical":[133],"lower":[134],"bound":[135],"for":[136],"computational":[142],"complexity":[143],"analysis":[144],"are":[145],"given.":[146],"Simulation":[147],"results":[148],"show":[149],"advantages":[151],"proposed":[154],"proportionate-based":[155],"over":[158],"other":[159],"approaches":[160],"terms":[162],"rate":[165],"convergence":[167]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}
