{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:30Z","timestamp":1740122670613,"version":"3.37.3"},"reference-count":80,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T00:00:00Z","timestamp":1680739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T00:00:00Z","timestamp":1680739200000},"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":["62202192"],"award-info":[{"award-number":["62202192"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Special Project for Knowledge Innovation of Hubei Province","award":["2022013301015175"],"award-info":[{"award-number":["2022013301015175"]}]}],"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-04580-x","type":"journal-article","created":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T12:04:27Z","timestamp":1680782667000},"page":"20346-20364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-start local search algorithm based on a novel objective function for clustering analysis"],"prefix":"10.1007","volume":"53","author":[{"given":"Xiaolu","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenhan","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaming","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0618-4969","authenticated-orcid":false,"given":"Junwen","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,6]]},"reference":[{"issue":"11","key":"4580_CR1","doi-asserted-by":"crossref","first-page":"4047","DOI":"10.1007\/s10489-018-1190-6","volume":"48","author":"LM Abualigah","year":"2018","unstructured":"Abualigah LM, Khader AT, Hanandeh ES (2018) Hybrid clustering analysis using improved krill herd algorithm. Appl Intell 48(11):4047\u20134071","journal-title":"Appl Intell"},{"issue":"1","key":"4580_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10618-005-1396-1","volume":"11","author":"R Agrawal","year":"2005","unstructured":"Agrawal R, Gehrke J, Gunopulos D et al (2005) Automatic subspace clustering of high dimensional data. Data Min Knowl Disc 11(1):5\u201333","journal-title":"Data Min Knowl Disc"},{"key":"4580_CR3","unstructured":"Aljalbout E, Golkov V, Siddiqui Y et al (2018) Clustering with deep learning: taxonomy and new methods. arXiv:180107648"},{"issue":"2","key":"4580_CR4","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s10115-019-01358-x","volume":"62","author":"I Aljarah","year":"2020","unstructured":"Aljarah I, Mafarja M, Heidari AA et al (2020) Clustering analysis using a novel locality-informed grey wolf-inspired clustering approach. Knowl Inf Syst 62(2):507\u2013539","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"4580_CR5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D Aloise","year":"2009","unstructured":"Aloise D, Deshpande A, Hansen P et al (2009) NP-Hardness of euclidean sum-of-squares clustering. Mach Learn 75(2):245\u2013248","journal-title":"Mach Learn"},{"key":"4580_CR6","doi-asserted-by":"crossref","first-page":"107,869","DOI":"10.1016\/j.patcog.2021.107869","volume":"114","author":"M Alshammari","year":"2021","unstructured":"Alshammari M, Stavrakakis J, Takatsuka M (2021) Refining a k-nearest neighbor graph for a computationally efficient spectral clustering. Pattern Recog 114:107,869","journal-title":"Pattern Recog"},{"key":"4580_CR7","doi-asserted-by":"crossref","unstructured":"Amini A, Wah TY, Saybani MR et al (2011) A study of density-grid based clustering algorithms on data streams. In: 2011 Eighth international conference on fuzzy systems and knowledge discovery (FSKD), IEEE, pp 1652\u20131656","DOI":"10.1109\/FSKD.2011.6019867"},{"issue":"2","key":"4580_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/304181.304187","volume":"28","author":"M Ankerst","year":"1999","unstructured":"Ankerst M, Breunig MM, Kriegel HP et al (1999) Optics: ordering points to identify the clustering structure. ACM Sigmod Record 28(2):49\u201360","journal-title":"ACM Sigmod Record"},{"key":"4580_CR9","doi-asserted-by":"crossref","unstructured":"Ashraf FB, Matin A, Shafi MSR et al (2021) An improved k-means clustering algorithm for multi-dimensional multi-cluster data using meta-heuristics. In: 2021 24th International conference on computer and information technology (ICCIT), IEEE, pp 1-6","DOI":"10.1109\/ICCIT54785.2021.9689836"},{"key":"4580_CR10","unstructured":"Bateni MH, Behnezhad S, Derakhshan M et al (2017) Affinity clustering: hierarchical clustering at scale. In: Proceedings of the 31st International conference on neural information processing systems, pp 6867\u20136877"},{"issue":"7","key":"4580_CR11","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/S0378-7206(02)00093-9","volume":"40","author":"E Bendoly","year":"2003","unstructured":"Bendoly E (2003) Theory and support for process frameworks of knowledge discovery and data mining from ERP systems. Inf Manag 40(7):639\u2013647","journal-title":"Inf Manag"},{"key":"4580_CR12","doi-asserted-by":"crossref","unstructured":"Brown D, Japa A, Shi Y (2019) A fast density-grid based clustering method. In: 2019 IEEE 9Th annual computing and communication workshop and conference (CCWC), IEEE, pp 0048\u20130054","DOI":"10.1109\/CCWC.2019.8666548"},{"issue":"4","key":"4580_CR13","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10732-015-9285-2","volume":"21","author":"B Cao","year":"2015","unstructured":"Cao B, Glover F, Rego C (2015) A tabu search algorithm for cohesive clustering problems. J Heuristics 21(4):457\u2013477","journal-title":"J Heuristics"},{"issue":"1","key":"4580_CR14","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.eswa.2012.07.021","volume":"40","author":"ME Celebi","year":"2013","unstructured":"Celebi ME, Kingravi HA, Vela PA (2013) A comparative study of efficient initialization methods for the K-means clustering algorithm. Expert Syst Appl 40(1):200\u2013210","journal-title":"Expert Syst Appl"},{"issue":"2","key":"4580_CR15","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","volume":"3","author":"DL Davies","year":"1979","unstructured":"Davies DL, Bouldin DW (1979) A cluster separation measure. IEEE Trans Pattern Anal Mach Intell 3(2):224\u2013227","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"4580_CR16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.simpat.2015.03.007","volume":"54","author":"R Duwairi","year":"2015","unstructured":"Duwairi R, Abu-Rahmeh M (2015) A novel approach for initializing the spherical K-means clustering algorithm. Simul Model Pract Theory 54:49\u201363","journal-title":"Simul Model Pract Theory"},{"key":"4580_CR17","unstructured":"Ester M, Kriegel HP, Sander J et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the AAAI conference on artificial intelligence, pp 226\u2013231"},{"issue":"6","key":"4580_CR18","doi-asserted-by":"crossref","first-page":"2215","DOI":"10.1109\/TCYB.2018.2822552","volume":"49","author":"C Fahy","year":"2018","unstructured":"Fahy C, Yang S, Gongora M (2018) Ant colony stream clustering: a fast density clustering algorithm for dynamic data streams. IEEE Trans Cybern 49(6):2215\u20132228","journal-title":"IEEE Trans Cybern"},{"issue":"7","key":"4580_CR19","doi-asserted-by":"crossref","first-page":"2095","DOI":"10.1007\/s00521-015-1998-5","volume":"31","author":"J Fan","year":"2019","unstructured":"Fan J (2019) Ope-hca: an optimal probabilistic estimation approach for hierarchical clustering algorithm. Neural Comput Applic 31(7):2095\u20132105","journal-title":"Neural Comput Applic"},{"issue":"12","key":"4580_CR20","doi-asserted-by":"crossref","first-page":"4743","DOI":"10.1007\/s10489-018-1238-7","volume":"48","author":"P Fr\u00e4nti","year":"2018","unstructured":"Fr\u00e4nti P, Sieranoja S (2018) K-means properties on six clustering benchmark datasets. Appl Intell 48(12):4743\u20134759","journal-title":"Appl Intell"},{"issue":"5814","key":"4580_CR21","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Science 315 (5814):972\u2013976","journal-title":"Science"},{"issue":"1","key":"4580_CR22","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/1217299.1217303","volume":"1","author":"A Gionis","year":"2007","unstructured":"Gionis A, Mannila H, Tsaparas P (2007) Clustering aggregation. ACM Trans Knowl Discov Data 1(1):4\u201314","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"22","key":"4580_CR23","doi-asserted-by":"crossref","first-page":"6571","DOI":"10.1007\/s00500-016-2369-6","volume":"21","author":"F Glover","year":"2017","unstructured":"Glover F (2017) Pseudo-centroid clustering. Soft Comput 21(22):6571\u20136592","journal-title":"Soft Comput"},{"issue":"2","key":"4580_CR24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/276305.276312","volume":"27","author":"S Guha","year":"1998","unstructured":"Guha S, Rastogi R, Shim K (1998) Cure: an efficient clustering algorithm for large databases. ACM Sigmod Record 27(2):73\u201384","journal-title":"ACM Sigmod Record"},{"key":"4580_CR25","doi-asserted-by":"crossref","unstructured":"Guo X, Gao L, Liu X et al (2017) Improved deep embedded clustering with local structure preservation. In: The 26th International joint conference on artificial intelligence (IJCAI), pp 1753\u20131759","DOI":"10.24963\/ijcai.2017\/243"},{"issue":"1","key":"4580_CR26","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan JA, Wong MA (1979) Algorithm as 136: a K-means clustering algorithm. J R Stat Soc Ser C (Appl Stat) 28(1):100\u2013108","journal-title":"J R Stat Soc Ser C (Appl Stat)"},{"issue":"5","key":"4580_CR27","doi-asserted-by":"crossref","first-page":"1460","DOI":"10.1109\/TCYB.2017.2702343","volume":"48","author":"D Huang","year":"2017","unstructured":"Huang D, Wang CD, Lai JH (2017) Locally weighted ensemble clustering. IEEE Trans Cybern 48(5):1460\u20131473","journal-title":"IEEE Trans Cybern"},{"issue":"6","key":"4580_CR28","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1109\/TKDE.2019.2903410","volume":"32","author":"D Huang","year":"2019","unstructured":"Huang D, Wang CD, Wu JS et al (2019) Ultra-scalable spectral clustering and ensemble clustering. IEEE Trans Knowl Data Eng 32(6):1212\u20131226","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"4580_CR29","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain AK (2010) Data clustering: 50 years beyond K-means. Pattern Recogn Lett 31(8):651\u2013666","journal-title":"Pattern Recogn Lett"},{"issue":"12","key":"4580_CR30","doi-asserted-by":"crossref","first-page":"2577","DOI":"10.1002\/bip.360221211","volume":"22","author":"W Kabsch","year":"1983","unstructured":"Kabsch W, Sander C (1983) Dictionary of protein secondary structure: pattern recognition of hydrogen-bonded and geometrical features. Biopolymers: Original Res Biomol 22(12):2577\u20132637","journal-title":"Biopolymers: Original Res Biomol"},{"issue":"7","key":"4580_CR31","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo T, Mount DM, Netanyahu NS et al (2002) An efficient K-means clustering algorithm: analysis and implementation. IEEE Trans Pattern Anal Mach Intell 24(7):881\u2013892","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"4580_CR32","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1109\/83.660995","volume":"7","author":"DA Langan","year":"1998","unstructured":"Langan DA, Modestino JW, Zhang J (1998) Cluster validation for unsupervised stochastic model-based image segmentation. IEEE Trans Image Process 7(2):180\u2013195","journal-title":"IEEE Trans Image Process"},{"key":"4580_CR33","doi-asserted-by":"crossref","first-page":"107,206","DOI":"10.1016\/j.patcog.2020.107206","volume":"102","author":"H Li","year":"2020","unstructured":"Li H, Liu X, Li T et al (2020) A novel density-based clustering algorithm using nearest neighbor graph. Pattern Recog 102:107,206","journal-title":"Pattern Recog"},{"issue":"2","key":"4580_CR34","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","volume":"36","author":"A Likas","year":"2003","unstructured":"Likas A, Vlassis N, Verbeek JJ (2003) The global K-means clustering algorithm. Pattern Recogn 36(2):451\u2013461","journal-title":"Pattern Recogn"},{"key":"4580_CR35","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.ins.2018.03.031","volume":"450","author":"R Liu","year":"2018","unstructured":"Liu R, Wang H, Yu X (2018) Shared-nearest-neighbor-based clustering by fast search and find of density peaks. Inf Sci 450:200\u2013226","journal-title":"Inf Sci"},{"issue":"2","key":"4580_CR36","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd S (1982) Least squares quantization in PCM. IEEE Trans Inf Theory 28(2):129\u2013137","journal-title":"IEEE Trans Inf Theory"},{"issue":"5","key":"4580_CR37","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1007\/s10732-016-9315-8","volume":"22","author":"H Meyerhenke","year":"2016","unstructured":"Meyerhenke H, Sanders P, Schulz C (2016) Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering. J Heuristics 22(5):759\u2013782","journal-title":"J Heuristics"},{"issue":"11","key":"4580_CR38","doi-asserted-by":"crossref","first-page":"4857","DOI":"10.1109\/TNNLS.2019.2958324","volume":"31","author":"X Peng","year":"2019","unstructured":"Peng X, Zhu H, Feng J et al (2019) Deep clustering with sample-assignment invariance prior. IEEE Trans Neural Netw Learn Syst 31(11):4857\u20134868","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"4580_CR39","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.ins.2022.08.047","volume":"610","author":"S Pourbahrami","year":"2022","unstructured":"Pourbahrami S, Hashemzadeh M (2022) A geometric-based clustering method using natural neighbors. Inf Sci 610:694\u2013706","journal-title":"Inf Sci"},{"issue":"23","key":"4580_CR40","doi-asserted-by":"crossref","first-page":"11,202","DOI":"10.3390\/app112311202","volume":"11","author":"X Ran","year":"2021","unstructured":"Ran X, Zhou X, Lei M et al (2021) A novel K-means clustering algorithm with a noise algorithm for capturing urban hotspots. Appl Sci 11(23):11,202","journal-title":"Appl Sci"},{"issue":"20","key":"4580_CR41","doi-asserted-by":"crossref","first-page":"10,546","DOI":"10.1093\/nar\/gky889","volume":"46","author":"N Rappoport","year":"2018","unstructured":"Rappoport N, Shamir R (2018) Multi-omic and multi-view clustering algorithms: review and cancer benchmark. Nucleic Acids Res 46(20):10,546\u201310,562","journal-title":"Nucleic Acids Res"},{"key":"4580_CR42","doi-asserted-by":"crossref","first-page":"106,672","DOI":"10.1016\/j.knosys.2020.106672","volume":"213","author":"MJ Rezaee","year":"2021","unstructured":"Rezaee MJ, Eshkevari M, Saberi M et al (2021) GBK-Means clustering algorithm: an improvement to the K-means algorithm based on the bargaining game. Knowl-Based Syst 213:106,672","journal-title":"Knowl-Based Syst"},{"issue":"8","key":"4580_CR43","doi-asserted-by":"crossref","first-page":"2173","DOI":"10.1109\/TKDE.2016.2551240","volume":"28","author":"M Rezaei","year":"2016","unstructured":"Rezaei M, Fr\u00e4nti P (2016) Set matching measures for external cluster validity. IEEE Trans Knowl Data Eng 28(8):2173\u20132186","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6191","key":"4580_CR44","doi-asserted-by":"crossref","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\u20131496","journal-title":"Science"},{"issue":"1","key":"4580_CR45","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/MCI.2018.2881643","volume":"14","author":"EH Ruspini","year":"2019","unstructured":"Ruspini EH, Bezdek JC, Keller JM (2019) Fuzzy clustering: a historical perspective. IEEE Comput Intell Mag 14(1):45\u201355","journal-title":"IEEE Comput Intell Mag"},{"issue":"2","key":"4580_CR46","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1109\/TIT.1986.1057168","volume":"32","author":"M Sabin","year":"1986","unstructured":"Sabin M, Gray R (1986) Global convergence and empirical consistency of the generalized Lloyd algorithm. IEEE Trans Inf Theory 32(2):148\u2013155","journal-title":"IEEE Trans Inf Theory"},{"key":"4580_CR47","first-page":"825","volume":"6,100","author":"MJ Sedluk","year":"2000","unstructured":"Sedluk MJ, Miller JW (2000) Cluster-based data compression system and method. US Patent 6,100:825","journal-title":"US Patent"},{"issue":"4","key":"4580_CR48","first-page":"114,326","volume":"169","author":"KK Sharma","year":"2020","unstructured":"Sharma KK, Seal A (2020) Spectral embedded generalized mean based K-nearest neighbors clustering with S-distance. Expert Syst Appl 169(4):114,326","journal-title":"Expert Syst Appl"},{"issue":"3","key":"4580_CR49","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s007780050009","volume":"8","author":"G Sheikholeslami","year":"2000","unstructured":"Sheikholeslami G, Chatterjee S, Zhang A (2000) Wavecluster: a wavelet-based clustering approach for spatial data in very large databases. VLDB J 8(3):289\u2013304","journal-title":"VLDB J"},{"issue":"6","key":"4580_CR50","doi-asserted-by":"crossref","first-page":"2151","DOI":"10.1007\/s10489-018-1380-2","volume":"49","author":"Y Sheng","year":"2019","unstructured":"Sheng Y, Wang M, Wu T et al (2019) Adaptive local learning regularized nonnegative matrix factorization for data clustering. Appl Intell 49(6):2151\u20132168","journal-title":"Appl Intell"},{"issue":"4","key":"4580_CR51","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1007\/s10489-011-0295-y","volume":"36","author":"KS Shin","year":"2012","unstructured":"Shin KS, Jeong YS, Jeong MK (2012) A two-leveled symbiotic evolutionary algorithm for clustering problems. Appl Intell 36(4):788\u2013799","journal-title":"Appl Intell"},{"issue":"11","key":"4580_CR52","first-page":"33","volume":"8","author":"S Sieranoja","year":"2021","unstructured":"Sieranoja S, Fr\u00e4nti P (2021) Adapting K-means for graph clustering. Knowl Inf Syst 8 (11):33\u201347","journal-title":"Knowl Inf Syst"},{"issue":"Dec","key":"4580_CR53","first-page":"583","volume":"3","author":"A Strehl","year":"2002","unstructured":"Strehl A, Ghosh J (2002) Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3(Dec):583\u2013617","journal-title":"J Mach Learn Res"},{"key":"4580_CR54","doi-asserted-by":"crossref","unstructured":"Sun G, Cong Y, Wang Q et al (2020) Lifelong spectral clustering. In: Proceedings of the AAAI conference on artificial intelligence, pp 5867\u20135874","DOI":"10.1609\/aaai.v34i04.6045"},{"key":"4580_CR55","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.knosys.2019.01.026","volume":"170","author":"X Tao","year":"2019","unstructured":"Tao X, Wang R, Chang R et al (2019) Spectral clustering algorithm using density-sensitive distance measure with global and local consistencies. Knowl-Based Syst 170:26\u201342","journal-title":"Knowl-Based Syst"},{"key":"4580_CR56","unstructured":"Vassilvitskii S, Arthur D (2006) K-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, pp 1027\u20131035"},{"issue":"9","key":"4580_CR57","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1109\/TPAMI.2002.1033218","volume":"24","author":"CJ Veenman","year":"2002","unstructured":"Veenman CJ, Reinders MJT, Backer E (2002) A maximum variance cluster algorithm. IEEE Trans Pattern Anal Mach Intell 24(9):1273\u20131280","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"4580_CR58","doi-asserted-by":"crossref","unstructured":"Virmajoki O, Franti P, Kaukoranta T (2002) Iterative shrinking method for generating clustering. In: Proceedings of international conference on image processing, IEEE, pp 2\u201310","DOI":"10.1109\/ICIP.2002.1040043"},{"issue":"6","key":"4580_CR59","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1109\/TKDE.2019.2903810","volume":"32","author":"H Wang","year":"2019","unstructured":"Wang H, Yang Y, Liu B (2019a) Gmc: graph-based multi-view clustering. IEEE Trans Knowl Data Eng 32(6):1116\u20131129","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4580_CR60","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1016\/j.knosys.2018.10.022","volume":"163","author":"H Wang","year":"2019","unstructured":"Wang H, Yang Y, Liu B et al (2019b) A study of graph-based system for multi-view clustering. Knowl-Based Syst 163:1009\u20131019","journal-title":"Knowl-Based Syst"},{"issue":"4","key":"4580_CR61","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10462-016-9488-4","volume":"47","author":"TS Wang","year":"2017","unstructured":"Wang TS, Lin HT, Wang P (2017) Weighted-spectral clustering algorithm for detecting community structures in complex networks. Artif Intell Rev 47(4):463\u2013483","journal-title":"Artif Intell Rev"},{"key":"4580_CR62","unstructured":"Wang W, Yang J, Muntz R et al (1997) Sting: a statistical information grid approach to spatial data mining. In: The VLDB journal, pp 186\u2013195"},{"key":"4580_CR63","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.asoc.2017.12.004","volume":"64","author":"Y Wang","year":"2018","unstructured":"Wang Y, Duan X, Liu X et al (2018) A spectral clustering method with semantic interpretation based on axiomatic fuzzy set theory. Appl Soft Comput 64:59\u201374","journal-title":"Appl Soft Comput"},{"issue":"4","key":"4580_CR64","doi-asserted-by":"crossref","first-page":"1620","DOI":"10.1109\/TII.2016.2628747","volume":"13","author":"B Wu","year":"2016","unstructured":"Wu B, Wilamowski BM (2016) A fast density and grid based clustering method for data with arbitrary shapes and noise. IEEE Trans Ind Inf 13(4):1620\u20131628","journal-title":"IEEE Trans Ind Inf"},{"key":"4580_CR65","doi-asserted-by":"crossref","first-page":"105,763","DOI":"10.1016\/j.asoc.2019.105763","volume":"84","author":"H Xie","year":"2019","unstructured":"Xie H, Zhang L, Lim CP et al (2019) Improving K-means clustering with enhanced firefly algorithms. Appl Soft Comput 84:105,763","journal-title":"Appl Soft Comput"},{"key":"4580_CR66","unstructured":"Xie J, Girshick R, Farhadi A (2016) Unsupervised deep embedding for clustering analysis. In: International conference on machine learning, pp 478\u2013487"},{"key":"4580_CR67","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.ins.2016.08.086","volume":"373","author":"J Xu","year":"2016","unstructured":"Xu J, Wang G, Deng W (2016) Denpehc: density peak based efficient hierarchical clustering. Inf Sci 373:200\u2013218","journal-title":"Inf Sci"},{"key":"4580_CR68","doi-asserted-by":"crossref","first-page":"113,367","DOI":"10.1016\/j.eswa.2020.113367","volume":"151","author":"Q Xu","year":"2020","unstructured":"Xu Q, Zhang Q, Liu J et al (2020) Efficient synthetical clustering validity indexes for hierarchical clustering. Expert Syst Appl 151:113,367","journal-title":"Expert Syst Appl"},{"key":"4580_CR69","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.knosys.2018.05.034","volume":"158","author":"X Xu","year":"2018","unstructured":"Xu X, Ding S, Shi Z (2018) An improved density peaks clustering algorithm with fast finding cluster centers. Knowl-Based Syst 158:65\u201374","journal-title":"Knowl-Based Syst"},{"key":"4580_CR70","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.ins.2020.11.050","volume":"554","author":"X Xu","year":"2021","unstructured":"Xu X, Ding S, Wang Y et al (2021) A fast density peaks clustering algorithm with sparse search. Inf Sci 554:61\u201383","journal-title":"Inf Sci"},{"issue":"17","key":"4580_CR71","doi-asserted-by":"crossref","first-page":"2735","DOI":"10.3390\/electronics11172735","volume":"11","author":"L Yin","year":"2022","unstructured":"Yin L, Li M, Chen H et al (2022) An improved hierarchical clustering algorithm based on the idea of population reproduction and fusion. Electronics 11(17):2735","journal-title":"Electronics"},{"issue":"5","key":"4580_CR72","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1016\/S0031-3203(01)00105-4","volume":"35","author":"HW Yoo","year":"2002","unstructured":"Yoo HW, Jung SH, Jang DS et al (2002) Extraction of major object features using VQ clustering for content-based image retrieval. Pattern Recogn 35(5):1115\u20131126","journal-title":"Pattern Recogn"},{"issue":"1","key":"4580_CR73","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TPAMI.2018.2877660","volume":"42","author":"C Zhang","year":"2018","unstructured":"Zhang C, Fu H, Hu Q et al (2018a) Generalized latent multi-view subspace clustering. IEEE Trans Pattern Anal Mach Intell 42(1):86\u201399","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"4580_CR74","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"T Zhang","year":"1996","unstructured":"Zhang T, Ramakrishnan R, Livny M (1996) Birch: an efficient data clustering method for very large databases. ACM Sigmod Record 25(2):103\u2013114","journal-title":"ACM Sigmod Record"},{"issue":"2","key":"4580_CR75","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1009783824328","volume":"1","author":"T Zhang","year":"1997","unstructured":"Zhang T, Ramakrishnan R, Livny M (1997) Birch: a new data clustering algorithm and its applications. Data Min Knowl Disc 1(2):141\u2013182","journal-title":"Data Min Knowl Disc"},{"key":"4580_CR76","doi-asserted-by":"crossref","unstructured":"Zhang W, Zang W (2018) A fuzzy density peaks clustering algorithm based on improved DNA genetic algorithm and K-nearest neighbors. In: International conference on intelligent science and big data engineering, Springer, pp 476\u2013487","DOI":"10.1007\/978-3-030-02698-1_42"},{"issue":"3","key":"4580_CR77","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1080\/00207721.2013.797037","volume":"46","author":"X Zhang","year":"2015","unstructured":"Zhang X, Xu Z (2015) Hesitant fuzzy agglomerative hierarchical clustering algorithms. Int J Syst Sci 46(3):562\u2013576","journal-title":"Int J Syst Sci"},{"issue":"7","key":"4580_CR78","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1109\/TPAMI.2018.2847335","volume":"41","author":"Z Zhang","year":"2018","unstructured":"Zhang Z, Liu L, Shen F et al (2018b) Binary multi-view clustering. IEEE Trans Pattern Anal Mach Intell 41(7):1774\u20131782","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"8","key":"4580_CR79","doi-asserted-by":"crossref","first-page":"1532","DOI":"10.1109\/TKDE.2018.2858782","volume":"31","author":"X Zhu","year":"2018","unstructured":"Zhu X, Zhang S, Li Y et al (2018) Low-rank sparse subspace for spectral clustering. IEEE Trans Knowl Data Eng 31(8):1532\u20131543","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4580_CR80","doi-asserted-by":"crossref","first-page":"107,175","DOI":"10.1016\/j.patcog.2019.107175","volume":"105","author":"X Zhu","year":"2020","unstructured":"Zhu X, Zhu Y, Zheng W (2020) Spectral rotation for deep one-step clustering. Pattern Recogn 105:107,175","journal-title":"Pattern Recogn"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04580-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04580-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04580-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T11:39:22Z","timestamp":1694777962000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04580-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,6]]},"references-count":80,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["4580"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04580-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2023,4,6]]},"assertion":[{"value":"17 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 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":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Ethics approval and consent to participate"}},{"value":"The authors declare that they have no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}