{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T01:47:25Z","timestamp":1777945645073,"version":"3.51.4"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.patrec.2026.04.004","type":"journal-article","created":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T15:11:14Z","timestamp":1775315474000},"page":"86-92","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Towards more practical vertically federated graph neural networks"],"prefix":"10.1016","volume":"204","author":[{"given":"Chenglu","family":"Pan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingbiao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.patrec.2026.04.004_bib0001","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","article-title":"A comprehensive survey on graph neural networks","volume":"32","author":"Wu","year":"2020","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.patrec.2026.04.004_bib0002","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"14499","article-title":"Towards fair graph federated learning via incentive mechanisms","volume":"38","author":"Pan","year":"2024"},{"key":"10.1016\/j.patrec.2026.04.004_bib0003","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.patrec.2024.11.004","article-title":"Graph neural networks with maximal independent set-based pooling: mitigating over-smoothing and over-squashing","volume":"187","author":"Stanovic","year":"2024","journal-title":"Pattern Recognit. Lett."},{"key":"10.1016\/j.patrec.2026.04.004_bib0004","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.patrec.2024.12.002","article-title":"Generalized relative neighborhood graph (GRNG) for similarity search","volume":"188","author":"Foster","year":"2025","journal-title":"Pattern Recognit. Lett."},{"key":"10.1016\/j.patrec.2026.04.004_bib0005","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.106775","article-title":"A survey on federated learning","volume":"216","author":"Zhang","year":"2021","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.patrec.2026.04.004_bib0006","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/3575637.3575644","article-title":"Federated graph machine learning","volume":"24","author":"Fu","year":"2022","journal-title":"ACM SIGKDD Explorations Newsletter"},{"issue":"7","key":"10.1016\/j.patrec.2026.04.004_bib0007","doi-asserted-by":"crossref","first-page":"3615","DOI":"10.1109\/TKDE.2024.3352628","article-title":"Vertical federated learning: concepts, advances, and challenges","volume":"36","author":"Liu","year":"2024","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.patrec.2026.04.004_bib0008","series-title":"31St International Joint Conference on Artificial Intelligence","first-page":"1959","article-title":"Vertically federated graph neural network for privacy-preserving node classification","author":"Chen","year":"2022"},{"key":"10.1016\/j.patrec.2026.04.004_bib0009","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119976","article-title":"FedGL: federated graph learning framework with global self-supervision","volume":"657","author":"Chen","year":"2024","journal-title":"Inf. Sci. (Ny)"},{"key":"10.1016\/j.patrec.2026.04.004_bib0010","series-title":"International Conference on Machine Learning","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","author":"Hassani","year":"2020"},{"key":"10.1016\/j.patrec.2026.04.004_bib0011","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017","journal-title":"ICLR"},{"key":"10.1016\/j.patrec.2026.04.004_bib0012","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"20","key":"10.1016\/j.patrec.2026.04.004_bib0013","first-page":"10","article-title":"Graph attention networks","volume":"1050","author":"Velickovic","year":"2017","journal-title":"Stat"},{"key":"10.1016\/j.patrec.2026.04.004_bib0014","series-title":"International Conference on Learning Representations","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2019"},{"key":"10.1016\/j.patrec.2026.04.004_bib0015","series-title":"Artificial Intelligence and Statistics","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"McMahan","year":"2017"},{"key":"10.1016\/j.patrec.2026.04.004_bib0016","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"8432","article-title":"Fedproto: federated prototype learning across heterogeneous clients","volume":"36","author":"Tan","year":"2022"},{"key":"10.1016\/j.patrec.2026.04.004_bib0017","article-title":"Image-Based recommendations on styles and substitutes","author":"McAuley","year":"2015","journal-title":"Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval"},{"key":"10.1016\/j.patrec.2026.04.004_bib0018","article-title":"Personalized federated learning with graph","author":"Chen","year":"2022","journal-title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence"},{"key":"10.1016\/j.patrec.2026.04.004_bib0019","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"9953","article-title":"Federated learning on non-iid graphs via structural knowledge sharing","volume":"37","author":"Tan","year":"2023"},{"key":"10.1016\/j.patrec.2026.04.004_bib0020","series-title":"International Conference on Machine Learning","first-page":"11372","article-title":"Crfl: certifiably robust federated learning against backdoor attacks","author":"Xie","year":"2021"},{"key":"10.1016\/j.patrec.2026.04.004_bib0021","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"6865","article-title":"Spreadgnn: serverless multi-task federated learning for graph neural networks","volume":"36","author":"He","year":"2023"},{"key":"10.1016\/j.patrec.2026.04.004_bib0022","series-title":"International Conference on Learning Representations (ICLR)","article-title":"Strategies for pre-training graph neural networks","author":"Hu","year":"2020"},{"key":"10.1016\/j.patrec.2026.04.004_bib0023","series-title":"Proceedings of the 26Th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","first-page":"1857","article-title":"Gpt-gnn: generative pre-training of graph neural networks","author":"Hu","year":"2020"},{"key":"10.1016\/j.patrec.2026.04.004_bib0024","series-title":"Proceedings of the 26Th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","first-page":"1150","article-title":"Gcc: graph contrastive coding for graph neural network pre-training","author":"Qiu","year":"2020"},{"key":"10.1016\/j.patrec.2026.04.004_bib0025","series-title":"International Conference on Machine Learning","first-page":"1597","article-title":"A simple framework for contrastive learning of visual representations","author":"Chen","year":"2020"},{"key":"10.1016\/j.patrec.2026.04.004_bib0026","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"33","author":"You","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patrec.2026.04.004_bib0027","series-title":"International Conference on Machine Learning","first-page":"24332","article-title":"ProGCL: rethinking hard negative mining in graph contrastive learning","author":"Xia","year":"2022"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016786552600125X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016786552600125X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T12:41:08Z","timestamp":1777725668000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016786552600125X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":27,"alternative-id":["S016786552600125X"],"URL":"https:\/\/doi.org\/10.1016\/j.patrec.2026.04.004","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Towards more practical vertically federated graph neural networks","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patrec.2026.04.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}