{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:24:02Z","timestamp":1760142242531,"version":"build-2065373602"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Open Fund of Key Laboratory of Smart Earth","award":["KF2023YB02-05"],"award-info":[{"award-number":["KF2023YB02-05"]}]},{"name":"Key Specialized Research and Development Breakthrough of Henan Province","award":["242102210089"],"award-info":[{"award-number":["242102210089"]}]},{"DOI":"10.13039\/501100004761","name":"The Natural Science Foundation of Henan Province","doi-asserted-by":"crossref","award":["252300421799"],"award-info":[{"award-number":["252300421799"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]},{"name":"State Key Laboratory of Spatial Datum","award":["SKLGIE2024-M-4-1","SKLGIE2023-M-4-1"],"award-info":[{"award-number":["SKLGIE2024-M-4-1","SKLGIE2023-M-4-1"]}]},{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["42301526"],"award-info":[{"award-number":["42301526"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Vis Comput"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s00371-025-04145-8","type":"journal-article","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T18:00:22Z","timestamp":1755885622000},"page":"12071-12089","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ComVis: a four-level prompt model for overlapping community detection with graph visualization"],"prefix":"10.1007","volume":"41","author":[{"given":"Xuan","family":"Guo","sequence":"first","affiliation":[]},{"given":"Bohao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Huanyu","family":"Bi","sequence":"additional","affiliation":[]},{"given":"Juanxiu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Yihong","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Junnan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Mingliang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"key":"4145_CR1","volume":"227","author":"H Li","year":"2023","unstructured":"Li, H., Zhang, X., Zhao, C., Wang, Z.: Attention-based hierarchical random graph model for structural inference of real-world networks. Expert Syst. Appl. 227, 120199 (2023)","journal-title":"Expert Syst. Appl."},{"issue":"12","key":"4145_CR2","doi-asserted-by":"crossref","first-page":"2486","DOI":"10.1109\/TVCG.2013.232","volume":"19","author":"C Vehlow","year":"2013","unstructured":"Vehlow, C., Reinhardt, T., Weiskopf, D.: Visualizing fuzzy overlapping communities in networks. IEEE Trans. Vis. Comput. Graph. 19(12), 2486\u20132495 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"4145_CR3","doi-asserted-by":"crossref","unstructured":"Tang, J., Yang, Y., Wei, W., Shi, L., Su, L., Cheng, S., Yin, D., Huang, C.: Graphgpt: Graph instruction tuning for large language models. In: Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 491\u2013500 (2024)","DOI":"10.1145\/3626772.3657775"},{"key":"4145_CR4","doi-asserted-by":"crossref","unstructured":"Mehta, N., Goldwasser, D.: Using RL to Identify Divisive Perspectives Improves LLMs Abilities to Identify Communities on Social Media. arXiv preprint https:\/\/arxiv.org\/abs\/2406.00969 (2024)","DOI":"10.18653\/v1\/2024.findings-emnlp.309"},{"issue":"1","key":"4145_CR5","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1109\/TVCG.2021.3114770","volume":"28","author":"A Lundgard","year":"2021","unstructured":"Lundgard, A., Satyanarayan, A.: Accessible visualization via natural language descriptions: a four-level model of semantic content. IEEE Trans. Vis. Comput. Graph. 28(1), 1073\u20131083 (2021)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"4145_CR6","doi-asserted-by":"crossref","unstructured":"Gregory, S.: An algorithm to find overlapping community structure in networks. In: European Conference on Principles of Data Mining and Knowledge Discovery,pp. 91\u2013102 (2007)","DOI":"10.1007\/978-3-540-74976-9_12"},{"key":"4145_CR7","unstructured":"Ronhovde, R.K., Nussinov, Z.: An edge density definition of overlapping and weighted graph communities. arXiv preprint https:\/\/arxiv.org\/abs\/1301.3120 (2013)"},{"key":"4145_CR8","unstructured":"Havemann, F., Gl\u00e4ser, J., Heinz, M., Struck, A.: Evaluating overlapping communities with the conductance of their boundary nodes. arXiv preprint https:\/\/arxiv.org\/abs\/1206.3992 (2012)"},{"issue":"5","key":"4145_CR9","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1109\/TKDE.2016.2518687","volume":"28","author":"JJ Whang","year":"2016","unstructured":"Whang, J.J., Gleich, D.F., Dhillon, I.S.: Overlapping community detection using neighborhood-inflated seed expansion. IEEE Trans. Knowl. Data Eng. 28(5), 1272\u20131284 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3\u20135","key":"4145_CR10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"1","key":"4145_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13278-025-01480-5","volume":"15","author":"FR Khawaja","year":"2025","unstructured":"Khawaja, F.R., Zhang, Z., Ullah, A.: Common-neighbor based overlapping community detection in complex networks. Soc. Netw. Anal. Min. 15(1), 1\u201319 (2025)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"9","key":"4145_CR12","doi-asserted-by":"crossref","first-page":"7765","DOI":"10.1016\/j.jksuci.2021.07.006","volume":"34","author":"D Singh","year":"2022","unstructured":"Singh, D., Garg, R.: NI-louvain: a novel algorithm to detect overlapping communities with influence analysis. J. King Saud Univ. - Comput. Inf. Sci. 34(9), 7765\u20137774 (2022)","journal-title":"J. King Saud Univ. - Comput. Inf. Sci."},{"issue":"2","key":"4145_CR13","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"key":"4145_CR14","doi-asserted-by":"crossref","unstructured":"Que, X., Checconi, F., Petrini, F., Gunnels, J.A.: Scalable community detection with the louvain algorithm. In: 2015 IEEE international parallel and distributed processing symposium, pp. 28\u201337 (2015)","DOI":"10.1109\/IPDPS.2015.59"},{"issue":"4","key":"4145_CR15","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/TCSS.2017.2749282","volume":"4","author":"X Zhang","year":"2017","unstructured":"Zhang, X., Wang, C., Su, Y., Pan, L., Zhang, H.-F.: A fast overlapping community detection algorithm based on weak cliques for large-scale networks. IEEE Trans. Comput. Soc. Syst. 4(4), 218\u2013230 (2017)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"issue":"5","key":"4145_CR16","doi-asserted-by":"crossref","first-page":"2833","DOI":"10.1109\/TSMC.2019.2917215","volume":"51","author":"Y Su","year":"2019","unstructured":"Su, Y., Liu, C., Niu, Y., Cheng, F., Zhang, X.: A community structure enhancement-based community detection algorithm for complex networks. IEEE Trans. Syst. Man Cybern. Syst. 51(5), 2833\u20132846 (2019)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"10","key":"4145_CR17","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech: Theory Exp."},{"issue":"1","key":"4145_CR18","doi-asserted-by":"crossref","first-page":"8064","DOI":"10.1038\/s41598-018-26415-3","volume":"8","author":"J Cheng","year":"2018","unstructured":"Cheng, J., Yin, X., Li, Q., Yang, H., Li, L., Leng, M., Chen, X.: Voting simulation based agglomerative hierarchical method for network community detection. Sci. Rep. 8(1), 8064 (2018)","journal-title":"Sci. Rep."},{"issue":"6","key":"4145_CR19","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"4145_CR20","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"issue":"9","key":"4145_CR21","doi-asserted-by":"crossref","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F Radicchi","year":"2004","unstructured":"Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. Proc. Natl. Acad. Sci. U. S. A. 101(9), 2658\u20132663 (2004)","journal-title":"Proc. Natl. Acad. Sci. U. S. A."},{"key":"4145_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.128169","author":"J Li","year":"2024","unstructured":"Li, J., Lai, S., Shuai, Z., Tan, Y., Jia, Y., Yu, M., Song, Z., Peng, X., Xu, Z., Ni, Y.: A comprehensive review of community detection in graphs. Neurocomputing (2024). https:\/\/doi.org\/10.1016\/j.neucom.2024.128169","journal-title":"Neurocomputing"},{"issue":"47","key":"4145_CR23","first-page":"1","volume":"20","author":"Z Zhou","year":"2019","unstructured":"Zhou, Z., Amini, A.A.: Analysis of spectral clustering algorithms for community detection: the general bipartite setting. J. Mach. Learn. Res. 20(47), 1\u201347 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"4145_CR24","doi-asserted-by":"crossref","first-page":"2150","DOI":"10.1016\/j.neucom.2017.10.060","volume":"275","author":"B Tian","year":"2018","unstructured":"Tian, B., Li, W.: Community detection method based on mixed-norm sparse subspace clustering. Neurocomputing 275, 2150\u20132161 (2018)","journal-title":"Neurocomputing"},{"key":"4145_CR25","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2023.126490","volume":"550","author":"H Qing","year":"2023","unstructured":"Qing, H., Wang, J.: Regularized spectral clustering under the mixed membership stochastic block model. Neurocomputing 550, 126490 (2023)","journal-title":"Neurocomputing"},{"key":"4145_CR26","first-page":"22","volume":"6","author":"G Shen","year":"2017","unstructured":"Shen, G., Ye, D.: A distance-based spectral clustering approach with applications to network community detection. J. Ind. Inf. Integr. 6, 22\u201332 (2017)","journal-title":"J. Ind. Inf. Integr."},{"issue":"4","key":"4145_CR27","doi-asserted-by":"crossref","first-page":"2200","DOI":"10.1109\/TNSE.2022.3158030","volume":"9","author":"Z Zhong","year":"2022","unstructured":"Zhong, Z., Wang, X., Qu, C., Wang, G.: Efficient algorithm based on non-backtracking matrix for community detection in signed networks. IEEE Trans. Netw. Sci. Eng. 9(4), 2200\u20132211 (2022)","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"23","key":"4145_CR28","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman, M.E.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. U. S. A. 103(23), 8577\u20138582 (2006)","journal-title":"Proc. Natl. Acad. Sci. U. S. A."},{"issue":"2","key":"4145_CR29","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2007","unstructured":"Brandes, U., Delling, D., Gaertler, M., Gorke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172\u2013188 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4145_CR30","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.knosys.2013.06.014","volume":"50","author":"Z Bu","year":"2013","unstructured":"Bu, Z., Zhang, C., Xia, Z., Wang, J.: A fast parallel modularity optimization algorithm (FPMQA) for community detection in online social network. Knowl.-Based Syst. 50, 246\u2013259 (2013)","journal-title":"Knowl.-Based Syst."},{"key":"4145_CR31","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/j.future.2018.06.010","volume":"88","author":"J Sanchez-Oro","year":"2018","unstructured":"Sanchez-Oro, J., Duarte, A.: Iterated greedy algorithm for performing community detection in social networks. Future Gener. Comput. Syst. 88, 785\u2013791 (2018)","journal-title":"Future Gener. Comput. Syst."},{"key":"4145_CR32","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.asoc.2015.05.034","volume":"34","author":"C-H Mu","year":"2015","unstructured":"Mu, C.-H., Xie, J., Liu, Y., Chen, F., Liu, Y., Jiao, L.-C.: Memetic algorithm with simulated annealing strategy and tightness greedy optimization for community detection in networks. Appl. Soft Comput. 34, 485\u2013501 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"2\u20134","key":"4145_CR33","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.physa.2005.04.022","volume":"358","author":"A Medus","year":"2005","unstructured":"Medus, A., Acuna, G., Dorso, C.O.: Detection of community structures in networks via global optimization. Phys. A Stat. Mech. Appl. 358(2\u20134), 593\u2013604 (2005)","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"4145_CR34","first-page":"1081","volume":"5199","author":"C Pizzuti","year":"2008","unstructured":"Pizzuti, C.: Ga-net: A genetic algorithm for community detection in social networks. Int. Conf. Parallel Probl. Solving Nat. 5199, 1081\u20131090 (2008)","journal-title":"Int. Conf. Parallel Probl. Solving Nat."},{"issue":"5","key":"4145_CR35","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1016\/j.physa.2012.11.003","volume":"392","author":"R Shang","year":"2013","unstructured":"Shang, R., Bai, J., Jiao, L., Jin, C.: Community detection based on modularity and an improved genetic algorithm. Phys. A Stat. Mech. Appl. 392(5), 1215\u20131231 (2013)","journal-title":"Phys. A Stat. Mech. Appl."},{"issue":"2","key":"4145_CR36","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1109\/TCSS.2020.2964197","volume":"7","author":"M Seifikar","year":"2020","unstructured":"Seifikar, M., Farzi, S., Barati, M.: C-blondel: an efficient louvain-based dynamic community detection algorithm. IEEE Trans. Comput. Soc. Syst. 7(2), 308\u2013318 (2020)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"issue":"3","key":"4145_CR37","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1109\/TCSS.2019.2912801","volume":"6","author":"J Chen","year":"2019","unstructured":"Chen, J., Chen, L., Chen, Y., Zhao, M., Yu, S., Xuan, Q., Yang, X.: GA-based q-attack on community detection. IEEE Trans. Comput. Soc. Syst. 6(3), 491\u2013503 (2019)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"issue":"1","key":"4145_CR38","doi-asserted-by":"crossref","first-page":"24115","DOI":"10.1038\/srep24115","volume":"6","author":"Z Ding","year":"2016","unstructured":"Ding, Z., Zhang, X., Sun, D., Luo, B.: Overlapping community detection based on network decomposition. Sci. Rep. 6(1), 24115 (2016)","journal-title":"Sci. Rep."},{"issue":"8","key":"4145_CR39","doi-asserted-by":"crossref","first-page":"2023","DOI":"10.1007\/s10115-022-01704-6","volume":"64","author":"SK Gupta","year":"2022","unstructured":"Gupta, S.K., Singh, D.P., Choudhary, J.: A review of clique-based overlapping community detection algorithms. Knowl. Inf. Syst. 64(8), 2023\u20132058 (2022)","journal-title":"Knowl. Inf. Syst."},{"issue":"7043","key":"4145_CR40","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"issue":"6","key":"4145_CR41","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1109\/TVCG.2012.172","volume":"19","author":"J Yang","year":"2012","unstructured":"Yang, J., Liu, Y., Zhang, X., Yuan, X., Zhao, Y., Barlowe, S., Liu, S.: Piwi: visually exploring graphs based on their community structure. IEEE Trans. Vis. Comput. Graph. 19(6), 1034\u20131047 (2012)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"4145_CR42","doi-asserted-by":"crossref","first-page":"1028","DOI":"10.1109\/TVCG.2024.3456167","volume":"31","author":"N Al-Naami","year":"2024","unstructured":"Al-Naami, N., M\u00e9doc, N., Magnani, M., Ghoniem, M.: Improved visual saliency of graph clusters with orderable node-link layouts. IEEE Trans. Vis. Comput. Graph. 31(1), 1028\u20131038 (2024)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"12","key":"4145_CR43","doi-asserted-by":"crossref","first-page":"3081","DOI":"10.1109\/TVCG.2018.2790961","volume":"24","author":"V Yoghourdjian","year":"2018","unstructured":"Yoghourdjian, V., Dwyer, T., Klein, K., Marriott, K., Wybrow, M.: Graph thumbnails: identifying and comparing multiple graphs at a glance. IEEE Trans. Vis. Comput. Graph. 24(12), 3081\u20133095 (2018)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"4145_CR44","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1109\/TVCG.2021.3114679","volume":"28","author":"D Zhang","year":"2021","unstructured":"Zhang, D., Adar, E., Hullman, J.: Visualizing uncertainty in probabilistic graphs with network hypothetical outcome plots (NetHOPs). IEEE Trans. Vis. Comput. Graph. 28(1), 443\u2013453 (2021)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"4145_CR45","first-page":"562","volume":"30","author":"Q Chen","year":"2023","unstructured":"Chen, Q., Chen, N., Shuai, W., Wu, G., Xu, Z., Tong, H., Cao, N.: Calliope-net: automatic generation of graph data facts via annotated node-link diagrams. IEEE Trans. Vis. Comput. Graph. 30(1), 562\u2013572 (2023)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"4145_CR46","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/TVCG.2021.3114761","volume":"28","author":"Y Wang","year":"2021","unstructured":"Wang, Y., Cheng, D., Wang, Z., Zhang, J., Zhou, L., He, G., Deussen, O.: F2-bubbles: faithful bubble set construction and flexible editing. IEEE Trans. Vis. Comput. Graph. 28(1), 422\u2013432 (2021)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"4145_CR47","first-page":"2810","volume":"48","author":"A Schein","year":"2016","unstructured":"Schein, A., Zhou, M., Blei, D., Wallach, H.: Bayesian poisson tucker decomposition for learning the structure of international relations. Int. Conf. Mach. Learn. 48, 2810\u20132819 (2016)","journal-title":"Int. Conf. Mach. Learn."},{"key":"4145_CR48","doi-asserted-by":"crossref","unstructured":"Alper, B., Bach, B., Henry Riche, N., Isenberg, T., Fekete, J.-D.: Weighted graph comparison techniques for brain connectivity analysis. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 483\u2013492 (2013)","DOI":"10.1145\/2470654.2470724"},{"issue":"10","key":"4145_CR49","doi-asserted-by":"crossref","first-page":"2940","DOI":"10.1109\/TVCG.2018.2865940","volume":"25","author":"M Okoe","year":"2018","unstructured":"Okoe, M., Jianu, R., Kobourov, S.: Node-link or adjacency matrices: old question, new insights. IEEE Trans. Vis. Comput. Graph. 25(10), 2940\u20132952 (2018)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"4145_CR50","first-page":"756","volume":"29","author":"W Zhang","year":"2022","unstructured":"Zhang, W., Wong, J.K., Wang, X., Gong, Y., Zhu, R., Liu, K., Yan, Z., Tan, S., Qu, H., Chen, S.: Cohortva: a visual analytic system for interactive exploration of cohorts based on historical data. IEEE Trans. Vis. Comput. Graph. 29(1), 756\u2013766 (2022)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"2","key":"4145_CR51","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/TVCG.2020.3030408","volume":"27","author":"MT Fischer","year":"2020","unstructured":"Fischer, M.T., Arya, D., Streeb, D., Seebacher, D., Keim, D.A., Worring, M.: Visual analytics for temporal hypergraph model exploration. IEEE Trans. Visual Comput. Graph. 27(2), 550\u2013560 (2020)","journal-title":"IEEE Trans. Visual Comput. Graph."},{"issue":"6","key":"4145_CR52","doi-asserted-by":"crossref","first-page":"2849","DOI":"10.1109\/TVCG.2023.3261910","volume":"29","author":"J Zhou","year":"2023","unstructured":"Zhou, J., Wang, X., Wang, J., Ye, H., Wang, H., Zhou, Z., Han, D., Ying, H., Wu, J., Chen, W.: Fraudauditor: a visual analytics approach for collusive fraud in health insurance. IEEE Trans. Vis. Comput. Graph. 29(6), 2849\u20132861 (2023)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"4145_CR53","unstructured":"Zhao, W.X., Zhou, K., Li, J., Tang, T., Wang, X., Hou, Y., Min, Y., Zhang, B., Zhang, J., Dong, Z.: A survey of large language models. arXiv preprint https:\/\/arxiv.org\/abs\/2303.18223 (2023)"},{"key":"4145_CR54","unstructured":"Brown, T.B.: Language models are few-shot learners. arXiv preprint https:\/\/arxiv.org\/abs\/2005.14165 (2020)"},{"key":"4145_CR55","unstructured":"Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.-A., Lacroix, T., Rozi\u00e8re, B., Goyal, N., Hambro, E., Azhar, F.: Llama: Open and efficient foundation language models. arXiv preprint https:\/\/arxiv.org\/abs\/2302.13971 (2023)"},{"key":"4145_CR56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TVCG.2024.3372099","volume":"31","author":"Y Tian","year":"2024","unstructured":"Tian, Y., Cui, W., Deng, D., Yi, X., Yang, Y., Zhang, H., Wu, Y.: Chartgpt: leveraging llms to generate charts from abstract natural language. IEEE Trans. Vis. Comput. Graphics 31, 1\u201315 (2024)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"1","key":"4145_CR57","first-page":"295","volume":"30","author":"Y Feng","year":"2023","unstructured":"Feng, Y., Wang, X., Wong, K.K., Wang, S., Lu, Y., Zhu, M., Wang, B., Chen, W.: Promptmagician: interactive prompt engineering for text-to-image creation. IEEE Trans. Vis. Comput. Graph. 30(1), 295\u2013305 (2023)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"9","key":"4145_CR58","doi-asserted-by":"crossref","first-page":"6520","DOI":"10.1109\/TVCG.2023.3346713","volume":"30","author":"A Coscia","year":"2023","unstructured":"Coscia, A., Endert, A.: Knowledgevis: interpreting language models by comparing fill-in-the-blank prompts. IEEE Trans. Vis. Comput. Graph. 30(9), 6520\u20136532 (2023)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"4145_CR59","first-page":"1","volume":"31","author":"Y Zhao","year":"2024","unstructured":"Zhao, Y., Zhang, Y., Zhang, Y., Zhao, X., Wang, J., Shao, Z., Turkay, C., Chen, S.: LEVA: Using large language models to enhance visual analytics. IEEE Trans. Vis. Comput. Graphics 31, 1\u201317 (2024)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"1","key":"4145_CR60","first-page":"236","volume":"29","author":"Y Shi","year":"2022","unstructured":"Shi, Y., Liu, P., Chen, S., Sun, M., Cao, N.: Supporting expressive and faithful pictorial visualization design with visual style transfer. IEEE Trans. Vis. Comput. Graph. 29(1), 236\u2013246 (2022)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"4145_CR61","first-page":"284","volume":"30","author":"S Xiao","year":"2023","unstructured":"Xiao, S., Huang, S., Lin, Y., Ye, Y., Zeng, W.: Let the chart spark: embedding semantic context into chart with text-to-image generative model. IEEE Trans. Vis. Comput. Graph. 30(1), 284\u2013294 (2023)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"4145_CR62","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3654992","volume":"2","author":"Y Wu","year":"2024","unstructured":"Wu, Y., Wan, Y., Zhang, H., Sui, Y., Wei, W., Zhao, W., Xu, G., Jin, H.: Automated data visualization from natural language via large language models: an exploratory study. Proc. ACM Manag. Data. 2(3), 1\u201328 (2024)","journal-title":"Proc. ACM Manag. Data."},{"key":"4145_CR63","doi-asserted-by":"crossref","unstructured":"Tang, B.J., Boggust, A., Satyanarayan, A.: Vistext: A benchmark for semantically rich chart captioning. arXiv preprint https:\/\/arxiv.org\/abs\/2307.05356, 1:7268\u20137298 (2023)","DOI":"10.18653\/v1\/2023.acl-long.401"},{"key":"4145_CR64","doi-asserted-by":"crossref","unstructured":"Ko, H.-K., Jeon, H., Park, G., Kim, D.H., Kim, N.W., Kim, J., Seo, J.: Natural language dataset generation framework for visualizations powered by large language models. In: Proceedings of the CHI Conference on Human Factors in Computing Systems, pp. 1\u201322 (2024)","DOI":"10.1145\/3613904.3642943"},{"key":"4145_CR65","unstructured":"Choe, K., Lee, C., Lee, S., Song, J., Cho, A., Kim, N.W., Seo, J.: Enhancing data literacy on-demand: LLMs as guides for novices in chart interpretation. IEEE Trans. Vis. Comput. Graphics, 1\u201317 (2024)"},{"issue":"12","key":"4145_CR66","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. U. S. A. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci. U. S. A."},{"issue":"7307","key":"4145_CR67","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"Y-Y Ahn","year":"2010","unstructured":"Ahn, Y.-Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(7307), 761\u2013764 (2010)","journal-title":"Nature"},{"issue":"1","key":"4145_CR68","volume":"80","author":"TS Evans","year":"2009","unstructured":"Evans, T.S., Lambiotte, R.: Line graphs, link partitions, and overlapping communities. Phys. Rev. E 80(1), 016105 (2009)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"4145_CR69","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/TVCG.2015.2467771","volume":"22","author":"X Huang","year":"2015","unstructured":"Huang, X., Zhao, Y., Ma, C., Yang, J., Ye, X., Zhang, C.: Trajgraph: a graph-based visual analytics approach to studying urban network centralities using taxi trajectory data. IEEE Trans. Vis. Comput. Graph. 22(1), 160\u2013169 (2015)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"4145_CR70","unstructured":"Freeman, L.C.: Centrality in social networks: Conceptual clarification. Social network: critical concepts in sociology. Londres: Routledge, 1:238\u2013263 (2002)"},{"issue":"1","key":"4145_CR71","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L Freeman","year":"1977","unstructured":"Freeman, L.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35\u201341 (1977)","journal-title":"Sociometry"},{"key":"4145_CR72","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1109\/ACCESS.2022.3232288","volume":"11","author":"K Hajarathaiah","year":"2022","unstructured":"Hajarathaiah, K., Enduri, M.K., Dhuli, S., Anamalamudi, S., Cenkeramaddi, L.R.: Generalization of relative change in a centrality measure to identify vital nodes in complex networks. IEEE Access 11, 808\u2013824 (2022)","journal-title":"IEEE Access"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-025-04145-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00371-025-04145-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-025-04145-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T08:46:03Z","timestamp":1760085963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00371-025-04145-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,22]]},"references-count":72,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["4145"],"URL":"https:\/\/doi.org\/10.1007\/s00371-025-04145-8","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"type":"print","value":"0178-2789"},{"type":"electronic","value":"1432-2315"}],"subject":[],"published":{"date-parts":[[2025,8,22]]},"assertion":[{"value":"23 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 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"}}]}}