{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T12:01:28Z","timestamp":1785499288678,"version":"3.56.0"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T00:00:00Z","timestamp":1776988800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T00:00:00Z","timestamp":1776988800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62277013"],"award-info":[{"award-number":["62277013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62177040"],"award-info":[{"award-number":["62177040"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LTGG24F020006"],"award-info":[{"award-number":["LTGG24F020006"]}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["U22A2033"],"award-info":[{"award-number":["U22A2033"]}]},{"name":"Zhejiang Lingyan Project"},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LZ22F020015"],"award-info":[{"award-number":["LZ22F020015"]}]},{"name":"National Social Science Fund Major Project","award":["24&ZD075"],"award-info":[{"award-number":["24&ZD075"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Vis"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s12650-026-01123-7","type":"journal-article","created":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T08:36:16Z","timestamp":1777019776000},"page":"809-826","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Visual evaluation for attribute differences in graph sampling"],"prefix":"10.1007","volume":"29","author":[{"given":"Yong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuqi","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiajia","family":"Kou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuhua","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangyang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4783-6863","authenticated-orcid":false,"given":"Zhiguang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,24]]},"reference":[{"issue":"2","key":"1123_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2601438","volume":"8","author":"NK Ahmed","year":"2013","unstructured":"Ahmed NK, Neville J, Kompella R (2013) Network sampling: from static to streaming graphs. ACM Trans Knowl Discov Data 8(2):1\u201356. https:\/\/doi.org\/10.1145\/2601438","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"1","key":"1123_CR2","doi-asserted-by":"publisher","first-page":"2312","DOI":"10.1038\/s41467-018-04632-8","volume":"9","author":"H Ahmed","year":"2018","unstructured":"Ahmed H, Howton T, Sun Y, Weinberger N, Belkhadir Y, Mukhtar MS (2018) Network biology discovers pathogen contact points in host protein\u2013protein interactomes. Nat Commun 9(1):2312. https:\/\/doi.org\/10.1038\/s41467-018-04632-8","journal-title":"Nat Commun"},{"issue":"1","key":"1123_CR3","doi-asserted-by":"publisher","first-page":"7073","DOI":"10.1038\/s41467-024-51388-5","volume":"15","author":"A Badalyan","year":"2024","unstructured":"Badalyan A, Ruggeri N, De Bacco C (2024) Structure and inference in hypergraphs with node attributes. Nat Commun 15(1):7073. https:\/\/doi.org\/10.1038\/s41467-024-51388-5","journal-title":"Nat Commun"},{"key":"1123_CR4","doi-asserted-by":"publisher","unstructured":"Barab\u00e1si A-L (2002) The new science of networks. Cambridge. https:\/\/doi.org\/10.1119\/1.1538577","DOI":"10.1119\/1.1538577"},{"key":"1123_CR5","doi-asserted-by":"publisher","unstructured":"Bloznelis M (2013) Degree and clustering coefficient in sparse random intersection graphs. https:\/\/doi.org\/10.1214\/12-AAP874","DOI":"10.1214\/12-AAP874"},{"issue":"4","key":"1123_CR6","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.socnet.2007.04.002","volume":"29","author":"P Bonacich","year":"2007","unstructured":"Bonacich P (2007) Some unique properties of eigenvector centrality. Social Netw 29(4):555\u2013564. https:\/\/doi.org\/10.1016\/j.socnet.2007.04.002","journal-title":"Social Netw"},{"key":"1123_CR7","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.spl.2016.10.014","volume":"121","author":"H Cai","year":"2017","unstructured":"Cai H (2017) A note on jointly modeling edges and node attributes of a network. Stat Probab Lett 121:54\u201360. https:\/\/doi.org\/10.1016\/j.spl.2016.10.014","journal-title":"Stat Probab Lett"},{"issue":"9","key":"1123_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11704-024-40474-y","volume":"19","author":"D Cheng","year":"2025","unstructured":"Cheng D, Zou Y, Xiang S, Jiang C (2025) Graph neural networks for financial fraud detection: a review. Front Comp Sci 19(9):1\u201315. https:\/\/doi.org\/10.1007\/s11704-024-40474-y","journal-title":"Front Comp Sci"},{"key":"1123_CR9","doi-asserted-by":"publisher","unstructured":"Chiericetti F, Dasgupta A, Kumar R, Lattanzi S, Sarl\u00f3s T (2016) On sampling nodes in a network. In: Proceedings of the 25th international conference on world wide web, pp 471\u2013481. https:\/\/doi.org\/10.1145\/2872427.2883045","DOI":"10.1145\/2872427.2883045"},{"key":"1123_CR10","doi-asserted-by":"publisher","unstructured":"Citraro S, Pansanella V, Rossetti G (2024) Structure-attribute similarity interplay in diffusion dynamics on social networks. In: International conference on discovery science. Springer, pp 425\u2013439. https:\/\/doi.org\/10.1007\/978-3-031-78980-9_27","DOI":"10.1007\/978-3-031-78980-9_27"},{"key":"1123_CR11","doi-asserted-by":"publisher","unstructured":"Doerr C, Blenn N (2013) Metric convergence in social network sampling. In: Proceedings of the 5th ACM workshop on hotplanet, pp 45\u201350. https:\/\/doi.org\/10.1145\/2491159.2491168","DOI":"10.1145\/2491159.2491168"},{"issue":"4","key":"1123_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1734213.1734219","volume":"57","author":"S Dolev","year":"2010","unstructured":"Dolev S, Elovici Y, Puzis R (2010) Routing betweenness centrality. J ACM 57(4):1\u201327. https:\/\/doi.org\/10.1145\/1734213.1734219","journal-title":"J ACM"},{"issue":"5","key":"1123_CR13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.056103","volume":"71","author":"E Estrada","year":"2005","unstructured":"Estrada E, Rodriguez-Velazquez JA (2005) Subgraph centrality in complex networks. Phys Rev E-Stat Nonlinear Soft Matter Phys 71(5):056103. https:\/\/doi.org\/10.1103\/PhysRevE.71.056103","journal-title":"Phys Rev E-Stat Nonlinear Soft Matter Phys"},{"key":"1123_CR14","doi-asserted-by":"publisher","unstructured":"Fan W, Ma Y, Li Q, He Y, Zhao E, Tang J, Yin D (2019) Graph neural networks for social recommendation. In: The world wide web conference, pp 417\u2013426. https:\/\/doi.org\/10.1145\/3308558.3313488","DOI":"10.1145\/3308558.3313488"},{"issue":"3","key":"1123_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Social Netw 1(3):215\u2013239. https:\/\/doi.org\/10.1016\/0378-8733(78)90021-7","journal-title":"Social Netw"},{"issue":"1","key":"1123_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.disc.2017.08.020","volume":"341","author":"M Gentner","year":"2018","unstructured":"Gentner M, Heinrich I, J\u00e4ger S, Rautenbach D (2018) Large values of the clustering coefficient. Discrete Math 341(1):119\u2013125. https:\/\/doi.org\/10.1016\/j.disc.2017.08.020","journal-title":"Discrete Math"},{"key":"1123_CR17","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.engappai.2017.01.004","volume":"59","author":"M Ghavipour","year":"2017","unstructured":"Ghavipour M, Meybodi MR (2017) Irregular cellular learning automata-based algorithm for sampling social networks. Eng Appl Artif Intell 59:244\u2013259. https:\/\/doi.org\/10.1016\/j.engappai.2017.01.004","journal-title":"Eng Appl Artif Intell"},{"key":"1123_CR18","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705148","author":"LA Goodman","year":"1961","unstructured":"Goodman LA (1961) Snowball sampling. Ann Math Stat. https:\/\/doi.org\/10.1214\/aoms\/1177705148","journal-title":"Ann Math Stat"},{"key":"1123_CR19","doi-asserted-by":"publisher","unstructured":"Hardiman SJ, Katzir L (2013) Estimating clustering coefficients and size of social networks via random walk. In: Proceedings of the 22nd international conference on world wide web, pp 539\u2013550. https:\/\/doi.org\/10.1145\/2488388.2488436","DOI":"10.1145\/2488388.2488436"},{"key":"1123_CR20","doi-asserted-by":"publisher","unstructured":"Hu P, Lau WC (2013) A survey and taxonomy of graph sampling. https:\/\/doi.org\/10.48550\/arXiv.1308.5865","DOI":"10.48550\/arXiv.1308.5865"},{"issue":"1","key":"1123_CR21","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TCSS.2022.3216587","volume":"11","author":"M Jaouadi","year":"2022","unstructured":"Jaouadi M, Romdhane LB (2022) A graph sampling-based model for influence maximization in large-scale social networks. IEEE Trans Comput Soc Syst 11(1):144\u2013160. https:\/\/doi.org\/10.1109\/TCSS.2022.3216587","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"1123_CR22","doi-asserted-by":"publisher","unstructured":"Krishnamurthy V, Faloutsos M, Chrobak M, Lao L, Cui J-H, Percus AG (2005) Reducing large internet topologies for faster simulations. In: International conference on research in networking. Springer, pp 328\u2013341. https:\/\/doi.org\/10.1007\/11422778_27","DOI":"10.1007\/11422778_27"},{"key":"1123_CR23","doi-asserted-by":"publisher","unstructured":"Kumar S, Sundaram H (2016) Task-driven sampling of attributed networks. https:\/\/doi.org\/10.48550\/arXiv.1611.00910","DOI":"10.48550\/arXiv.1611.00910"},{"issue":"9","key":"1123_CR24","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1109\/JSAC.2011.111005","volume":"29","author":"M Kurant","year":"2011","unstructured":"Kurant M, Markopoulou A, Thiran P (2011) Towards unbiased bfs sampling. IEEE J Sel Areas Commun 29(9):1799\u20131809. https:\/\/doi.org\/10.1109\/JSAC.2011.111005","journal-title":"IEEE J Sel Areas Commun"},{"key":"1123_CR25","doi-asserted-by":"publisher","unstructured":"Kurant M, Markopoulou A, Thiran P (2010) On the bias of bfs (breadth first search). In: 2010 22nd International teletraffic congress (LTC 22). IEEE, pp 1\u20138. https:\/\/doi.org\/10.1109\/ITC.2010.5608727","DOI":"10.1109\/ITC.2010.5608727"},{"issue":"1","key":"1123_CR26","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/2318857.2254795","volume":"40","author":"C-H Lee","year":"2012","unstructured":"Lee C-H, Xu X, Eun DY (2012) Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling. ACM SIGMETRICS Perform Eval Rev 40(1):319\u2013330. https:\/\/doi.org\/10.1145\/2318857.2254795","journal-title":"ACM SIGMETRICS Perform Eval Rev"},{"key":"1123_CR27","doi-asserted-by":"publisher","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, pp 631\u2013636. https:\/\/doi.org\/10.1145\/1150402.1150479","DOI":"10.1145\/1150402.1150479"},{"key":"1123_CR28","doi-asserted-by":"publisher","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining, pp 177\u2013187. https:\/\/doi.org\/10.1145\/1081870.1081893","DOI":"10.1145\/1081870.1081893"},{"key":"1123_CR29","doi-asserted-by":"publisher","unstructured":"Li R-H, Yu JX, Qin L, Mao R, Jin T (2015) On random walk based graph sampling. In: 2015 IEEE 31st international conference on data engineering. IEEE, pp 927\u2013938. https:\/\/doi.org\/10.1109\/ICDE.2015.7113345","DOI":"10.1109\/ICDE.2015.7113345"},{"issue":"1","key":"1123_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-022-2078-5","volume":"18","author":"Q Li","year":"2024","unstructured":"Li Q, Wang X, Fu L, Cao X, Wang X, Zhang J, Zhou C (2024) Vsan: a new visualization method for super-large-scale academic networks. Front Comp Sci 18(1):181701","journal-title":"Front Comp Sci"},{"key":"1123_CR31","doi-asserted-by":"publisher","unstructured":"Lin M, Li W, Lu S (2020) Balanced influence maximization in attributed social network based on sampling. In: Proceedings of the 13th international conference on web search and data mining, pp 375\u2013383. https:\/\/doi.org\/10.1145\/3336191.3371833","DOI":"10.1145\/3336191.3371833"},{"key":"1123_CR32","doi-asserted-by":"crossref","unstructured":"Liu Y, Ma Y, Shi Q, Wen J, Zheng W, Yue X, Ye H, Chen W, Meng Y, Zhou Z (2024) Ebpvis: visual analytics of economic behavior patterns in a virtual experimental environment. In: Computer graphics forum, vol 43. Wiley Online Library, p 15200","DOI":"10.1111\/cgf.15200"},{"key":"1123_CR33","doi-asserted-by":"crossref","unstructured":"Liu Y, Wang H, Kou J, Sun L, Wang H, Wang Y, Wang Y, Zhou Z et al (2025) A unified framework for interactive visual graph matching via attribute-structure synchronization. arXiv preprint arXiv:2507.19750","DOI":"10.1016\/j.cag.2025.104406"},{"key":"1123_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126430","volume":"549","author":"Y Luo","year":"2023","unstructured":"Luo Y, Huang Y, Luo G, Qin K, Chen A (2023) Edge convolutional networks: decomposing graph convolutional networks for stochastic training with independent edges. Neurocomputing 549:126430. https:\/\/doi.org\/10.1016\/j.neucom.2023.126430","journal-title":"Neurocomputing"},{"key":"1123_CR35","doi-asserted-by":"publisher","unstructured":"Maiya AS, Berger-Wolf TY (2011) Benefits of bias: towards better characterization of network sampling. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, pp 105\u2013113. https:\/\/doi.org\/10.1145\/2020408.2020431","DOI":"10.1145\/2020408.2020431"},{"key":"1123_CR36","doi-asserted-by":"publisher","unstructured":"Martinez-Seis B, Li X, Wang X (2019) Measure community quality by attribute importance and density in social networks. In: 2019 IEEE 15th international conference on automation science and engineering (CASE), pp 628\u2013633. https:\/\/doi.org\/10.1109\/COASE.2019.8842970 . IEEE","DOI":"10.1109\/COASE.2019.8842970"},{"issue":"6","key":"1123_CR37","doi-asserted-by":"publisher","first-page":"471","DOI":"10.3390\/e20060471","volume":"20","author":"F Meng","year":"2018","unstructured":"Meng F, Rui X, Wang Z, Xing Y, Cao L (2018) Coupled node similarity learning for community detection in attributed networks. Entropy 20(6):471. https:\/\/doi.org\/10.3390\/e20060471","journal-title":"Entropy"},{"issue":"6","key":"1123_CR38","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1109\/TVCG.2017.2674999","volume":"23","author":"QH Nguyen","year":"2017","unstructured":"Nguyen QH, Hong S-H, Eades P, Meidiana A (2017) Proxy graph: visual quality metrics of big graph sampling. IEEE Trans Visual Comput Graph 23(6):1600\u20131611. https:\/\/doi.org\/10.1109\/TVCG.2017.2674999","journal-title":"IEEE Trans Visual Comput Graph"},{"key":"1123_CR39","doi-asserted-by":"publisher","unstructured":"Rafiei D (2005) Effectively visualizing large networks through sampling. In: VIS 05. IEEE visualization. IEEE, pp 375\u2013382. https:\/\/doi.org\/10.1109\/VISUAL.2005.1532819","DOI":"10.1109\/VISUAL.2005.1532819"},{"key":"1123_CR40","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.comcom.2015.07.023","volume":"73","author":"M Seufert","year":"2016","unstructured":"Seufert M, Lange S, Ho\u00dffeld T (2016) More than topology: joint topology and attribute sampling and generation of social network graphs. Comput Commun 73:176\u2013187. https:\/\/doi.org\/10.1016\/j.comcom.2015.07.023","journal-title":"Comput Commun"},{"issue":"1","key":"1123_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12915-025-02206-x","volume":"23","author":"Y Shang","year":"2025","unstructured":"Shang Y, Wang Z, Chen Y, Yang X, Ren Z, Zeng X, Xu L (2025) Hnf-dda: subgraph contrastive-driven transformer-style heterogeneous network embedding for drug-disease association prediction. BMC Biol 23(1):1\u201316. https:\/\/doi.org\/10.1186\/s12915-025-02206-x","journal-title":"BMC Biol"},{"key":"1123_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.121096","volume":"679","author":"Z Su","year":"2024","unstructured":"Su Z, Liu Y, Kurths J, Meyerhenke H (2024) Generic network sparsification via degree-and subgraph-based edge sampling. Inf Sci 679:121096. https:\/\/doi.org\/10.1016\/j.ins.2024.121096","journal-title":"Inf Sci"},{"issue":"3","key":"1123_CR43","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1109\/TKDE.2023.3298002","volume":"36","author":"Q Tan","year":"2023","unstructured":"Tan Q, Zhang X, Huang X, Chen H, Li J, Hu X (2023) Collaborative graph neural networks for attributed network embedding. IEEE Trans Knowl Data Eng 36(3):972\u2013986. https:\/\/doi.org\/10.1109\/TKDE.2023.3298002","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1123_CR44","doi-asserted-by":"publisher","unstructured":"Wagner C, Singer P, Karimi F, Pfeffer J, Strohmaier M (2017) Sampling from social networks with attributes. In: Proceedings of the 26th international conference on world wide web, pp 1181\u20131190. https:\/\/doi.org\/10.1145\/3038912.3052665","DOI":"10.1145\/3038912.3052665"},{"key":"1123_CR45","doi-asserted-by":"publisher","unstructured":"Wang T, Chen Y, Zhang Z, Xu T, Jin L, Hui P, Deng B, Li X (2011) Understanding graph sampling algorithms for social network analysis. In: 2011 31st International conference on distributed computing systems workshops. IEEE, pp 123\u2013128. https:\/\/doi.org\/10.1109\/ICDCSW.2011.34","DOI":"10.1109\/ICDCSW.2011.34"},{"issue":"1","key":"1123_CR46","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1111\/0081-1750.00098","volume":"31","author":"DR White","year":"2001","unstructured":"White DR, Harary F (2001) The cohesiveness of blocks in social networks: node connectivity and conditional density. Sociol Methodol 31(1):305\u2013359. https:\/\/doi.org\/10.1111\/0081-1750.00098","journal-title":"Sociol Methodol"},{"issue":"1","key":"1123_CR47","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TVCG.2016.2598867","volume":"23","author":"Y Wu","year":"2016","unstructured":"Wu Y, Cao N, Archambault D, Shen Q, Qu H, Cui W (2016) Evaluation of graph sampling: a visualization perspective. IEEE Trans Visual Comput Graph 23(1):401\u2013410. https:\/\/doi.org\/10.1109\/TVCG.2016.2598867","journal-title":"IEEE Trans Visual Comput Graph"},{"key":"1123_CR48","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.ins.2015.02.014","volume":"306","author":"S-H Yoon","year":"2015","unstructured":"Yoon S-H, Kim K-N, Hong J, Kim S-W, Park S (2015) A community-based sampling method using dpl for online social networks. Inf Sci 306:53\u201369. https:\/\/doi.org\/10.1016\/j.ins.2015.02.014","journal-title":"Inf Sci"},{"issue":"4","key":"1123_CR49","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/s10618-020-00683-y","volume":"34","author":"MI Yousuf","year":"2020","unstructured":"Yousuf MI, Kim S (2020) Guided sampling for large graphs. Data Min Knowl Disc 34(4):905\u2013948. https:\/\/doi.org\/10.1007\/s10618-020-00683-y","journal-title":"Data Min Knowl Disc"},{"issue":"1","key":"1123_CR50","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/s13278-023-01060-5","volume":"13","author":"MI Yousuf","year":"2023","unstructured":"Yousuf MI, Anwer I, Anwar R (2023) Empirical characterization of graph sampling algorithms. Soc Netw Anal Min 13(1):66. https:\/\/doi.org\/10.1007\/s13278-023-01060-5","journal-title":"Soc Netw Anal Min"},{"key":"1123_CR51","doi-asserted-by":"publisher","first-page":"110","DOI":"10.2352\/ISSN.2470-1173.2017.1.VDA-394","volume":"29","author":"F Zhang","year":"2017","unstructured":"Zhang F, Zhang S, Medal WPC, Bian L, Swan JE II, Jankun-Kelly T (2017) A visual evaluation study of graph sampling techniques. Electron Imaging 29:110\u2013117. https:\/\/doi.org\/10.2352\/ISSN.2470-1173.2017.1.VDA-394","journal-title":"Electron Imaging"},{"issue":"3","key":"1123_CR52","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.visinf.2024.08.001","volume":"8","author":"Y Zhang","year":"2024","unstructured":"Zhang Y, Cai L, Liu Y, Li Y, Li S, Ma Y, Meng Y, Zhou Z (2024) Visual evaluation of graph representation learning based on the presentation of community structures. Visual Inf 8(3):29\u201331","journal-title":"Visual Inf"},{"key":"1123_CR53","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s10618-018-0587-5","volume":"33","author":"J Zhao","year":"2019","unstructured":"Zhao J, Wang P, Lui JC, Towsley D, Guan X (2019) Sampling online social networks by random walk with indirect jumps. Data Min Knowl Disc 33:24\u201357. https:\/\/doi.org\/10.1007\/s10618-018-0587-5","journal-title":"Data Min Knowl Disc"},{"issue":"2","key":"1123_CR54","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1109\/TVCG.2020.3030440","volume":"27","author":"Z Zhou","year":"2020","unstructured":"Zhou Z, Shi C, Shen X, Cai L, Wang H, Liu Y, Zhao Y, Chen W (2020) Context-aware sampling of large networks via graph representation learning. IEEE Trans Visual Comput Graph 27(2):1709\u20131719. https:\/\/doi.org\/10.1109\/TVCG.2020.3030440","journal-title":"IEEE Trans Visual Comput Graph"},{"issue":"5","key":"1123_CR55","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1109\/THMS.2023.3296692","volume":"53","author":"Z Zhou","year":"2023","unstructured":"Zhou Z, Zheng F, Wen J, Chen Y, Li X, Liu Y, Wang Y, Chen W (2023) A user-driven sampling model for large-scale geographical point data visualization via convolutional neural networks. IEEE Trans Hum Mach Syst 53(5):885\u2013894","journal-title":"IEEE Trans Hum Mach Syst"},{"issue":"2","key":"1123_CR56","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/TVCG.2024.3361001","volume":"31","author":"Z Zhou","year":"2024","unstructured":"Zhou Z, Ye L, Cai L, Wang L, Wang Y, Wang Y, Chen W, Wang Y (2024) Conceptthread: visualizing threaded concepts in mooc videos. IEEE Trans Visual Comput Graph 31(2):1354\u20131370","journal-title":"IEEE Trans Visual Comput Graph"},{"key":"1123_CR57","doi-asserted-by":"crossref","unstructured":"Zhou Z, Wang H, Zhao Z, Zheng F, Wang Y, Chen W, Wang Y (2024) Chartkg: a knowledge-graph-based representation for chart images. IEEE Trans Visual Comput Graph","DOI":"10.1109\/TVCG.2024.3476508"},{"issue":"13","key":"1123_CR58","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1093\/bioinformatics\/bty294","volume":"34","author":"M Zitnik","year":"2018","unstructured":"Zitnik M, Agrawal M, Leskovec J (2018) Modeling polypharmacy side effects with graph convolutional networks. Bioinformatics 34(13):457\u2013466. https:\/\/doi.org\/10.1093\/bioinformatics\/bty294","journal-title":"Bioinformatics"}],"container-title":["Journal of Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-026-01123-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12650-026-01123-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-026-01123-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T11:37:22Z","timestamp":1785497842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12650-026-01123-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,24]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["1123"],"URL":"https:\/\/doi.org\/10.1007\/s12650-026-01123-7","relation":{},"ISSN":["1343-8875","1875-8975"],"issn-type":[{"value":"1343-8875","type":"print"},{"value":"1875-8975","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,24]]},"assertion":[{"value":"15 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}