{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T02:30:47Z","timestamp":1763346647745,"version":"3.45.0"},"reference-count":50,"publisher":"Tech Science Press","issue":"3","license":[{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"content-version":"vor","delay-in-days":298,"URL":"https:\/\/doi.org\/10.32604\/TSP-CROSSMARKPOLICY"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CMC"],"published-print":{"date-parts":[[2025]]},"DOI":"10.32604\/cmc.2025.066534","type":"journal-article","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:13:27Z","timestamp":1760598807000},"page":"4687-4704","update-policy":"https:\/\/doi.org\/10.32604\/tsp-crossmarkpolicy","source":"Crossref","is-referenced-by-count":0,"title":["Cluster Overlap as Objective Function"],"prefix":"10.32604","volume":"85","author":[{"given":"Pasi","family":"Fr\u00e4nti","sequence":"first","affiliation":[]},{"given":"Claude","family":"Cariou","sequence":"additional","affiliation":[]},{"given":"Qinpei","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"17807","published-online":{"date-parts":[[2025]]},"reference":[{"key":"ref1","first-page":"768","article-title":"Cluster analysis of multivariate data: efficiency vs. interpretability of classification","volume":"21","author":"Forgy","year":"1965","journal-title":"Biometrics"},{"key":"ref2","series-title":"Berkeley Symposium on Mathematical Statistics and Probability; 1965 Jun 21\u2013Jul 18","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","author":"MacQueen"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least squares quantization in PCM","volume":"28","author":"Lloyd","year":"1982","journal-title":"IEEE Trans Inf Theory"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1093\/comjnl\/40.9.547","article-title":"Genetic algorithms for large-scale clustering problems","volume":"40","author":"Fr\u00e4nti","year":"1997","journal-title":"Comput J"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1186\/s40537-018-0122-y","article-title":"Efficiency of random swap clustering","volume":"5","author":"Fr\u00e4nti","year":"2018","journal-title":"J Big Data"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"3376","DOI":"10.1016\/j.patcog.2014.03.034","article-title":"K-means: clustering by gradual data transformation","volume":"47","author":"Malinen","year":"2014","journal-title":"Pattern Recognit"},{"key":"ref7","unstructured":"Fritzke B. Breathing k-means. arXiv:2006.15666. 2020."},{"key":"ref8","doi-asserted-by":"crossref","first-page":"107713","DOI":"10.1016\/j.patcog.2020.107713","article-title":"A simulated annealing algorithm with a dual perturbation method for clustering","volume":"112","author":"Lee","year":"2021","journal-title":"Pattern Recognit"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1109\/TEVC.2022.3144134","article-title":"Recombinator-k-means: an evolutionary algorithm that exploits k-means for recombination","volume":"26","author":"Baldassi","year":"2022","journal-title":"IEEE Trans Evol Comput"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"107730","DOI":"10.1016\/j.patcog.2020.107730","article-title":"Averaging GPS segments competition 2019","volume":"112","author":"Fr\u00e4nti","year":"2021","journal-title":"Pattern Recognit"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ins.2012.06.018","article-title":"Clustering by analytic functions","volume":"217","author":"Malinen","year":"2012","journal-title":"Inf Sci"},{"key":"ref12","first-page":"2371","volume":"44","author":"Nie","year":"2022","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref13","first-page":"4875","article-title":"Coordinate descent K-means algorithm based on split-merge","volume":"81","author":"Qu","year":"2024","journal-title":"Comput Mater Contin"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","article-title":"Hierarchical grouping to optimize an objective function","volume":"58","author":"Ward","year":"1963","journal-title":"J Am Stat Assoc"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1109\/29.35395","article-title":"A new vector quantization clustering algorithm","volume":"37","author":"Equitz","year":"1989","journal-title":"IEEE Trans Acoust Speech Signal Process"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1109\/83.563327","article-title":"On the computational complexity of the LBG and PNN algorithms","volume":"6","author":"Shanbehzadeh","year":"1997","journal-title":"IEEE Trans Image Process"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1109\/83.841516","article-title":"Fast and memory efficient implementation of the exact PNN","volume":"9","author":"Fr\u00e4nti","year":"2000","journal-title":"IEEE Trans Image Process"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"1875","DOI":"10.1109\/TPAMI.2006.227","article-title":"Fast agglomerative clustering using a k-nearest neighbor graph","volume":"28","author":"Fr\u00e4nti","year":"2006","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"Shi","year":"2000","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1109\/43.159993","article-title":"New spectral methods for ratio cut partitioning and clustering","volume":"11","author":"Hagen","year":"1992","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"ref21","series-title":"Proceedings of the 19th International Conference on World Wide Web; 2010 Apr 26\u201330","first-page":"631","article-title":"Empirical comparison of algorithms for network community detection","author":"Leskovec"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys Rev E"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10115-021-01623-y","article-title":"Adapting k-means for graph clustering","volume":"64","author":"Sieranoja","year":"2022","journal-title":"Knowl Inf Syst"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/3321386","article-title":"Hierarchical clustering: objective functions and algorithms","volume":"66","author":"Cohen-Addad","year":"2019","journal-title":"J ACM"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"791519860","DOI":"10.1080\/03610917408548446","article-title":"A dendrite method for cluster analysis","volume":"3","author":"Calinski","year":"1974","journal-title":"Commun Stat Simul Comput"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","article-title":"Silhouettes: a graphical aid to the interpretation and validation of cluster analysis","volume":"20","author":"Rousseeuw","year":"1987","journal-title":"J Comput Appl Math"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.datak.2014.07.008","article-title":"WB-index: a sum-of-squares based index for cluster validity","volume":"92","author":"Zhao","year":"2014","journal-title":"Data Knowl Eng"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"105","DOI":"10.3390\/a10030105","article-title":"Comparison of internal clustering validation indices for prototype-based clustering","volume":"10","author":"H\u00e4m\u00e4l\u00e4inen","year":"2017","journal-title":"Algorithms"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3934\/aci.2023006","article-title":"All-pairwise squared distances lead to more balanced clustering","volume":"3","author":"Malinen","year":"2023","journal-title":"Appl Comput Intell"},{"key":"ref30","first-page":"657","article-title":"Nearest neighbor clustering: a baseline method for consistent clustering with arbitrary objective functions","volume":"10","author":"Bubeck","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","article-title":"NP-hardness of Euclidean sum-of-squares clustering","volume":"75","author":"Aloise","year":"2009","journal-title":"Mach Learn"},{"key":"ref32","doi-asserted-by":"crossref","unstructured":"Beyer K, Goldstein J, Ramakrishnan R, Shaft U. When is \u201cnearest neighbor\u201d meaningful? In: International Conference on Database Theory; 1999 Jan 10\u201312; Jerusalem, Israel. Berlin\/Heidelberg, Germany: Springer; 1999. p. 217\u201335. doi:10.1007\/3-540-49257-7_15.","DOI":"10.1007\/3-540-49257-7_15"},{"key":"ref33","series-title":"International Conference on Database Theory (ICDT\u201901); 2001 Jan 4\u20136","first-page":"420","article-title":"On the surprising behavior of distance metrics in high dimensional space","author":"Aggarwal","year":"2001"},{"journal-title":"Dynamic local search algorithm for the clustering problem","year":"2002","author":"K\u00e4rkk\u00e4inen","key":"ref34"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"4743","DOI":"10.1007\/s10489-018-1238-7","article-title":"K-means properties on six clustering benchmark datasets","volume":"48","author":"Fr\u00e4nti","year":"2018","journal-title":"Appl Intell"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"107874","DOI":"10.1016\/j.patcog.2021.107874","article-title":"Mean-shift outlier detection and filtering","volume":"115","author":"Yang","year":"2021","journal-title":"Pattern Recognit"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/j.patrec.2019.10.019","article-title":"Fast and general density peaks clustering","volume":"128","author":"Sieranoja","year":"2019","journal-title":"Pattern Recognit Lett"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1186\/1471-2105-8-3","article-title":"FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data","volume":"8","author":"Fu","year":"2007","journal-title":"BMC Bioinform"},{"key":"ref39","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/1217299.1217303","article-title":"Clustering aggregation","volume":"1","author":"Gionis","year":"2007","journal-title":"ACM Trans Knowl Discov Data"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/j.patcog.2005.09.012","article-title":"Iterative shrinking method for clustering problems","volume":"39","author":"Fr\u00e4nti","year":"2006","journal-title":"Pattern Recognit"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"2173","DOI":"10.1109\/TKDE.2016.2551240","article-title":"Set matching measures for external cluster validity","volume":"28","author":"Rezaei","year":"2016","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1009783824328","article-title":"BIRCH: a new data clustering algorithm and its applications","volume":"1","author":"Zhang","year":"1997","journal-title":"Data Min Knowl Discov"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.patcog.2019.04.014","article-title":"How much can k-means be improved by using better initialization and repeats?","volume":"93","author":"Fr\u00e4nti","year":"2019","journal-title":"Pattern Recognit"},{"article-title":"K-means++: the advantages of careful seeding","series-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA\u201907); 2007 Jan 7\u20139","author":"Arthur","key":"ref44"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Machine learning. Clustering by fast search and find of density peaks","volume":"344","author":"Rodriguez","year":"2014","journal-title":"Science"},{"key":"ref46","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"Ester","year":"1996","journal-title":"KDD"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3068335","article-title":"DBSCAN revisited, revisited: why and how you should (still) use DBSCAN","volume":"42","author":"Schubert","year":"2017","journal-title":"ACM Trans Database Syst"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","article-title":"A tutorial on spectral clustering","volume":"17","author":"von Luxburg","year":"2007","journal-title":"Stat Comput"},{"key":"ref49","doi-asserted-by":"crossref","first-page":"24","DOI":"10.3934\/aci.2024003","article-title":"Clustering accuracy","volume":"4","author":"Fr\u00e4nti","year":"2024","journal-title":"Appl Comput Intell"},{"key":"ref50","doi-asserted-by":"crossref","first-page":"3034","DOI":"10.1016\/j.patcog.2014.03.017","article-title":"Centroid index: cluster level similarity measure","volume":"47","author":"Fr\u00e4nti","year":"2014","journal-title":"Pattern Recognit"}],"container-title":["Computers, Materials & Continua"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/cdn.techscience.cn\/files\/cmc\/2025\/TSP_CMC-85-3\/TSP_CMC_66534\/TSP_CMC_66534.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T02:27:21Z","timestamp":1763346441000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.techscience.com\/cmc\/v85n3\/64138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":50,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025]]},"published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.32604\/cmc.2025.066534","relation":{},"ISSN":["1546-2226"],"issn-type":[{"type":"electronic","value":"1546-2226"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"2025-04-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-26","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-23","order":2,"name":"published","label":"Published Online","group":{"name":"publication_history","label":"Publication History"}}]}}