{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T05:00:10Z","timestamp":1780981210936,"version":"3.54.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Basic Scientific Research Business Expenses of Provincial Colleges and Universities in Hebei Province","award":["XY2023020"],"award-info":[{"award-number":["XY2023020"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3278271","type":"journal-article","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:56:07Z","timestamp":1684778167000},"page":"55204-55211","source":"Crossref","is-referenced-by-count":13,"title":["Random Walk Graph Auto-Encoders With Ensemble Networks in Graph Embedding"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4473-5116","authenticated-orcid":false,"given":"Chengxin","family":"Xie","sequence":"first","affiliation":[{"name":"College of Information Engineering, Hebei University of Architecture, Hebei, Zhangjiakou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9406-0992","authenticated-orcid":false,"given":"Xiumei","family":"Wen","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Hebei University of Architecture, Hebei, Zhangjiakou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8943-6802","authenticated-orcid":false,"given":"Fanxing","family":"Meng","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Hebei University of Architecture, Hebei, Zhangjiakou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hui","family":"Pang","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Hebei University of Architecture, Hebei, Zhangjiakou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9746010"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539321"},{"key":"ref15","article-title":"Variational graph auto-encoders","author":"kipf","year":"2016","journal-title":"arXiv 1611 07308"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2023.3260649"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2023.02.013"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8950"},{"key":"ref30","first-page":"81","article-title":"Relational topic models for document networks","author":"chang","year":"2009","journal-title":"Proc 12th Int Conf Artif Intell Statist"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3018033"},{"key":"ref33","first-page":"3009","article-title":"Graph autoencoder based on restart random walk","volume":"38","author":"lin","year":"2021","journal-title":"Journal of Applied Computing Research"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.12.061"},{"key":"ref32","first-page":"2111","article-title":"Network representation learning with rich text information","author":"yang","year":"2015","journal-title":"Proc IJCAI"},{"key":"ref2","article-title":"Adaptive graph auto-encoder for general data clustering","author":"li","year":"2020","journal-title":"arXiv 2002 08648"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2021.04.015"},{"key":"ref17","article-title":"Multi-task graph autoencoders","author":"tran","year":"2018","journal-title":"arXiv 1811 02798"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3158654"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3254888"},{"key":"ref19","first-page":"319","article-title":"Simple and effective graph autoencoders with one-hop linear models","author":"salha","year":"2020","journal-title":"Proc ECML PKDD"},{"key":"ref18","article-title":"Deepened graph auto-encoders help stabilize and enhance link prediction","author":"wu","year":"2021","journal-title":"arXiv 2103 11414"},{"key":"ref24","article-title":"Graph auto-encoders for financial clustering","author":"turner","year":"2021","journal-title":"arXiv 2111 13519"},{"key":"ref23","first-page":"22092","article-title":"Graph random neural networks for semi-supervised learning on graphs","author":"feng","year":"2020","journal-title":"Proc NeurIPS"},{"key":"ref26","article-title":"RWR-GAE: Random walk regularization for graph auto encoders","author":"vaibhav","year":"2019","journal-title":"arXiv 1908 04003"},{"key":"ref25","first-page":"2609","article-title":"Adversarially regularized graph autoencoder for graph embedding","author":"pan","year":"2019","journal-title":"Proc 27th Int Joint Conf Artif Intell"},{"key":"ref20","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2016","journal-title":"arXiv 1609 02907"},{"key":"ref22","article-title":"How to find your friendly neighborhood: Graph attention design with self-supervision","author":"kim","year":"2022","journal-title":"arXiv 2204 04879"},{"key":"ref21","article-title":"Graph attention networks","author":"veli?kovi?","year":"2018","journal-title":"arXiv 1710 10903"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8916"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3047116"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10179"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20682"},{"key":"ref7","article-title":"Graph auto-encoder via neighborhood Wasserstein reconstruction","author":"tang","year":"2022","journal-title":"arXiv 2202 09025"},{"key":"ref9","article-title":"Geom-GCN: Geometric graph convolutional networks","author":"pei","year":"2020","journal-title":"arXiv 2002 05287"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467300"},{"key":"ref3","first-page":"1149","article-title":"Geom-GCN: Geometric graph convolutional networks","author":"pei","year":"2020","journal-title":"Proc ICLR"},{"key":"ref6","article-title":"Graph attention auto-encoders","author":"salehi","year":"2019","journal-title":"arXiv 1905 10715"},{"key":"ref5","article-title":"Interstellar: Searching recurrent architecture for knowledge graph embedding","author":"zhang","year":"2019","journal-title":"arXiv 1911 07132"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/509"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10130144.pdf?arnumber=10130144","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T16:17:29Z","timestamp":1686327449000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10130144\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3278271","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}