{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:03:41Z","timestamp":1776783821234,"version":"3.51.2"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:00:00Z","timestamp":1758844800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:00:00Z","timestamp":1758844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"Chung-Ang University Graduate Research Scholarship","award":["2023"],"award-info":[{"award-number":["2023"]}]},{"name":"Chung-Ang University Graduate Research Scholarship","award":["2023"],"award-info":[{"award-number":["2023"]}]},{"name":"the MSIT(Ministry of Science and ICT), Korea, under the ITRC(Information Technology Research Center) support program","award":["IITP-2024-RS-2024-00438056"],"award-info":[{"award-number":["IITP-2024-RS-2024-00438056"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"DOI":"10.1186\/s40537-025-01270-y","type":"journal-article","created":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T09:09:10Z","timestamp":1758877750000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["WalkGCN: a biased sampling strategy for GNNs on non-attributed graphs"],"prefix":"10.1186","volume":"12","author":[{"given":"Mincheol","family":"Shin","sequence":"first","affiliation":[]},{"given":"Taeyoung","family":"Choe","sequence":"additional","affiliation":[]},{"given":"Yejong","family":"Ryu","sequence":"additional","affiliation":[]},{"given":"Yanggon","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Mucheol","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,26]]},"reference":[{"key":"1270_CR1","unstructured":"Li Y, Tarlow D, Brockschmidt M, Zemel R. Gated graph sequence neural networks. ArXiv Preprint arXiv:151105493. 2015."},{"key":"1270_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Yu PS. A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst. 2020;32:4\u201324.","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1270_CR3","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1109\/TPAMI.2020.3032189","volume":"44","author":"X Chen","year":"2020","unstructured":"Chen X, Chen S, Yao J, Zheng H, Zhang Y, Tsang IW. Learning on attribute-missing graphs. IEEE Trans Pattern Anal Mach Intell. 2020;44:740\u201357.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1270_CR4","doi-asserted-by":"crossref","unstructured":"Jiang X, Qin Z, Xu J, Ao X. Incomplete graph learning via attribute-structure decoupled variational auto-encoder. Proceedings of the 17th ACM international conference on web search and data mining. 2024. pp. 304\u201312.","DOI":"10.1145\/3616855.3635769"},{"key":"1270_CR5","doi-asserted-by":"crossref","unstructured":"Cui H, Lu Z, Li P, Yang C. On positional and structural node features for graph neural networks on non-attributed graphs. Proceedings of the 31st ACM International Conference on Information & Knowledge Management. 2022. pp. 3898\u2013902.","DOI":"10.1145\/3511808.3557661"},{"key":"1270_CR6","unstructured":"Zhang X, Li M, Wang Y, Fei H, Amgcl. Feature imputation of attribute missing graph via self-supervised contrastive learning. ArXiv Preprint arXiv:230503741. 2023."},{"key":"1270_CR7","unstructured":"Um D, Park J, Park S, Choi JY. Confidence-based feature imputation for graphs with partially known features. ArXiv Preprint arXiv:230516618. 2023."},{"key":"1270_CR8","doi-asserted-by":"crossref","unstructured":"Yoo J, Jeon H, Jung J, Kang U. Accurate node feature estimation with structured variational graph autoencoder. Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 2022. pp. 2336\u201346.","DOI":"10.1145\/3534678.3539337"},{"key":"1270_CR9","doi-asserted-by":"crossref","unstructured":"Fu S, Peng Q, He Y, Du B, You X. Towards unsupervised graph completion learning on graphs with features and structure missing. 2023 IEEE International Conference on Data Mining (ICDM). IEEE; 2023. pp. 1019\u201324.","DOI":"10.1109\/ICDM58522.2023.00117"},{"key":"1270_CR10","unstructured":"Rossi E, Kenlay H, Gorinova MI, Chamberlain BP, Dong X, Bronstein MM. On the unreasonable effectiveness of feature propagation in learning on graphs with missing node features. Learning on graphs conference. PMLR; 2022. p. 11."},{"key":"1270_CR11","first-page":"1191","volume":"42","author":"X Liu","year":"2019","unstructured":"Liu X, Zhu X, Li M, Wang L, Zhu E, Liu T, et al. Multiple kernel k k-means with incomplete kernels. IEEE Trans Pattern Anal Mach Intell. 2019;42:1191\u2013204.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1270_CR12","first-page":"48","volume":"87","author":"GE Batista","year":"2002","unstructured":"Batista GE, Monard MC. A study of K-nearest neighbour as an imputation method. His. 2002;87:48.","journal-title":"His"},{"key":"1270_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00521-009-0295-6","volume":"19","author":"PJ Garc\u00eda-Laencina","year":"2010","unstructured":"Garc\u00eda-Laencina PJ, Sancho-G\u00f3mez J-L, Figueiras-Vidal AR. Pattern classification with missing data: a review. Neural Comput Appl. 2010;19:263\u201382.","journal-title":"Neural Comput Appl"},{"key":"1270_CR14","doi-asserted-by":"publisher","first-page":"120681","DOI":"10.1016\/j.ins.2024.120681","volume":"674","author":"J Chen","year":"2024","unstructured":"Chen J, Wang Y, Zeng M, Xiang Z, Hou B, Tong Y, et al. Customizing graph neural networks using path reweighting. Inf Sci (N Y). 2024;674:120681.","journal-title":"Inf Sci (N Y)"},{"key":"1270_CR15","doi-asserted-by":"crossref","unstructured":"Bandyopadhyay S, Vivek NL, Murty SV. MN. Outlier resistant unsupervised deep architectures for attributed network embedding. Proceedings of the 13th international conference on web search and data mining. 2020. pp. 25\u201333.","DOI":"10.1145\/3336191.3371788"},{"key":"1270_CR16","unstructured":"Kipf TN, Welling M. Semi-supervised classification with graph convolutional networks. ArXiv Preprint arXiv:160902907. 2016."},{"key":"1270_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.future.2020.11.016","volume":"117","author":"H Taguchi","year":"2021","unstructured":"Taguchi H, Liu X, Murata T. Graph convolutional networks for graphs containing missing features. Future Generation Comput Syst. 2021;117:155\u201368.","journal-title":"Future Generation Comput Syst"},{"key":"1270_CR18","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y. Graph attention networks. ArXiv Preprint arXiv:171010903. 2017."},{"key":"1270_CR19","doi-asserted-by":"crossref","unstructured":"Tu W, Zhou S, Liu X, Cai Z, Zhao Y, Liu Y et al. WAGE: Weight-Sharing Attribute-Missing graph autoencoder. IEEE Trans Pattern Anal Mach Intell. 2025.","DOI":"10.1109\/TPAMI.2025.3554053"},{"key":"1270_CR20","doi-asserted-by":"crossref","unstructured":"Jin D, Huo C, Liang C, Yang L. Heterogeneous graph neural network via attribute completion. Proceedings of the web conference. 2021. 2021. pp. 391\u2013400.","DOI":"10.1145\/3442381.3449914"},{"key":"1270_CR21","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.ins.2023.03.034","volume":"632","author":"C Li","year":"2023","unstructured":"Li C, Yan Y, Fu J, Zhao Z, Zeng Q. HetReGAT-FC: heterogeneous residual graph attention network via feature completion. Inf Sci (N Y). 2023;632:424\u201338.","journal-title":"Inf Sci (N Y)"},{"key":"1270_CR22","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S, Deepwalk. Online learning of social representations. Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. 2014. pp. 701\u201310.","DOI":"10.1145\/2623330.2623732"},{"key":"1270_CR23","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J. node2vec: Scalable feature learning for networks. Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining. 2016. pp. 855\u201364.","DOI":"10.1145\/2939672.2939754"},{"key":"1270_CR24","doi-asserted-by":"crossref","unstructured":"Cao S, Lu W, Xu Q, Grarep. Learning graph representations with global structural information. Proceedings of the 24th ACM international on conference on information and knowledge management. 2015. pp. 891\u2013900.","DOI":"10.1145\/2806416.2806512"},{"key":"1270_CR25","doi-asserted-by":"crossref","unstructured":"Ou M, Cui P, Pei J, Zhang Z, Zhu W. Asymmetric transitivity preserving graph embedding. Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. 2016. pp. 1105\u201314.","DOI":"10.1145\/2939672.2939751"},{"key":"1270_CR26","doi-asserted-by":"crossref","unstructured":"Chen H, Perozzi B, Hu Y, Skiena S. Harp: hierarchical representation learning for networks. Proceedings of the AAAI conference on artificial intelligence. 2018.","DOI":"10.1609\/aaai.v32i1.11849"},{"key":"1270_CR27","doi-asserted-by":"crossref","unstructured":"Tsitsulin A, Mottin D, Karras P, M\u00fcller E, Verse. Versatile graph embeddings from similarity measures. Proceedings of the 2018 world wide web conference. 2018. pp. 539\u201348.","DOI":"10.1145\/3178876.3186120"},{"key":"1270_CR28","doi-asserted-by":"crossref","unstructured":"Rahman MK, Sujon MH, Azad A. Force2Vec: Parallel force-directed graph embedding. 2020 IEEE International Conference on Data Mining (ICDM). IEEE; 2020. pp. 442\u201351.","DOI":"10.1109\/ICDM50108.2020.00053"},{"key":"1270_CR29","doi-asserted-by":"publisher","first-page":"129205","DOI":"10.1016\/j.physa.2023.129205","volume":"630","author":"X Wu","year":"2023","unstructured":"Wu X, Zhang H, Quan Y, Miao Q, Sun PG. Graph embedding based on motif-aware feature propagation for community detection. Physica A. 2023;630:129205.","journal-title":"Physica A"},{"key":"1270_CR30","doi-asserted-by":"crossref","unstructured":"Huo C, Jin D, Li Y, He D, Yang Y-B, Wu L. T2-gnn: Graph neural networks for graphs with incomplete features and structure via teacher-student distillation. Proceedings of the AAAI Conference on Artificial Intelligence. 2023. pp. 4339\u201346.","DOI":"10.1609\/aaai.v37i4.25553"},{"key":"1270_CR31","doi-asserted-by":"crossref","unstructured":"Liu Z, Nguyen T-K, Fang Y. Tail-gnn: Tail-node graph neural networks. Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 2021. pp. 1109\u201319.","DOI":"10.1145\/3447548.3467276"},{"key":"1270_CR32","doi-asserted-by":"publisher","first-page":"1868","DOI":"10.55730\/1300-0632.3910","volume":"30","author":"SN Mohammed","year":"2022","unstructured":"Mohammed SN, G\u00fcnd\u00fc\u00e7 S. Degree-based random walk approach for graph embedding. Turkish J Electr Eng Comput Sci. 2022;30:1868\u201381.","journal-title":"Turkish J Electr Eng Comput Sci"},{"key":"1270_CR33","unstructured":"Zhang Z, Sabuncu M. Generalized cross entropy loss for training deep neural networks with noisy labels. Adv Neural Inf Process Syst. 2018;31."},{"key":"1270_CR34","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1009953814988","volume":"3","author":"AK McCallum","year":"2000","unstructured":"McCallum AK, Nigam K, Rennie J, Seymore K. Automating the construction of internet portals with machine learning. Inf Retr Boston. 2000;3:127\u201363.","journal-title":"Inf Retr Boston"},{"key":"1270_CR35","doi-asserted-by":"crossref","unstructured":"Giles CL, Bollacker KD, Lawrence S, CiteSeer. An automatic citation indexing system. Proceedings of the third ACM conference on Digital libraries. 1998. pp. 89\u201398.","DOI":"10.1145\/276675.276685"},{"key":"1270_CR36","doi-asserted-by":"crossref","unstructured":"Namata G, London B, Getoor L, Huang B, Edu U. Query-driven active surveying for collective classification. 10th international workshop on mining and learning with graphs. 2012. p. 1.","DOI":"10.1007\/978-1-4899-7502-7_44-1"},{"key":"1270_CR37","doi-asserted-by":"crossref","unstructured":"Donnat C, Zitnik M, Hallac D, Leskovec J. Learning structural node embeddings via diffusion wavelets. Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. 2018. pp. 1320\u20139.","DOI":"10.1145\/3219819.3220025"},{"key":"1270_CR38","unstructured":"Errica F, Podda M, Bacciu D, Micheli A. A fair comparison of graph neural networks for graph classification. ArXiv Preprint arXiv:191209893. 2019."},{"key":"1270_CR39","unstructured":"Huang Q, He H, Singh A, Lim S-N, Benson AR. Combining label propagation and simple models out-performs graph neural networks. ArXiv Preprint arXiv:201013993. 2020."},{"key":"1270_CR40","unstructured":"Kojaku S, Yoon J, Constantino I, Ahn Y-Y. Residual2Vec: Debiasing graph embedding with random graphs. Adv Neural Inf Processing Syst. 2021;34:24150\u201363."}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-025-01270-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-025-01270-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-025-01270-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T09:09:23Z","timestamp":1758877763000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-025-01270-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,26]]},"references-count":40,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["1270"],"URL":"https:\/\/doi.org\/10.1186\/s40537-025-01270-y","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,26]]},"assertion":[{"value":"28 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"219"}}