{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T13:55:35Z","timestamp":1775483735973,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T00:00:00Z","timestamp":1595548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T00:00:00Z","timestamp":1595548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad, Spain","doi-asserted-by":"crossref","award":["ECO2015-66593-P"],"award-info":[{"award-number":["ECO2015-66593-P"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Classif"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00357-020-09372-3","type":"journal-article","created":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T07:02:30Z","timestamp":1595574150000},"page":"232-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Initializing k-means Clustering by Bootstrap and Data Depth"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9183-8367","authenticated-orcid":false,"given":"Aurora","family":"Torrente","sequence":"first","affiliation":[]},{"given":"Juan","family":"Romo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,24]]},"reference":[{"issue":"2","key":"9372_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00357-017-9231-0","volume":"34","author":"D Aloise","year":"2017","unstructured":"Aloise, D., Damasceno, N. C., Mladenovi\u0107, N., & Pinheiro, D. N. (2017). On strategies to fix degenerate k-means solutions. Journal of Classification, 34(2), 165\u2013190.","journal-title":"Journal of Classification"},{"key":"9372_CR2","unstructured":"Arcones, M. A., & Gin\u00e9, E. (1992). On the bootstrap of M-estimators and other statistical functionals. In R. Lepage, & L. Billard (Eds.) Exploring the limits of the bootstrap (pp. 13\u201347). New York: Wiley."},{"key":"9372_CR3","unstructured":"Arthur, D., & Vassilvitskii, S. (2007). k-means++: the advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1027\u20131035)."},{"key":"9372_CR4","doi-asserted-by":"crossref","unstructured":"\u00c4yr\u00e4m\u00f6, S., K\u00e4rkk\u00e4inen, T., & Majava, K. (2007). Robust refinement of initial prototypes for partitioning-based clustering algorithms. In C.H. Skiadas (Ed.) Recent advances in stochastic modelling and data analysis (pp. 473\u2013482). Crete: World Scientific.","DOI":"10.1142\/9789812709691_0056"},{"key":"9372_CR5","unstructured":"Bradley, P. S., & Fayyad, U. (1998). Refining initial points for k-means clustering. In Proceedings of the 15th International Conference of Machine Learning (pp. 91\u201399)."},{"issue":"4","key":"9372_CR6","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1037\/1082-989X.9.4.510","volume":"9","author":"MJ Brusco","year":"2004","unstructured":"Brusco, M. J. (2004). Clustering binary data in the presence of masking variables. Psychological Methods, 9(4), 510\u2013523.","journal-title":"Psychological Methods"},{"key":"9372_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF02294838","volume":"66","author":"MJ Brusco","year":"2001","unstructured":"Brusco, M. J., & Cradit, J. D. (2001). A variable-selection heuristic for k-means clustering. Psychometrika, 66, 249\u2013270.","journal-title":"Psychometrika"},{"issue":"4","key":"9372_CR8","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.imavis.2010.10.002","volume":"29","author":"ME Celebi","year":"2011","unstructured":"Celebi, M. E. (2011). Improving the performance of k-means for color quantization. Image and Vision Computing, 29(4), 260\u2013271.","journal-title":"Image and Vision Computing"},{"issue":"1","key":"9372_CR9","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.eswa.2012.07.021","volume":"40","author":"ME Celebi","year":"2013","unstructured":"Celebi, M. E., Kingravi, H. A., & Vela, P. A. (2013). A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert Systems with Applications, 40(1), 200\u2013210.","journal-title":"Expert Systems with Applications"},{"key":"9372_CR10","doi-asserted-by":"crossref","unstructured":"Dolnicar, S., & Leisch, F. (2001). Behavioral market segmentation of binary guest survey data with bagged clustering. In B.H.H.K. Dorffner G (Ed.) Artificial neural networks ICANN 2001, volume 2130 of lecture notes in computer science (pp. 111\u2013118). Berlin: Springer.","DOI":"10.1007\/3-540-44668-0_16"},{"issue":"9","key":"9372_CR11","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1093\/bioinformatics\/btg038","volume":"19","author":"S Dudoit","year":"2003","unstructured":"Dudoit, S., & Fridlyand, J. (2003). Bagging to improve the accuracy of a clustering procedure. Bioinformatics, 19(9), 1090\u20131099.","journal-title":"Bioinformatics"},{"key":"9372_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.5815\/ijisa.2012.01.03","volume":"1","author":"M El Agha","year":"2012","unstructured":"El Agha, M., & Ashour, W. M. (2012). Efficient and fast initialization algorithm for k-means clustering. International Journal of Intelligent Systems and Applications, 1, 21\u201331.","journal-title":"International Journal of Intelligent Systems and Applications"},{"key":"9372_CR13","first-page":"768","volume":"21","author":"E Forgy","year":"1965","unstructured":"Forgy, E. (1965). Cluster analysis of multivariate data: efficiency vs interpretability of classifications. Biometrics, 21, 768\u2013780.","journal-title":"Biometrics"},{"issue":"6","key":"9372_CR14","doi-asserted-by":"publisher","first-page":"e0156576","DOI":"10.1371\/journal.pone.0156576","volume":"1","author":"C Garc\u00eda","year":"2016","unstructured":"Garc\u00eda, C. (2016). BoCluSt: bootstrap clustering stability algorithm for community detection. PLOS One, 1(6), e0156576. https:\/\/doi.org\/10.1371\/journal.pone.0156576.","journal-title":"PLOS One"},{"key":"9372_CR15","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman."},{"key":"9372_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T Gonzalez","year":"1985","unstructured":"Gonzalez, T. (1985). Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38, 293\u2013306.","journal-title":"Theoretical Computer Science"},{"key":"9372_CR17","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/j.csda.2004.06.017","volume":"49","author":"DJ Hand","year":"2004","unstructured":"Hand, D. J., & Krzanowski, W. J. (2004). Optimising k-means clustering results with standard software packages. Computational Statistics & Data Analysis, 49, 969\u2013973.","journal-title":"Computational Statistics & Data Analysis"},{"key":"9372_CR18","doi-asserted-by":"publisher","unstructured":"He, J., Lan, M., Tan, C. L., Sung, S. Y., & Low, H. B. (2004). Initialization of cluster refinement algorithms: a review and comparative study. In IEEE International Joint Conference on Neural Networks, Budapest. https:\/\/doi.org\/10.1109\/IJCNN.2004.1379917.","DOI":"10.1109\/IJCNN.2004.1379917"},{"key":"9372_CR19","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.csda.2006.11.025","volume":"52","author":"C Hennig","year":"2007","unstructured":"Hennig, C. (2007). Cluster-wise assessment of cluster stability. Computational Statistics and Data Analysis, 52, 258\u2013271.","journal-title":"Computational Statistics and Data Analysis"},{"issue":"2","key":"9372_CR20","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/s00357-015-9178-y","volume":"32","author":"J Hofmans","year":"2015","unstructured":"Hofmans, J., Ceulemans, E., Steinley, D., & Van Mechelen, I. (2015). On the added value of bootstrap analysis for k-means clustering. Journal of Classification, 32(2), 268\u2013284.","journal-title":"Journal of Classification"},{"key":"9372_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., & Arabie, P. (1985). Comparing partitions. Journal of Classification, 2, 193\u2013198.","journal-title":"Journal of Classification"},{"issue":"8","key":"9372_CR22","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain, A. K. (2010). Data clustering: 50 years beyond k-means. Pattern Recognition Letters, 31(8), 651\u2013666.","journal-title":"Pattern Recognition Letters"},{"key":"9372_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jmva.2004.02.013","volume":"90","author":"R J\u00f6rnsten","year":"2004","unstructured":"J\u00f6rnsten, R. (2004). Clustering and classification based on the L1-data depth. Journal of Multivariate Analysis, 90, 67\u201389.","journal-title":"Journal of Multivariate Analysis"},{"key":"9372_CR24","doi-asserted-by":"crossref","unstructured":"J\u00f6rnsten, R., Vardi, Y., & Zhang, C. H. (2002). A robust clustering method and visualization tool based on data depth. In Y. Dodge (Ed.) Statistical data analysis based on the L1\u2013norm and related methods (pp. 313\u2013366). Birkh\u00e4user Verla: Basel.","DOI":"10.1007\/978-3-0348-8201-9_29"},{"key":"9372_CR25","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/97.329844","volume":"1","author":"I Katsavounidis","year":"1994","unstructured":"Katsavounidis, I., Kuo, C., & Zhang, Z. (1994). A new initialization technique for generalized Lloyd iteration. IEEE Signal Processing Letters, 1, 144\u2013146.","journal-title":"IEEE Signal Processing Letters"},{"key":"9372_CR26","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"1990","unstructured":"Kaufman, L., & Rousseeuw, P. J. (1990). Finding groups in data: an introduction to cluster analysis. New York: Wiley."},{"issue":"16","key":"9372_CR27","doi-asserted-by":"publisher","first-page":"8961","DOI":"10.1073\/pnas.161273698","volume":"98","author":"MK Kerr","year":"2001","unstructured":"Kerr, M. K., & Churchill, G. A. (2001). Bootstrapping cluster analysis: assessing the reliability of conclusions from microarray experiments. Proceedings of the National Academy of Sciences of the United States of America, 98(16), 8961\u20138965.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"22","key":"9372_CR28","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.patrec.2004.04.007","volume":"25","author":"SS Khan","year":"2004","unstructured":"Khan, S. S., & Ahmad, A. (2004). Cluster center initialization algorithm for k-means clustering. Pattern Recognition Letters, 25(22), 1293\u20131302.","journal-title":"Pattern Recognition Letters"},{"key":"9372_CR29","doi-asserted-by":"crossref","unstructured":"Liao, H., Jihjai, X., Sun, W., Dai, J., & Yu, S. (2014). Adaptative initialization method based on spatial local information for k-means algorithm. Mathematical Problems in Engineering. Article ID 761468, 11 pp.","DOI":"10.1155\/2014\/761468"},{"key":"9372_CR30","unstructured":"Lichman, M. (2013). Machine Learning Repository, University of California, Irvine, School of Information and Computer Sciences. http:\/\/archive.ics.uci.edu\/ml. Accessed 24 Nov 2017."},{"key":"9372_CR31","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1214\/aos\/1176347507","volume":"18","author":"R Liu","year":"1990","unstructured":"Liu, R. (1990). On a notion of data depth based on random simplices. Annals of Statistics, 18, 405\u2013414.","journal-title":"Annals of Statistics"},{"issue":"486","key":"9372_CR32","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1198\/jasa.2009.0108","volume":"104","author":"S L\u00f3pez-Pintado","year":"2009","unstructured":"L\u00f3pez-Pintado, S., & Romo, J. (2009). On the concept of depth for functional data. Journal of the American Statistical Association, 104(486), 718\u2013734.","journal-title":"Journal of the American Statistical Association"},{"key":"9372_CR33","unstructured":"MacQueen, J. B. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley Symposium in Mathematics and Probability (pp. 281\u2013297)."},{"key":"9372_CR34","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2010.05.034","volume":"442","author":"M Mahajan","year":"2012","unstructured":"Mahajan, M., Nimnhorkar, P., & Varadarajan, K. (2012). The planar k- means problem is NP-hard. Theoretical Computer Science, 442, 13\u201321.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"9372_CR35","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1198\/jcgs.2009.08054","volume":"19","author":"R Maitra","year":"2010","unstructured":"Maitra, R., & Melnykov, V. (2010). Simulating data to study performance of finite mixture modeling and clustering algorithms. Journal of Computational and Graphical Statistics, 19(2), 354\u2013376.","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"9372_CR36","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02293907","volume":"45","author":"GW Milligan","year":"1980","unstructured":"Milligan, G. W. (1980). An examination of the effect of six types of error perturbation on fifteen clustering algorithms. Psychometrika, 45, 325\u2013342.","journal-title":"Psychometrika"},{"key":"9372_CR37","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01897163","volume":"5","author":"GW Milligan","year":"1988","unstructured":"Milligan, G. W., & Cooper, M. C. (1988). A study of standardization of variables in cluster analysis. Journal of Classification, 5, 181\u2013204.","journal-title":"Journal of Classification"},{"issue":"1","key":"9372_CR38","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/TPAMI.1983.4767342","volume":"PAMI-5","author":"GW Milligan","year":"1983","unstructured":"Milligan, G. W., Soon, S. C., & Sokol, L. M. (1983). The effect of cluster size, dimensionality, and the number of clusters on recovery of true cluster structure. IEEE Transactions of Pattern Analysis and Machine Intelligence, PAMI-5 (1), 40\u201347.","journal-title":"IEEE Transactions of Pattern Analysis and Machine Intelligence"},{"key":"9372_CR39","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0167-7152(83)90054-8","volume":"1","author":"H Oja","year":"1983","unstructured":"Oja, H. (1983). Descriptive statistics for multivariate distributions. Statistics & Probability Letters, 1, 327\u2013332.","journal-title":"Statistics & Probability Letters"},{"key":"9372_CR40","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/S0167-8655(99)00069-0","volume":"20","author":"JM Pe\u00f1a","year":"1999","unstructured":"Pe\u00f1a, J. M., Lozano, J. A., & Larra\u00f1aga, P. (1999). An empirical comparison of four initialization methods for the k-means algorithm. Pattern Recognition Letters, 20, 1027\u20131040.","journal-title":"Pattern Recognition Letters"},{"key":"9372_CR41","unstructured":"Pillai, K. C. S. (1954). On some distribution problems in multivariate analysis. Mimeograph Series No. 88, Institute of Statistics, University of North Carolina."},{"issue":"4","key":"9372_CR42","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1214\/aop\/1176993713","volume":"10","author":"D Pollard","year":"1982","unstructured":"Pollard, D. (1982). A central limit theorem for k-means clustering. Annals of Probability, 10(4), 919\u2013926.","journal-title":"Annals of Probability"},{"issue":"2","key":"9372_CR43","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1177\/002224378302000204","volume":"20","author":"G Punj","year":"1983","unstructured":"Punj, G., & Stewart, D. W. (1983). Cluster analysis in marketing research: review and suggestions for application. Journal of Marketing Research, 20(2), 134\u2013148.","journal-title":"Journal of Marketing Research"},{"key":"9372_CR44","volume-title":"R: a language and environment for statistical computing","author":"R Core Team","year":"2014","unstructured":"R Core Team. (2014). R: a language and environment for statistical computing. Vienna: R Foundation for Statistical Computing. http:\/\/www.R-project.org."},{"key":"9372_CR45","first-page":"329","volume":"131","author":"D Reddy","year":"2011","unstructured":"Reddy, D., Mishra, D., & Jana, P. K. (2011). MST-based cluster initialization for k-means. Advances in Computer Science and Information Technology 2011, Part I, Communications in Computer and Information Science, 131, 329\u2013338.","journal-title":"Advances in Computer Science and Information Technology 2011, Part I, Communications in Computer and Information Science"},{"issue":"8","key":"9372_CR46","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1016\/j.patrec.2007.01.001","volume":"28","author":"SJ Redmonds","year":"2007","unstructured":"Redmonds, S. J., & Heneghan, C. (2007). A method for initialising the k-means clustering algorithm using kd-trees. Pattern Recognition Letters, 28(8), 965\u2013973.","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"9372_CR47","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TPAMI.1984.4767478","volume":"6","author":"SZ Selim","year":"1984","unstructured":"Selim, S. Z., & Ismail, M. A. (1984). k-means type algorithms: a generalized convergence theorem and characterization of local optimality. IEEE Transactions on Pattern Analysis, 6(1), 81\u201387.","journal-title":"IEEE Transactions on Pattern Analysis"},{"issue":"3","key":"9372_CR48","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1037\/1082-989X.8.3.294","volume":"8","author":"D Steinley","year":"2003","unstructured":"Steinley, D. (2003). Local optima in k-means clustering: what you don\u2019t know may hurt you. Psychological Methods, 8(3), 294\u2013304.","journal-title":"Psychological Methods"},{"issue":"3","key":"9372_CR49","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1037\/1082-989X.9.3.386","volume":"9","author":"D Steinley","year":"2004","unstructured":"Steinley, D. (2004). Properties of the Hubert-Arabie adjusted rand index. Psychological Methods, 9(3), 386\u2013396.","journal-title":"Psychological Methods"},{"issue":"2","key":"9372_CR50","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1037\/1082-989X.11.2.178","volume":"11","author":"D Steinley","year":"2006","unstructured":"Steinley, D. (2006). Profiling local optima in k-means clustering: developing a diagnostic technique. Psychological Methods, 11(2), 178\u2013192.","journal-title":"Psychological Methods"},{"key":"9372_CR51","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00357-007-0003-0","volume":"24","author":"D Steinley","year":"2007","unstructured":"Steinley, D., & Brusco, M. J. (2007). Initializing k-means batch clustering: a critical evaluation of several techniques. Journal of Classification, 24, 99\u2013121.","journal-title":"Journal of Classification"},{"key":"9372_CR52","doi-asserted-by":"publisher","first-page":"319","DOI":"10.3233\/IDA-2007-11402","volume":"11","author":"T Su","year":"2007","unstructured":"Su, T., & Dy, J. G. (2007). In search of deterministic methods for initializing k-means and Gaussian mixture clustering. Intelligent Data Analysis, 11, 319\u2013338.","journal-title":"Intelligent Data Analysis"},{"key":"9372_CR53","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1186\/1471-2105-14-237","volume":"14","author":"A Torrente","year":"2013","unstructured":"Torrente, A., L\u00f3pez-Pintado, S., & Romo, J. (2013). DepthTools: an R package for a robust analysis of gene expression data. BMC Bioinformatics, 14, 237. https:\/\/doi.org\/10.1186\/1471-2105-14-237.","journal-title":"BMC Bioinformatics"},{"key":"9372_CR54","volume-title":"Pattern recognition principles","author":"JT Tou","year":"1974","unstructured":"Tou, J. T., & Gonz\u00e1lez, R. C. (1974). Pattern recognition principles. Massachusetts: Addison Wesley."},{"key":"9372_CR55","unstructured":"Tukey, J. W. (1975). Mathematics and the picturing of data. In Proceedings of the International Congress of Mathematicians (pp. 523\u2013531)."},{"key":"9372_CR56","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1073\/pnas.97.4.1423","volume":"97","author":"Y Vardi","year":"2000","unstructured":"Vardi, Y., & Zhang, C. H. (2000). The multivariate L1-median and associated data depth. Proceedings of the National Academy of Sciences of the United States of America, 97, 1423\u20131426.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"3","key":"9372_CR57","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1142\/S0218001411008683","volume":"25","author":"S Vega-Pons","year":"2011","unstructured":"Vega-Pons, S., & Ruiz-Schulcloper, J. (2011). A survey of clustering ensemble algorithms. International Journal of Patter Recognition and Artificial Intelligence, 25(3), 337\u2013372.","journal-title":"International Journal of Patter Recognition and Artificial Intelligence"},{"key":"9372_CR58","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JJ Ward","year":"1963","unstructured":"Ward, J. J. (1963). Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 58, 236\u2013244.","journal-title":"Journal of the American Statistical Association"},{"key":"9372_CR59","doi-asserted-by":"publisher","unstructured":"Yi, B., Qiao, H., Yang, F., & Xu, C. (2010). An improved initialization center algorithm for k-means clustering. In International Conference on Computational Intelligence and Software Engineering (CiSE). https:\/\/doi.org\/10.1109\/CISE.2010.5676975.","DOI":"10.1109\/CISE.2010.5676975"}],"container-title":["Journal of Classification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-020-09372-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00357-020-09372-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-020-09372-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T23:37:00Z","timestamp":1627083420000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00357-020-09372-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,24]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["9372"],"URL":"https:\/\/doi.org\/10.1007\/s00357-020-09372-3","relation":{},"ISSN":["0176-4268","1432-1343"],"issn-type":[{"value":"0176-4268","type":"print"},{"value":"1432-1343","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,24]]},"assertion":[{"value":"24 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}