{"id":"https://openalex.org/W4414322001","doi":"https://doi.org/10.1109/tkde.2025.3611663","title":"Diversifying Graph Augmentation for Learning to Solve Graph Optimization Problems","display_name":"Diversifying Graph Augmentation for Learning to Solve Graph Optimization Problems","publication_year":2025,"publication_date":"2025-09-18","ids":{"openalex":"https://openalex.org/W4414322001","doi":"https://doi.org/10.1109/tkde.2025.3611663"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2025.3611663","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2025.3611663","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Knowledge and Data Engineering","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/A5041159626","display_name":"Bay-Yuan Hsu","orcid":"https://orcid.org/0000-0001-8080-3951"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Bay-Yuan Hsu","raw_affiliation_strings":["Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, Taiwan"],"raw_orcid":"https://orcid.org/0000-0001-8080-3951","affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042801403","display_name":"Chen-Hsu Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chen-Hsu Yang","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028318411","display_name":"Chia-Hsun Lu","orcid":"https://orcid.org/0009-0007-5966-8987"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chia-Hsun Lu","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015367567","display_name":"Ming\u2010Yi Chang","orcid":"https://orcid.org/0000-0001-6422-0246"},"institutions":[{"id":"https://openalex.org/I114150738","display_name":"Fu Jen Catholic University","ror":"https://ror.org/04je98850","country_code":"TW","type":"education","lineage":["https://openalex.org/I114150738"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Ming-Yi Chang","raw_affiliation_strings":["Department of Sociology, Fu Jen Catholic University, New Taipei City, Taiwan"],"raw_orcid":"https://orcid.org/0000-0001-6422-0246","affiliations":[{"raw_affiliation_string":"Department of Sociology, Fu Jen Catholic University, New Taipei City, Taiwan","institution_ids":["https://openalex.org/I114150738"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006608753","display_name":"Lo\u2010Yao Yeh","orcid":"https://orcid.org/0000-0002-9764-0455"},"institutions":[{"id":"https://openalex.org/I22265921","display_name":"National Central University","ror":"https://ror.org/00944ve71","country_code":"TW","type":"education","lineage":["https://openalex.org/I22265921"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Lo-Yao Yeh","raw_affiliation_strings":["Department of Information Management, National Central University, Taoyuan, Taiwan"],"raw_orcid":"https://orcid.org/0000-0002-9764-0455","affiliations":[{"raw_affiliation_string":"Department of Information Management, National Central University, Taoyuan, Taiwan","institution_ids":["https://openalex.org/I22265921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012064471","display_name":"Chih-Ya Shen","orcid":"https://orcid.org/0000-0002-0377-7945"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chih-Ya Shen","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"],"raw_orcid":"https://orcid.org/0000-0002-0377-7945","affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09482859,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":"12","first_page":"7060","last_page":"7075"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.8345000147819519,"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.8345000147819519,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5497000217437744},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4235000014305115},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.364300012588501},{"id":"https://openalex.org/keywords/clique-width","display_name":"Clique-width","score":0.31619998812675476},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.30300000309944153},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.27489998936653137}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7483999729156494},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5497000217437744},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46219998598098755},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4235000014305115},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.364300012588501},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3490999937057495},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.31619998812675476},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27790001034736633},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.27399998903274536},{"id":"https://openalex.org/C67186912","wikidata":"https://www.wikidata.org/wiki/Q367664","display_name":"Data modeling","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.258899986743927},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.25220000743865967},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.25119999051094055},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2508000135421753},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tkde.2025.3611663","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2025.3611663","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Knowledge and Data Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1983275606","https://openalex.org/W1993343369","https://openalex.org/W2022704179","https://openalex.org/W2124637492","https://openalex.org/W2162630660","https://openalex.org/W2426056643","https://openalex.org/W2743418339","https://openalex.org/W2788857209","https://openalex.org/W2890158617","https://openalex.org/W2896315416","https://openalex.org/W2904922632","https://openalex.org/W2963169753","https://openalex.org/W2963523627","https://openalex.org/W2982069085","https://openalex.org/W3012939175","https://openalex.org/W3088667775","https://openalex.org/W3093631941","https://openalex.org/W3095746859","https://openalex.org/W3127301637","https://openalex.org/W3186377753","https://openalex.org/W4226078332","https://openalex.org/W4290877352","https://openalex.org/W4296211626","https://openalex.org/W4312252283","https://openalex.org/W4382239590","https://openalex.org/W4382318032"],"related_works":[],"abstract_inverted_index":{"Recently,":[0],"many":[1],"machine":[2,164],"learning-based":[3],"approaches":[4,50,153,166,236],"that":[5,21,30,69,130,140,233],"effectively":[6],"solve":[7,141,155],"graph":[8,15,59,142,260],"optimization":[9,16,143],"problems":[10,144,231],"have":[11],"been":[12],"proposed.":[13],"The":[14],"problem":[17,20],"is":[18,31,97],"the":[19,38,79,87,90,138,160,163,168,172,211,222,239,255],"aims":[22],"to":[23,74,145,154],"optimize":[24],"(maximize":[25],"or":[26,61],"minimize)":[27],"a":[28,34,110,121,179,200],"quantity":[29],"associated":[32],"with":[33,58,114,188,217],"graph,":[35],"such":[36,70,258],"as":[37,259],"Minimum":[39],"Vertex":[40],"Cover":[41],"(MVC)":[42],"and":[43,119,136,167,244,252,262],"Maximum":[44],"Independent":[45],"Set":[46],"(MIS)":[47],"problems.":[48],"These":[49],"are":[51,82],"usually":[52],"trained":[53,92],"on":[54,93,206,229],"graphs":[55,72,81,96,135],"randomly":[56],"generated":[57,84],"generators":[60],"sampled":[62],"from":[63],"existing":[64],"datasets.":[65],"However,":[66],"we":[67,108,177],"observe":[68],"training":[71,134,173],"lead":[73],"poor":[75],"testing":[76,80],"performance":[77,148,161,240],"if":[78],"not":[83],"analogously,":[85],"i.e.,":[86],"generalizability":[88],"of":[89,162,171,182,224,241],"models":[91,139],"thoserandomly":[94],"generatedtraining":[95],"very":[98],"limited.":[99],"To":[100],"address":[101],"this":[102,106],"critical":[103],"issue,":[104],"in":[105],"paper,":[107],"propose":[109,151,199],"new":[111,122],"framework,":[112],"namedLearning":[113],"Iterative":[115],"Graph":[116,126,185],"Diversification":[117],"(LIGD),":[118],"formulate":[120],"research":[123],"problem,":[124],"namedDiverse":[125,184],"Modification":[127,186,205],"Problem":[128,187],"(DGMP),":[129],"iteratively":[131],"generate":[132],"diversified":[133],"train":[137],"improve":[146],"their":[147],"significantly.":[149,226],"We":[150,198,214],"three":[152],"DGMP":[156],"by":[157],"considering":[158],"both":[159,242],"learning":[165,246],"structural":[169],"properties":[170],"graphs.":[174],"In":[175],"addition,":[176],"study":[178],"practical":[180],"case":[181],"DGMP,":[183],"XOR":[189],"Diversity":[190],"(DGMP-XDiv),":[191],"which":[192],"considers":[193],"an":[194],"XOR-based":[195],"diversity":[196],"function.":[197],"polynomial-time":[201],"algorithm":[202],"namedStructure":[203],"Diversifying":[204],"Edge":[207],"Score":[208],"(DMES)to":[209],"obtain":[210],"optimal":[212],"solution.":[213],"also":[215],"proposeDMES":[216],"Efficiency-Boosting":[218],"Strategies":[219],"(DMES-EB)to":[220],"enhance":[221],"efficiency":[223],"DMES":[225],"Experimental":[227],"results":[228,251],"well-known":[230],"show":[232],"our":[234],"proposed":[235],"significantly":[237,253],"boost":[238],"supervised":[243],"reinforcement":[245],"approaches.":[247,264],"They":[248],"produce":[249],"near-optimal":[250],"outperform":[254],"baseline":[256],"approaches,":[257],"augmentation":[261],"diffusion-based":[263]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}