{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T18:40:02Z","timestamp":1758393602552,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T00:00:00Z","timestamp":1680566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T00:00:00Z","timestamp":1680566400000},"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":["61976158"],"award-info":[{"award-number":["61976158"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10489-023-04543-2","type":"journal-article","created":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T06:50:46Z","timestamp":1680677446000},"page":"20272-20292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A new clustering algorithm based on connectivity"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7476-7293","authenticated-orcid":false,"given":"Jiaqiang","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kesheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenpeng","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duoqian","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,4]]},"reference":[{"issue":"3","key":"4543_CR1","doi-asserted-by":"publisher","first-page":"1969","DOI":"10.1007\/s11280-019-00731-8","volume":"23","author":"X Zhu","year":"2020","unstructured":"Zhu X, Gan J, Lu G, Li J, Zhang S (2020) Spectral clustering via half-quadratic optimization. World Wide Web 23(3):1969\u20131988","journal-title":"World Wide Web"},{"key":"4543_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.neunet.2019.10.010","volume":"122","author":"Z Kang","year":"2020","unstructured":"Kang Z, Zhao X, Peng C, Zhu H, Zhou JT, Peng X, Chen W, Xu Z (2020) Partition level multiview subspace clustering. Neural Netw 122:279\u2013288","journal-title":"Neural Netw"},{"key":"4543_CR3","doi-asserted-by":"crossref","unstructured":"Belhaouari SB, Ahmed S, Mansour S (2014) Optimized k-means algorithm. Math Probl Eng 2014","DOI":"10.1155\/2014\/506480"},{"issue":"4","key":"4543_CR4","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s40745-018-0149-0","volume":"5","author":"M Ahmed","year":"2018","unstructured":"Ahmed M (2018) Collective anomaly detection techniques for network traffic analysis. Ann Data Sci 5(4):497\u2013512","journal-title":"Ann Data Sci"},{"issue":"14","key":"4543_CR5","first-page":"3","volume":"4","author":"M Ahmed","year":"2017","unstructured":"Ahmed M (2017) An unsupervised approach of knowledge discovery from big data in social network. EAI Endorsed Trans Scalable Inf Syst 4(14):3","journal-title":"EAI Endorsed Trans Scalable Inf Syst"},{"issue":"4","key":"4543_CR6","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s40745-018-0149-0","volume":"5","author":"M Ahmed","year":"2018","unstructured":"Ahmed M (2018) Collective anomaly detection techniques for network traffic analysis. Ann Data Sci 5(4):497\u2013512","journal-title":"Ann Data Sci"},{"issue":"9","key":"4543_CR7","doi-asserted-by":"publisher","first-page":"1843","DOI":"10.3390\/app9091843","volume":"9","author":"S Tondini","year":"2019","unstructured":"Tondini S, Castellan C, Medina MA, Pavesi L (2019) Automatic initialization methods for photonic components on a silicon-based optical switch. Appl Sci 9(9):1843","journal-title":"Appl Sci"},{"key":"4543_CR8","doi-asserted-by":"crossref","unstructured":"Zhang X, He Y, Jin Y, Qin H, Azhar M, Huang JZ (2020) A robust k-means clustering algorithm based on observation point mechanism. Complexity 2020","DOI":"10.1155\/2020\/3650926"},{"issue":"1","key":"4543_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1026110926707","volume":"123","author":"TS Hale","year":"2003","unstructured":"Hale TS, Moberg CR (2003) Location science research: a review. Ann Oper Res 123(1):21\u201335","journal-title":"Ann Oper Res"},{"issue":"3","key":"4543_CR10","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12(3):450\u2013459","journal-title":"Oper Res"},{"issue":"3","key":"4543_CR11","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. i: the p-centers. SIAM J Appl Math 37(3):513\u2013538","journal-title":"SIAM J Appl Math"},{"key":"4543_CR12","first-page":"246","volume":"21","author":"H Liao","year":"2022","unstructured":"Liao H, Hu J, Li T, Du S, Peng B (2022) Deep linear graph attention model for attributed graph clustering. Knowl-Based Syst 21:246","journal-title":"Knowl-Based Syst"},{"key":"4543_CR13","doi-asserted-by":"publisher","first-page":"108501","DOI":"10.1016\/j.knosys.2022.108501","volume":"243","author":"W Guo","year":"2022","unstructured":"Guo W, Wang W, Zhao S, Niu Y, Zhang Z, Liu X (2022) Density peak clustering with connectivity estimation. Knowl-Based Syst 243:108501","journal-title":"Knowl-Based Syst"},{"key":"4543_CR14","doi-asserted-by":"crossref","unstructured":"Hadi AS (2022) A new distance between multivariate clusters of varying locations, elliptical shapes, and directions. Pattern Recognition: The Journal of the Pattern Recognition Society 129","DOI":"10.1016\/j.patcog.2022.108780"},{"key":"4543_CR15","doi-asserted-by":"publisher","first-page":"107063","DOI":"10.1016\/j.patcog.2019.107063","volume":"98","author":"X Geng","year":"2020","unstructured":"Geng X, Tang H (2020) Clustering by connection center evolution. Pattern Recogn 98:107063","journal-title":"Pattern Recogn"},{"issue":"1","key":"4543_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0304-3975(98)00063-2","volume":"207","author":"G-H Lin","year":"1998","unstructured":"Lin G-H, Xue G (1998) K-center and k-median problems in graded distances. Theor Comput Sci 207(1):181\u2013192","journal-title":"Theor Comput Sci"},{"issue":"1","key":"4543_CR17","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/1024022","volume":"24","author":"J Hartmanis","year":"1982","unstructured":"Hartmanis J (1982) Computers and intractability: a guide to the theory of np-completeness (Michael R. Garey and David S. Johnson). Siam Review 24(1):90","journal-title":"Siam Review"},{"key":"4543_CR18","doi-asserted-by":"crossref","unstructured":"Rana R, Garg D (2009) Heuristic approaches for k-center problem. In: 2009 IEEE international advance computing conference, IEEE, pp 332\u2013335","DOI":"10.1109\/IADCC.2009.4809031"},{"issue":"6\u20137","key":"4543_CR19","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/j.comgeo.2010.01.001","volume":"43","author":"SA Friedler","year":"2010","unstructured":"Friedler SA, Mount DM (2010) Approximation algorithm for the kinetic robust k-center problem. Comput Geom 43(6\u20137):572\u2013586","journal-title":"Comput Geom"},{"key":"4543_CR20","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.cor.2018.11.006","volume":"103","author":"C Contardo","year":"2019","unstructured":"Contardo C, Iori M, Kramer R (2019) A scalable exact algorithm for the vertex p-center problem. Comput Oper Res 103:211\u2013220","journal-title":"Comput Oper Res"},{"issue":"3","key":"4543_CR21","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0166-218X(87)90029-1","volume":"17","author":"J Plesn\u00edk","year":"1987","unstructured":"Plesn\u00edk J (1987) A heuristic for the p-center problems in graphs. Discret Appl Math 17 (3):263\u2013268","journal-title":"Discret Appl Math"},{"key":"4543_CR22","first-page":"355","volume":"20","author":"DB Shmoys","year":"1995","unstructured":"Shmoys DB (1995) Computing near-optimal solutions to combinatorial optimization problems. Comb Optim 20:355\u2013397","journal-title":"Comb Optim"},{"issue":"6","key":"4543_CR23","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"ME Dyer","year":"1985","unstructured":"Dyer ME, B AMFA (1985) A simple heuristic for the p-centre problem. Oper Res Lett 3 (6):285\u2013288","journal-title":"Oper Res Lett"},{"key":"4543_CR24","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez TF (1985) Clustering to minimize the maximum intercluster distance. Theor Comput Sci 38:293\u2013306","journal-title":"Theor Comput Sci"},{"issue":"2","key":"4543_CR25","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS, Shmoys DB (1985) A best possible heuristic for the k-center problem. Math Oper Res 10(2):180\u2013184","journal-title":"Math Oper Res"},{"key":"4543_CR26","doi-asserted-by":"crossref","unstructured":"Charikar M, Li S (2012) A dependent lp-rounding approach for the k-median problem. In: International colloquium on automata, languages, and programming, Springer, pp 194\u2013205","DOI":"10.1007\/978-3-642-31594-7_17"},{"key":"4543_CR27","doi-asserted-by":"crossref","unstructured":"KAUFMAN L (1990) Finding groups in data. An Introduction to Cluster Analysis 230\u2013234","DOI":"10.1002\/9780470316801"},{"issue":"1","key":"4543_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jcss.2002.1882","volume":"65","author":"M Charikar","year":"2002","unstructured":"Charikar M, Guha S, Tardos \u00c9, Shmoys DB (2002) A constant-factor approximation algorithm for the k-median problem. J Comput Syst Sci 65(1):129\u2013149","journal-title":"J Comput Syst Sci"},{"issue":"2","key":"4543_CR29","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain K, Vazirani VV (2001) Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J ACM (JACM) 48(2):274\u2013 296","journal-title":"J ACM (JACM)"},{"key":"4543_CR30","doi-asserted-by":"crossref","unstructured":"Charikar M, Li S (2012) A dependent lp-rounding approach for the k-median problem. In: International colloquium on automata, languages, and programming, Springer, pp 194\u2013205","DOI":"10.1007\/978-3-642-31594-7_17"},{"issue":"2","key":"4543_CR31","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1137\/130938645","volume":"45","author":"S Li","year":"2016","unstructured":"Li S, Svensson O (2016) Approximating k-median via pseudo-approximation. SIAM J Comput 45(2):530\u2013547","journal-title":"SIAM J Comput"},{"issue":"2","key":"4543_CR32","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ipl.2005.09.009","volume":"97","author":"M Chrobak","year":"2006","unstructured":"Chrobak M, Kenyon C, Young N (2006) The reverse greedy algorithm for the metric k-median problem. Inf Process Lett 97(2):68\u201372","journal-title":"Inf Process Lett"},{"issue":"1","key":"4543_CR33","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/B:MACH.0000033115.78247.f0","volume":"56","author":"A Meyerson","year":"2004","unstructured":"Meyerson A, O\u2019callaghan L, Plotkin S (2004) A k-median algorithm with running time independent of data size. Mach Learn 56(1):61\u201387","journal-title":"Mach Learn"},{"issue":"3","key":"4543_CR34","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1137\/S0097539701383443","volume":"32","author":"RR Mettu","year":"2003","unstructured":"Mettu RR, Plaxton CG (2003) The online median problem. SIAM J Comput 32(3):816\u2013832","journal-title":"SIAM J Comput"},{"issue":"2-3","key":"4543_CR35","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.tcs.2006.05.015","volume":"361","author":"D Fotakis","year":"2006","unstructured":"Fotakis D (2006) Incremental algorithms for facility location and k-median. Theor Comput Sci 361(2-3):275\u2013313","journal-title":"Theor Comput Sci"},{"issue":"1-2","key":"4543_CR36","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(00)00026-0","volume":"74","author":"A Vigneron","year":"2000","unstructured":"Vigneron A, Gao L, Golin MJ, Italiano GF, Li B (2000) An algorithm for finding a k-median in a directed tree. Inf Process Lett 74(1-2):81\u201388","journal-title":"Inf Process Lett"},{"key":"4543_CR37","unstructured":"Macqueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proc. Fifth berkeley symposium on math. Stat. and prob"},{"issue":"2","key":"4543_CR38","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1145\/506147.506149","volume":"49","author":"R Ostrovsky","year":"2002","unstructured":"Ostrovsky R, Rabani Y (2002) Polynomial-time approximation schemes for geometric min-sum median clustering. J ACM (JACM) 49(2):139\u2013156","journal-title":"J ACM (JACM)"},{"issue":"2","key":"4543_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1667053.1667054","volume":"57","author":"A Kumar","year":"2010","unstructured":"Kumar A, Sabharwal Y, Sen S (2010) Linear-time approximation schemes for clustering problems in any dimensions. J ACM (JACM) 57(2):1\u201332","journal-title":"J ACM (JACM)"},{"issue":"11","key":"4543_CR40","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1109\/34.244673","volume":"15","author":"Z Wu","year":"1993","unstructured":"Wu Z, Leahy R (1993) An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Trans Pattern Anal Mach Intell 15(11):1101\u20131113","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"4543_CR41","doi-asserted-by":"publisher","first-page":"1969","DOI":"10.1007\/s11280-019-00731-8","volume":"23","author":"X Zhu","year":"2020","unstructured":"Zhu X, Gan J, Lu G, Li J, Zhang S (2020) Spectral clustering via half-quadratic optimization. World Wide Web 23(3):1969\u20131988","journal-title":"World Wide Web"},{"issue":"4","key":"4543_CR42","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416","journal-title":"Stat Comput"},{"issue":"1","key":"4543_CR43","doi-asserted-by":"publisher","first-page":"145","DOI":"10.3233\/IDA-140701","volume":"19","author":"J Wan","year":"2015","unstructured":"Wan J, Zhu Q, Lei D, Lu J (2015) Outlier detection based on transitive closure. Intell Data Anal 19(1):145\u2013160","journal-title":"Intell Data Anal"},{"key":"4543_CR44","unstructured":"Ester M, Kriegel HP, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. AAAI Press"},{"issue":"6","key":"4543_CR45","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/TKDE.2017.2787640","volume":"30","author":"A Bryant","year":"2018","unstructured":"Bryant A, Cios K (2018) Rnn-dbscan: a density-based clustering algorithm using reverse nearest neighbor density estimates. IEEE Trans Knowl Data Eng 30(6):1109\u20131121","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6191","key":"4543_CR46","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344 (6191):1492","journal-title":"Science"},{"issue":"2","key":"4543_CR47","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1109\/TKDE.2019.2930056","volume":"33","author":"D Cheng","year":"2021","unstructured":"Cheng D, Zhu Q, Huang J, Wu Q, Yang L (2021) Clustering with local density peaks-based minimum spanning tree. IEEE Trans Knowl Data Eng 33(2):374\u2013387","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4543_CR48","doi-asserted-by":"publisher","first-page":"116539","DOI":"10.1016\/j.eswa.2022.116539","volume":"195","author":"T Xu","year":"2022","unstructured":"Xu T, Jiang J (2022) A graph adaptive density peaks clustering algorithm for automatic centroid selection and effective aggregation. Expert Syst Appl 195:116539","journal-title":"Expert Syst Appl"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04543-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04543-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04543-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T11:38:37Z","timestamp":1694777917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04543-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,4]]},"references-count":48,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["4543"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04543-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2023,4,4]]},"assertion":[{"value":"24 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2023","order":2,"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 conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}}]}}