{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T23:58:43Z","timestamp":1780444723755,"version":"3.54.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1109\/tkde.2024.3441766","type":"journal-article","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T17:37:21Z","timestamp":1723484241000},"page":"8744-8757","source":"Crossref","is-referenced-by-count":25,"title":["Make Heterophilic Graphs Better Fit GNN: A Graph Rewiring Approach"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9939-3072","authenticated-orcid":false,"given":"Wendong","family":"Bi","sequence":"first","affiliation":[{"name":"University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7625-0650","authenticated-orcid":false,"given":"Lun","family":"Du","sequence":"additional","affiliation":[{"name":"Data Knowledge Intelligence Group, Microsoft Research Asia, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiang","family":"Fu","sequence":"additional","affiliation":[{"name":"Data Knowledge Intelligence Group, Microsoft, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7761-7269","authenticated-orcid":false,"given":"Yanlin","family":"Wang","sequence":"additional","affiliation":[{"name":"Data Knowledge Intelligence Group, Microsoft Research Asia, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0360-6089","authenticated-orcid":false,"given":"Shi","family":"Han","sequence":"additional","affiliation":[{"name":"Data Knowledge Intelligence Group, Microsoft, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9230-2799","authenticated-orcid":false,"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Data Knowledge Intelligence Group, Microsoft, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"key":"ref2","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref3","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20340"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512201"},{"key":"ref6","article-title":"Geom-GCN: Geometric graph convolutional networks","author":"Pei","year":"2020"},{"key":"ref7","first-page":"21","article-title":"MixHop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Abu-El-Haija"},{"key":"ref8","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhu"},{"key":"ref9","article-title":"Adaptive universal generalized PageRank graph neural network","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chien"},{"key":"ref10","article-title":"Rewiring with positional encodings for graph neural networks","author":"Br\u00fcel-Gabrielsson","year":"2022"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2018.8545172"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-53468-3_19"},{"key":"ref13","first-page":"65","article-title":"Improving social network-based sybil defenses by rewiring and augmenting social graphs","volume-title":"Proc. Int. Workshop Inf. Secur. Appl.","author":"Mohaisen"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0447-5"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2007-00084-8"},{"key":"ref16","article-title":"Learning sparse neural networks through $ l\\_{0}$l_0 regularization","author":"Louizos","year":"2017"},{"key":"ref17","article-title":"Discovering the representation bottleneck of graph neural networks from multi-order interactions","author":"Wu","year":"2022"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2820126"},{"key":"ref19","first-page":"920","article-title":"How to learn a graph from smooth signals","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Kalofolias"},{"key":"ref20","article-title":"CAGNN: Cluster-aware graph neural networks for unsupervised graph representation learning","author":"Zhu","year":"2020"},{"key":"ref21","article-title":"DiffWire: Inductive graph rewiring via the Lov\u00e1sz bound","author":"Arnaiz-Rodr\u00edguez","year":"2022"},{"key":"ref22","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539129"},{"key":"ref24","article-title":"HTGN-BTW: Heterogeneous temporal graph network with bi-time-window training strategy for temporal link prediction","author":"Yue","year":"2022"},{"key":"ref25","article-title":"MM-GNN: Mix-moment graph neural network towards modeling neighborhood feature distribution","author":"Bi","year":"2022"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11691"},{"key":"ref27","article-title":"A survey on graph structure learning: Progress and opportunities","author":"Zhu","year":"2022"},{"key":"ref28","article-title":"GCN-SL: Graph convolutional networks with structure learning for graphs under heterophily","author":"Jiang","year":"2021"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16600"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403049"},{"key":"ref31","first-page":"7154","article-title":"DAG-GNN: DAG structure learning with graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yu"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5470"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512186"},{"key":"ref34","article-title":"Understanding over-squashing and bottlenecks on graphs via curvature","author":"Topping","year":"2021"},{"key":"ref35","article-title":"Graph sparsification via meta-learning","volume-title":"Proc. Int. Workshop Deep Learn. Graphs Methods Appl.","author":"Wan"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICME46284.2020.9102726"},{"key":"ref37","first-page":"1972","article-title":"Learning discrete structures for graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Franceschi"},{"key":"ref38","first-page":"19 314","article-title":"Iterative deep graph learning for graph neural networks: Better and robust node embeddings","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref39","article-title":"On the bottleneck of graph neural networks and its practical implications","author":"Alon","year":"2020"},{"key":"ref40","first-page":"28877","article-title":"Do transformers really perform badly for graph representation?","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Ying"},{"key":"ref41","article-title":"Graph neural networks with learnable structural and positional representations","author":"Dwivedi","year":"2021"},{"key":"ref42","first-page":"13 260","article-title":"Principal neighbourhood aggregation for graph nets","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Corso"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512100"},{"key":"ref44","article-title":"Learning from labeled and unlabeled data with label propagation","author":"Zhu","year":"2002","journal-title":"ProQuest Number: Inf. All Users"},{"key":"ref45","volume-title":"Five Balltree Construction Algorithms","author":"Omohundro","year":"1989"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"ref47","article-title":"GraphSAINT: Graph sampling based inductive learning method","author":"Zeng","year":"2019"},{"key":"ref48","article-title":"Predict then propagate: Graph neural networks meet personalized PageRank","author":"Klicpera","year":"2018"},{"key":"ref49","article-title":"New benchmarks for learning on non-homophilous graphs","author":"Lim","year":"2021"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10750897\/10634240.pdf?arnumber=10634240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:23:57Z","timestamp":1732667037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10634240\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":49,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3441766","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]}}}