{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T17:45:04Z","timestamp":1779385504651,"version":"3.53.1"},"reference-count":63,"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"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["60171009"],"award-info":[{"award-number":["60171009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key R&#x0026;D Program of China","award":["2022YFF0902500"],"award-info":[{"award-number":["2022YFF0902500"]}]},{"name":"Science And Technology Innovation Program of Hunan Province","award":["2023RC1023"],"award-info":[{"award-number":["2023RC1023"]}]}],"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.3418576","type":"journal-article","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T17:29:05Z","timestamp":1726766945000},"page":"9504-9516","source":"Crossref","is-referenced-by-count":2,"title":["Unsupervised Graph Representation Learning Beyond Aggregated View"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-9074-9229","authenticated-orcid":false,"given":"Jian","family":"Zhou","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1726-6342","authenticated-orcid":false,"given":"Jiasheng","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4975-034X","authenticated-orcid":false,"given":"Li","family":"Kuang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4983-5327","authenticated-orcid":false,"given":"Ning","family":"Gui","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1083-6101.2005.tb00266.x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2950416"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108218"},{"key":"ref4","article-title":"Representation learning on graphs: Methods and applications","author":"Hamilton","year":"2017"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01588-5"},{"key":"ref6","first-page":"1","article-title":"Large-scale representation learning on graphs via bootstrapping","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Thakoor"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/362"},{"key":"ref8","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"key":"ref9","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref10","first-page":"599","article-title":"Breaking the limits of message passing graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Balcilar"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512069"},{"key":"ref12","first-page":"1","article-title":"Graph neural networks with learnable structural and positional representations","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Dwivedi"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/564"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"ref15","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhu"},{"key":"ref16","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"ref18","first-page":"1","article-title":"Rethinking the expressive power of GNNs via graph biconnectivity","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Zhang"},{"key":"ref19","first-page":"19616","article-title":"Local vertex colouring graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref20","first-page":"26 868","article-title":"Beyond homophily: Reconstructing structure for graph-agnostic clustering","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Pan"},{"key":"ref21","first-page":"1","article-title":"Multi-view graph representation learning beyond homophily","volume":"17","author":"Lin","year":"2023","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3146270"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25573"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557478"},{"key":"ref25","first-page":"43","article-title":"2-hop neighbor class similarity (2NCS): A graph structural metric indicative of graph neural network performance","volume-title":"Proc. Conf. Assoc. Advance. Artif. Intell.","author":"Cavallo"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570404"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599546"},{"key":"ref28","first-page":"7134","article-title":"Position-aware graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3154319"},{"key":"ref30","first-page":"11823","article-title":"What functions can graph neural networks compute on random graphs? The role of positional encoding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Keriven"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3614894"},{"key":"ref32","first-page":"42 492","article-title":"Finding the missing-half: Graph complementary learning for homophily-prone and heterophily-prone graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zheng"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583454"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3172903"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539321"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403168"},{"key":"ref37","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hassani"},{"key":"ref38","article-title":"Deep graph infomax","author":"Veli\u010dkovi\u0107","year":"2018"},{"key":"ref39","article-title":"Graph infoclust: Leveraging cluster-level node information for unsupervised graph representation learning","author":"Mavromatis","year":"2020"},{"key":"ref40","first-page":"1","article-title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Sun"},{"key":"ref41","article-title":"Deep graph contrastive representation learning","author":"Zhu","year":"2020"},{"key":"ref42","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"You"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref44","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00662"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI50040.2020.00154"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132967"},{"issue":"8","key":"ref48","article-title":"Language models are unsupervised multitask learners","volume":"1","author":"Radford","year":"2019","journal-title":"OpenAI blog"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01553"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3335222"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583245"},{"key":"ref52","first-page":"20 887","article-title":"Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lim"},{"key":"ref53","first-page":"13 242","article-title":"Finding global homophily in graph neural networks when meeting heterophily","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482225"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00951"},{"key":"ref56","first-page":"1","article-title":"Is homophily a necessity for graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Ma"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref58","article-title":"Pitfalls of graph neural network evaluation","author":"Shchur","year":"2018"},{"key":"ref59","first-page":"1","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. 8th Int. Conf. Learn. Representations","author":"Pei"},{"key":"ref60","first-page":"40","article-title":"Revisiting semi-supervised learning with graph embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yang"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3264512"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.239"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10750897\/10684277.pdf?arnumber=10684277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T23:54:46Z","timestamp":1732665286000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10684277\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":63,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3418576","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]]}}}