{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T04:40:09Z","timestamp":1742359209567,"version":"3.40.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T00:00:00Z","timestamp":1738195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T00:00:00Z","timestamp":1738195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LZ22F020015"],"award-info":[{"award-number":["LZ22F020015"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972122"],"award-info":[{"award-number":["61972122"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LY22F020023"],"award-info":[{"award-number":["LY22F020023"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Vis"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s12650-025-01044-x","type":"journal-article","created":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T20:22:35Z","timestamp":1738268555000},"page":"413-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A deep learning approach to evaluate the quality of graph layouts using GNN"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2599-506X","authenticated-orcid":false,"given":"Xiangyang","family":"Wu","sequence":"first","affiliation":[]},{"given":"Qian","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiaodong","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Xiaozhi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,30]]},"reference":[{"issue":"5","key":"1044_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1006\/jvlc.2002.0232","volume":"13","author":"HC Purchase","year":"2002","unstructured":"Purchase HC (2002) Metrics for graph drawing aesthetics. J Vis Lang Comput 13(5):501\u2013516","journal-title":"J Vis Lang Comput"},{"issue":"1","key":"1044_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TVCG.2010.269","volume":"18","author":"HC Purchase","year":"2012","unstructured":"Purchase HC, Pilcher C, Plimmer B (2012) Graph drawing aesthetics-created by users, not algorithms. IEEE Trans Visual Comput Graphics 18(1):81\u201392","journal-title":"IEEE Trans Visual Comput Graphics"},{"key":"1044_CR3","unstructured":"Bennett C, Ryall J, Spalteholz L, Gooch A (2007) The aesthetics of graph visualization. In: CAe, pp. 57\u201364"},{"issue":"2\/3","key":"1044_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1147\/JRD.2015.2411412","volume":"59","author":"C Dunne","year":"2015","unstructured":"Dunne C, Ross SI, Shneiderman B, Martino M (2015) Readability metric feedback for aiding node-link visualization designers. IBM J Res Dev 59(2\/3):14\u20131","journal-title":"IBM J Res Dev"},{"issue":"4","key":"1044_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MCG.2018.2881501","volume":"39","author":"H Haleem","year":"2019","unstructured":"Haleem H, Wang Y, Puri A, Wadhwa S, Qu H (2019) Evaluating the readability of force directed graph layouts: A deep learning approach. IEEE Comput Graphics Appl 39(4):40\u201353","journal-title":"IEEE Comput Graphics Appl"},{"key":"1044_CR6","doi-asserted-by":"crossref","unstructured":"Cai S, Hong S-H, Shen J, Liu T (2021) A machine learning approach for predicting human preference for graph layouts. In: 2021 IEEE 14th Pacific Visualization Symposium (PacificVis), pp. 6\u201310. IEEE","DOI":"10.1109\/PacificVis52677.2021.00009"},{"issue":"1","key":"1044_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1186\/s42492-023-00150-7","volume":"6","author":"F Zhou","year":"2023","unstructured":"Zhou F, Mi J, Zhang B, Shi J, Zhang R, Chen X, Zhao Y, Zhang J (2023) Reliable knowledge graph fact prediction via reinforcement learning. Vis Comput Ind, Biomed, Art 6(1):21","journal-title":"Vis Comput Ind, Biomed, Art"},{"issue":"3\u20134","key":"1044_CR8","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1177\/1473871612455749","volume":"12","author":"H Gibson","year":"2013","unstructured":"Gibson H, Faith J, Vickers P (2013) A survey of two-dimensional graph layout techniques for information visualisation. Inf Vis 12(3\u20134):324\u2013357","journal-title":"Inf Vis"},{"issue":"11","key":"1044_CR9","first-page":"1129","volume":"21","author":"TM Fruchterman","year":"1991","unstructured":"Fruchterman TM, Reingold EM (1991) Graph drawing by force-directed placement. Softw: Practice Exp 21(11):1129\u20131164","journal-title":"Softw: Practice Exp"},{"issue":"6","key":"1044_CR10","doi-asserted-by":"publisher","first-page":"98679","DOI":"10.1371\/journal.pone.0098679","volume":"9","author":"M Jacomy","year":"2014","unstructured":"Jacomy M, Venturini T, Heymann S, Bastian M (2014) Forceatlas2, a continuous graph layout algorithm for handy network visualization designed for the gephi software. PLoS ONE 9(6):98679","journal-title":"PLoS ONE"},{"key":"1044_CR11","doi-asserted-by":"crossref","unstructured":"Frick A, Ludwig A, Mehldau H (1994) A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration). In: International Symposium on Graph Drawing, pp. 388\u2013403. Springer","DOI":"10.1007\/3-540-58950-3_393"},{"issue":"1","key":"1044_CR12","first-page":"37","volume":"10","author":"Y Hu","year":"2005","unstructured":"Hu Y (2005) Efficient, high-quality force-directed graph drawing. Math J 10(1):37\u201371","journal-title":"Math J"},{"key":"1044_CR13","doi-asserted-by":"crossref","unstructured":"Hachul S, J\u00fcnger M (2004) Drawing large graphs with a potential-field-based multilevel algorithm. In: International Symposium on Graph Drawing, pp. 285\u2013295. Springer","DOI":"10.1007\/978-3-540-31843-9_29"},{"key":"1044_CR14","doi-asserted-by":"crossref","unstructured":"Gajer P, Kobourov SG (2000) Grip: Graph drawing with intelligent placement. In: International Symposium on Graph Drawing, pp. 222\u2013228. Springer","DOI":"10.1007\/3-540-44541-2_21"},{"issue":"2","key":"1044_CR15","doi-asserted-by":"publisher","first-page":"1666","DOI":"10.1109\/TVCG.2020.3030447","volume":"27","author":"M Zhu","year":"2020","unstructured":"Zhu M, Chen W, Hu Y, Hou Y, Liu L, Zhang K (2020) Drgraph: An efficient graph layout algorithm for large-scale graphs by dimensionality reduction. IEEE Trans Visual Comput Graphics 27(2):1666\u20131676","journal-title":"IEEE Trans Visual Comput Graphics"},{"key":"1044_CR16","doi-asserted-by":"crossref","unstructured":"Kruiger JF, Rauber PE, Martins RM, Kerren A, Kobourov S, Telea AC (2017) Graph layouts by t-sne. In: Computer Graphics Forum, vol. 36, pp. 283\u2013294. Wiley Online Library","DOI":"10.1111\/cgf.13187"},{"key":"1044_CR17","doi-asserted-by":"crossref","unstructured":"Harel D, Koren Y (2002) Graph drawing by high-dimensional embedding. In: International Symposium on Graph Drawing, pp. 207\u2013219. Springer","DOI":"10.1007\/3-540-36151-0_20"},{"key":"1044_CR18","doi-asserted-by":"crossref","unstructured":"Brandes U, Pich C (2006) Eigensolver methods for progressive multidimensional scaling of large data. In: International Symposium on Graph Drawing, pp. 42\u201353. Springer","DOI":"10.1007\/978-3-540-70904-6_6"},{"issue":"11\u201312","key":"1044_CR19","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1016\/j.camwa.2004.08.015","volume":"49","author":"Y Koren","year":"2005","unstructured":"Koren Y (2005) Drawing graphs by eigenvectors: theory and practice. Comput Math Appl 49(11\u201312):1867\u20131888","journal-title":"Comput Math Appl"},{"issue":"1","key":"1044_CR20","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TVCG.2019.2934396","volume":"26","author":"O-H Kwon","year":"2019","unstructured":"Kwon O-H, Ma K-L (2019) A deep generative model for graph layout. IEEE Trans Visual Comput Graphics 26(1):665\u2013675","journal-title":"IEEE Trans Visual Comput Graphics"},{"issue":"1","key":"1044_CR21","first-page":"676","volume":"26","author":"Y Wang","year":"2019","unstructured":"Wang Y, Jin Z, Wang Q, Cui W, Ma T, Qu H (2019) Deepdrawing: A deep learning approach to graph drawing. IEEE Trans Visual Comput Graphics 26(1):676\u2013686","journal-title":"IEEE Trans Visual Comput Graphics"},{"issue":"5","key":"1044_CR22","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MCG.2021.3093908","volume":"41","author":"X Wang","year":"2021","unstructured":"Wang X, Yen K, Hu Y, Shen H-W (2021) Deepgd: A deep learning framework for graph drawing using GNN. IEEE Comput Graphics Appl 41(5):32\u201344","journal-title":"IEEE Comput Graphics Appl"},{"key":"1044_CR23","doi-asserted-by":"crossref","unstructured":"Purchase HC, Cohen RF, James M (1996) Validating graph drawing aesthetics. In: Graph Drawing: Symposium on Graph Drawing, GD\u201995 Passau, Germany, September 20\u201322, 1995 Proceedings 3, pp. 435\u2013446. Springer","DOI":"10.1007\/BFb0021827"},{"key":"1044_CR24","doi-asserted-by":"crossref","unstructured":"Taylor M, Rodgers P (2005) Applying graphical design techniques to graph visualisation. In: Ninth International Conference on Information Visualisation (IV\u201905), pp. 651\u2013656. IEEE","DOI":"10.1109\/IV.2005.19"},{"key":"1044_CR25","doi-asserted-by":"crossref","unstructured":"Biedl T, Marks J, Ryall K, Whitesides S (1998) Graph multidrawing: Finding nice drawings without defining nice. In: Graph Drawing: 6th International Symposium, GD\u201998 Montr\u00e9al, Canada, August 13\u201315, 1998 Proceedings 6, pp. 347\u2013355. Springer","DOI":"10.1007\/3-540-37623-2_26"},{"issue":"4","key":"1044_CR26","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.jvlc.2011.12.002","volume":"24","author":"W Huang","year":"2013","unstructured":"Huang W, Eades P, Hong S-H, Lin C-C (2013) Improving multiple aesthetics produces better graph drawings. J Vis Lang Comput 24(4):262\u2013272","journal-title":"J Vis Lang Comput"},{"key":"1044_CR27","doi-asserted-by":"crossref","unstructured":"Masui T (1994) Evolutionary learning of graph layout constraints from examples. In: Proceedings of the 7th Annual ACM Symposium on User Interface Software and Technology, pp. 103\u2013108","DOI":"10.1145\/192426.192468"},{"issue":"1","key":"1044_CR28","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/TVCG.2017.2743858","volume":"24","author":"O-H Kwon","year":"2017","unstructured":"Kwon O-H, Crnovrsanin T, Ma K-L (2017) What would a graph look like in this layout? a machine learning approach to large graph visualization. IEEE Trans Visual Comput Graphics 24(1):478\u2013488","journal-title":"IEEE Trans Visual Comput Graphics"},{"issue":"1","key":"1044_CR29","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1109\/TVCG.2015.2467691","volume":"22","author":"Y Wang","year":"2015","unstructured":"Wang Y, Shen Q, Archambault D, Zhou Z, Zhu M, Yang S, Qu H (2015) Ambiguityvis: Visualization of ambiguity in graph layouts. IEEE Trans Visual Comput Graphics 22(1):359\u2013368","journal-title":"IEEE Trans Visual Comput Graphics"},{"key":"1044_CR30","doi-asserted-by":"crossref","unstructured":"Klammler M, Mchedlidze T, Pak A (2018) Aesthetic discrimination of graph layouts. In: International Symposium on Graph Drawing and Network Visualization, pp. 169\u2013184. Springer","DOI":"10.1007\/978-3-030-04414-5_12"},{"key":"1044_CR31","unstructured":"Bruna J, Zaremba W, Szlam A, LeCun Y (2013) Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203"},{"key":"1044_CR32","first-page":"3844","volume":"29","author":"M Defferrard","year":"2016","unstructured":"Defferrard M, Bresson X, Vandergheynst P (2016) Convolutional neural networks on graphs with fast localized spectral filtering. Adv Neural Inf Process Syst 29:3844\u20133852","journal-title":"Adv Neural Inf Process Syst"},{"key":"1044_CR33","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907"},{"key":"1044_CR34","unstructured":"Bo D, Shi C, Wang L, Liao R (2023) Specformer: Spectral graph neural networks meet transformers. arXiv preprint arXiv:2303.01028"},{"key":"1044_CR35","doi-asserted-by":"crossref","unstructured":"Guo J, Huang K, Yi X, Zhang R (2023) Graph neural networks with diverse spectral filtering. In: Proceedings of the ACM Web Conference 2023, pp. 306\u2013316","DOI":"10.1145\/3543507.3583324"},{"key":"1044_CR36","unstructured":"Gilmer J, Schoenholz SS, Riley PF, Vinyals O, Dahl GE (2017) Neural message passing for quantum chemistry. In: International Conference on Machine Learning, pp. 1263\u20131272. PMLR"},{"key":"1044_CR37","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv preprint arXiv:1710.10903"},{"key":"1044_CR38","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 1025\u20131035"},{"key":"1044_CR39","unstructured":"Ying R, You J, Morris C, Ren X, Hamilton WL, Leskovec J (2018) Hierarchical graph representation learning with differentiable pooling. arXiv preprint arXiv:1806.08804"},{"key":"1044_CR40","unstructured":"Lee J, Lee I, Kang J (2019) Self-attention graph pooling. In: International Conference on Machine Learning, pp. 3734\u20133743. PMLR"},{"key":"1044_CR41","unstructured":"Gao H, Ji S (2019) Graph u-nets. In: International Conference on Machine Learning, pp. 2083\u20132092 . PMLR"},{"key":"1044_CR42","doi-asserted-by":"crossref","unstructured":"Zhang M, Cui Z, Neumann M, Chen Y (2018) An end-to-end deep learning architecture for graph classification. In: Thirty-Second AAAI Conference on Artificial Intelligence","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"1044_CR43","unstructured":"Cangea C, Veli\u010dkovi\u0107 P, Jovanovi\u0107 N, Kipf T, Li\u00f2 P (2018) Towards sparse hierarchical graph classifiers. arXiv preprint arXiv:1811.01287"},{"issue":"1","key":"1044_CR44","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.visinf.2023.06.008","volume":"8","author":"Y Zhao","year":"2024","unstructured":"Zhao Y, Lv S, Long W, Fan Y, Yuan J, Jiang H, Zhou F (2024) Malicious webshell family dataset for webshell multi-classification research. Vis Inform 8(1):47\u201355","journal-title":"Vis Inform"},{"issue":"1\u20133","key":"1044_CR45","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0169-7439(87)80084-9","volume":"2","author":"S Wold","year":"1987","unstructured":"Wold S, Esbensen K, Geladi P (1987) Principal component analysis. Chemom Intell Lab Syst 2(1\u20133):37\u201352","journal-title":"Chemom Intell Lab Syst"},{"key":"1044_CR46","doi-asserted-by":"crossref","unstructured":"Fujiwara T, Zhao J, Chen F, Ma K-L (2020) A visual analytics framework for contrastive network analysis. In: 2020 IEEE Conference on Visual Analytics Science and Technology (VAST), pp. 48\u201359. IEEE","DOI":"10.1109\/VAST50239.2020.00010"},{"key":"1044_CR47","doi-asserted-by":"crossref","unstructured":"Simonovsky M, Komodakis N (2017) Dynamic edge-conditioned filters in convolutional neural networks on graphs. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3693\u20133702","DOI":"10.1109\/CVPR.2017.11"},{"key":"1044_CR48","unstructured":"Cai T, Luo S, Xu K, He D, Liu T-y, Wang L (2021) Graphnorm: A principled approach to accelerating graph neural network training. In: International Conference on Machine Learning, pp. 1204\u20131215. PMLR"},{"key":"1044_CR49","doi-asserted-by":"crossref","unstructured":"Gansner ER, Koren Y, North S (2004) Graph drawing by stress majorization. In: International Symposium on Graph Drawing, pp. 239\u2013250. Springer","DOI":"10.1007\/978-3-540-31843-9_25"},{"issue":"11","key":"1044_CR50","first-page":"2579","volume":"9","author":"L Maaten","year":"2008","unstructured":"Maaten L, Hinton G (2008) Visualizing data using t-sne. J Mach Learn Res 9(11):2579\u20132605","journal-title":"J Mach Learn Res"},{"key":"1044_CR51","unstructured":"Koch G, Zemel R, Salakhutdinov R (2015) Siamese neural networks for one-shot image recognition. In: ICML Deep Learning Workshop, vol. 2. Lille"},{"key":"1044_CR52","doi-asserted-by":"crossref","unstructured":"Doerr C, Blenn N (2013) Metric convergence in social network sampling. In: Proceedings of the 5th ACM Workshop on HotPlanet, pp. 45\u201350","DOI":"10.1145\/2491159.2491168"},{"issue":"1","key":"1044_CR53","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1214\/aoms\/1177705148","volume":"32","author":"LA Goodman","year":"1961","unstructured":"Goodman LA (1961) Snowball Sampling. Ann Math Stat 32(1):148\u2013170. https:\/\/doi.org\/10.1214\/aoms\/1177705148","journal-title":"Ann Math Stat"},{"key":"1044_CR54","doi-asserted-by":"crossref","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","DOI":"10.1145\/1150402.1150479"}],"container-title":["Journal of Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-025-01044-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12650-025-01044-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-025-01044-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T04:18:35Z","timestamp":1742357915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12650-025-01044-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,30]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["1044"],"URL":"https:\/\/doi.org\/10.1007\/s12650-025-01044-x","relation":{},"ISSN":["1343-8875","1875-8975"],"issn-type":[{"type":"print","value":"1343-8875"},{"type":"electronic","value":"1875-8975"}],"subject":[],"published":{"date-parts":[[2025,1,30]]},"assertion":[{"value":"7 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}