{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T19:49:47Z","timestamp":1762804187560,"version":"build-2065373602"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Science and Technology Council, Taiwan","award":["NSTC 113-2628-E-007-012-MY3","112-2221-E-007-088-MY3","113-2222-E-007-001-MY3"],"award-info":[{"award-number":["NSTC 113-2628-E-007-012-MY3","112-2221-E-007-088-MY3","113-2222-E-007-001-MY3"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1109\/tkde.2025.3611663","type":"journal-article","created":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T17:47:41Z","timestamp":1758217661000},"page":"7060-7075","source":"Crossref","is-referenced-by-count":0,"title":["Diversifying Graph Augmentation for Learning to Solve Graph Optimization Problems"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8080-3951","authenticated-orcid":false,"given":"Bay-Yuan","family":"Hsu","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, Taiwan"}]},{"given":"Chen-Hsu","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}]},{"given":"Chia-Hsun","family":"Lu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6422-0246","authenticated-orcid":false,"given":"Ming-Yi","family":"Chang","sequence":"additional","affiliation":[{"name":"Department of Sociology, Fu Jen Catholic University, New Taipei City, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9764-0455","authenticated-orcid":false,"given":"Lo-Yao","family":"Yeh","sequence":"additional","affiliation":[{"name":"Department of Information Management, National Central University, Taoyuan, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0377-7945","authenticated-orcid":false,"given":"Chih-Ya","family":"Shen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411867"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3207150"},{"key":"ref3","first-page":"108","article-title":"Task-optimized group search for social Internet of Things","volume-title":"Proc. Int. Conf. Extending Database Technol.","author":"Shen","year":"2017"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2020.3025911"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380269"},{"key":"ref6","first-page":"6348","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Khalil","year":"2017"},{"key":"ref7","first-page":"17","article-title":"On the evolution of random graphs","volume-title":"Publication of the Mathematical Institute of the Hungarian Academy of Sciences","author":"Erdos","year":"1960"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref9","first-page":"1","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Rong","year":"2019"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref11","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"You","year":"2020"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449796"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539437"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2017.70"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2018.2859580"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2818714"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11310"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2875911"},{"key":"ref19","first-page":"21453","article-title":"A Bi-level framework for learning to solve combinatorial optimization on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Wang","year":"2021"},{"key":"ref20","first-page":"31444","article-title":"Unsupervised learning for combinatorial optimization with principled objective relaxation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Wang","year":"2022"},{"key":"ref21","first-page":"3706","article-title":"Difusco: Graph-based diffusion solvers for combinatorial optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Sun","year":"2023"},{"key":"ref22","first-page":"8845","article-title":"Neural combinatorial optimization with heavy decoder: Toward large scale generalization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Luo","year":"2023"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012314"},{"key":"ref24","first-page":"9839","article-title":"Reinforcement learning for solving the vehicle routing problem","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Nazari","year":"2018"},{"key":"ref25","first-page":"539","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Li","year":"2018"},{"key":"ref26","first-page":"1","article-title":"Learning a SAT solver from single-bit supervision","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Selsam","year":"2019"},{"key":"ref27","first-page":"1","article-title":"Attention, learn to solve routing problems!","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kool","year":"2019"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3057361"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3152179"},{"key":"ref30","first-page":"2692","article-title":"Pointer Networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Vinyals","year":"2015"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25547"},{"key":"ref32","first-page":"8230","article-title":"G-mixup: Graph data augmentation for graph classification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Han","year":"2022"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i9.26336"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2949294"},{"key":"ref35","first-page":"14054","article-title":"Local augmentation for graph neural networks","volume-title":"Int. Conf. Mach. Learn.","author":"Liu","year":"2022"},{"key":"ref36","first-page":"12121","article-title":"Graph contrastive learning automated","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You","year":"2021"},{"key":"ref37","first-page":"22092","article-title":"Graph random neural network for semi-supervised learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Feng","year":"2020"},{"key":"ref38","first-page":"13354","article-title":"Diffusion improves graph learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Klicpera","year":"2019"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00016"},{"key":"ref40","first-page":"138","article-title":"Graph data augmentation for graph machine learning: A survey","author":"Zhao","year":"2023","journal-title":"Data Eng."},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11872"},{"key":"ref42","first-page":"4255","article-title":"Efficient graph generation with graph recurrent attention networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Liao","year":"2019"},{"key":"ref43","first-page":"5708","article-title":"GraphRNN: Generating realistic graphs with deep auto-regressive models","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"You","year":"2018"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100205"},{"year":"2025","key":"ref45","article-title":"Reproducibility materials"},{"key":"ref46","first-page":"1","article-title":"From distribution learning in training to gradient search in testing for combinatorial optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Li","year":"2024"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098069"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"ref50","first-page":"4292","article-title":"The network data repository with interactive graph analytics and visualization","volume-title":"Proc. AAAI Conf. Artif. Intell.","author":"Rossi","year":"2015"},{"article-title":"Spatial dataset repository","year":"2020","author":"Li","key":"ref51"},{"volume-title":"SATLIB: An Online Resource for Research on SAT","year":"2000","author":"Hoos","key":"ref52"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.026107"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11233837\/11172707.pdf?arnumber=11172707","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T19:47:20Z","timestamp":1762804040000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11172707\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":53,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3611663","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2025,12]]}}}