{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:13:20Z","timestamp":1740147200027,"version":"3.37.3"},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T00:00:00Z","timestamp":1661385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T00:00:00Z","timestamp":1661385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["2019-05444"],"award-info":[{"award-number":["2019-05444"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100019217","name":"IVADO","doi-asserted-by":"crossref","award":["PRF-2017-20"],"award-info":[{"award-number":["PRF-2017-20"]}],"id":[{"id":"10.13039\/501100019217","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11634-022-00514-6","type":"journal-article","created":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T15:03:13Z","timestamp":1661439793000},"page":"829-858","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Determinantal consensus clustering"],"prefix":"10.1007","volume":"17","author":[{"given":"Serge","family":"Vicente","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0417-2646","authenticated-orcid":false,"given":"Alejandro","family":"Murua-Sazo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,25]]},"reference":[{"issue":"2","key":"514_CR1","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, Sander J (1999) Optics: ordering points to identify the clustering structure. ACM SIGMOD Rec 28(2):49\u201360","journal-title":"ACM SIGMOD Rec"},{"key":"514_CR2","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1093\/bioinformatics\/bti201","volume":"21","author":"SI Ao","year":"2005","unstructured":"Ao SI, Yip K, Ng M, Cheung D, Fong P, Melhado I, Sham P (2005) Clustag: hierarchical clustering and graph methods for selecting tag SNPS. Bioinformatics 21:1735\u20136. https:\/\/doi.org\/10.1093\/bioinformatics\/bti201","journal-title":"Bioinformatics"},{"key":"514_CR3","unstructured":"Arthur D, Vassilvitskii S (2007) K-means++: The advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, USA, SODA \u201907. Society for Industrial and Applied Mathematics, pp 1027\u20131035"},{"issue":"3","key":"514_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F Aurenhammer","year":"1991","unstructured":"Aurenhammer F (1991) Voronoi diagrams\u2014a survey of a fundamental geometric data structure. ACM Comput Surv 23(3):345\u2013405. https:\/\/doi.org\/10.1145\/116873.116880","journal-title":"ACM Comput Surv"},{"issue":"3","key":"514_CR5","doi-asserted-by":"crossref","first-page":"803","DOI":"10.2307\/2532201","volume":"49","author":"JD Banfield","year":"1993","unstructured":"Banfield JD, Raftery AE (1993) Model-based Gaussian and non-Gaussian clustering. Biometrics 49(3):803\u2013821","journal-title":"Biometrics"},{"key":"514_CR6","first-page":"206","volume":"3","author":"J Ben Hough","year":"2006","unstructured":"Ben Hough J, Krishnapur M, Peres Y, Vir\u00e1g B (2006) Determinantal processes and independence. Probab Surv [electronic only] 3:206\u2013229","journal-title":"Probab Surv [electronic only]"},{"key":"514_CR7","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.neucom.2016.08.081","volume":"218","author":"M Bicego","year":"2016","unstructured":"Bicego M, Baldo S (2016) Properties of the Box\u2013Cox transformation for pattern classification. Neurocomputing 218:390\u2013400","journal-title":"Neurocomputing"},{"key":"514_CR8","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1198\/jasa.2011.tm10183","volume":"106","author":"J Bien","year":"2011","unstructured":"Bien J, Tibshirani R (2011) Hierarchical clustering with prototypes via minimax linkage. J Am Stat Assoc 106:1075\u20131084. https:\/\/doi.org\/10.1198\/jasa.2011.tm10183","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"514_CR9","first-page":"2518","volume":"18","author":"M Bilodeau","year":"2017","unstructured":"Bilodeau M, Nangue AG (2017) Tests of mutual or serial independence of random vectors with applications. J Mach Learn Res 18(1):2518\u20132557","journal-title":"J Mach Learn Res"},{"key":"514_CR10","doi-asserted-by":"crossref","first-page":"3251","DOI":"10.1103\/PhysRevLett.76.3251","volume":"76","author":"M Blatt","year":"1996","unstructured":"Blatt M, Wiseman S, Domany E (1996) Superparamagnetic clustering of data. Phys Rev Lett 76:3251\u20133254","journal-title":"Phys Rev Lett"},{"issue":"8","key":"514_CR11","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1162\/neco.1997.9.8.1805","volume":"9","author":"M Blatt","year":"1997","unstructured":"Blatt M, Wiseman S, Domany E (1997) Data clustering using a model granular magnet. Neural Comput 9(8):1805\u20131842","journal-title":"Neural Comput"},{"key":"514_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s002200050815","volume":"211","author":"A Borodin","year":"2000","unstructured":"Borodin A, Olshanski G (2000) Distributions on partitions, point processes, and the hypergeometric kernel. Commun Math Phys 211:335\u2013358. https:\/\/doi.org\/10.1007\/s002200050815arXiv:math\/9904010","journal-title":"Commun Math Phys"},{"key":"514_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1111\/j.2517-6161.1964.tb00553.x","volume":"26","author":"GEP Box","year":"1964","unstructured":"Box GEP, Cox DR (1964) An analysis of transformations. J R Stat Soc B 26:211\u2013252","journal-title":"J R Stat Soc B"},{"issue":"9","key":"514_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.3390\/a12090177","volume":"12","author":"W Budiaji","year":"2019","unstructured":"Budiaji W, Leisch F (2019) Simple k-medoids partitioning algorithm for mixed variable data. Algorithms 12(9):177","journal-title":"Algorithms"},{"key":"514_CR15","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.knosys.2016.06.031","volume":"117","author":"M Cap\u00f3","year":"2017","unstructured":"Cap\u00f3 M, P\u00e9rez A, Lozano JA (2017) An efficient approximation to the k-means clustering for massive data. Knowl-Based Syst 117:56\u201369","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"514_CR16","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.eswa.2012.07.021","journal-title":"Expert Syst Appl"},{"key":"514_CR17","doi-asserted-by":"crossref","unstructured":"Chaudhuri A, Kakde D, Sadek C, Gonzalez L, Kong S (2017) The mean and median criteria for kernel bandwidth selection for support vector data description. In: 2017 IEEE international conference on data mining workshops (ICDMW). IEEE, pp 842\u2013849","DOI":"10.1109\/ICDMW.2017.116"},{"key":"514_CR18","volume":"2009","author":"D Chen","year":"2009","unstructured":"Chen D, Xing K, Henson D, Sheng L, Schwartz AM, Cheng X (2009) Developing prognostic systems of cancer patients by ensemble clustering. J Biomed Biotechnol 2009:632786","journal-title":"J Biomed Biotechnol"},{"key":"514_CR19","unstructured":"Dua D, Graff C (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"514_CR20","doi-asserted-by":"crossref","DOI":"10.1201\/9780429246593","volume-title":"An introduction to the bootstrap","author":"B Efron","year":"1994","unstructured":"Efron B, Tibshirani RJ (1994) An introduction to the bootstrap. CRC Press, Boca Raton"},{"key":"514_CR21","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"Ester M, Kriegel HP, Sander J, Xu X et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. KDD 96:226\u2013231","journal-title":"KDD"},{"key":"514_CR22","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-3-642-13498-2_47","volume-title":"Advances in swarm intelligence","author":"Z Fan","year":"2010","unstructured":"Fan Z, Jiang X, Xu B, Jiang Z (2010) An automatic index validity for clustering. In: Tan Y, Shi Y, Tan KC (eds) Advances in swarm intelligence. Springer, Berlin, pp 359\u2013366"},{"issue":"1","key":"514_CR23","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.patcog.2007.05.018","volume":"41","author":"M Filippone","year":"2008","unstructured":"Filippone M, Camastra F, Masulli F, Rovetta S (2008) A survey of kernel and spectral methods for clustering. Pattern Recogn 41(1):176\u2013190","journal-title":"Pattern Recogn"},{"key":"514_CR24","doi-asserted-by":"crossref","first-page":"282","DOI":"10.4064\/cm-2-3-4-282-285","volume":"2","author":"K Florek","year":"1951","unstructured":"Florek K, \u0141ukaszewicz J, Perkal J, Steinhaus H, Zubrzycki S (1951) Sur la liaison et la division des points d\u2019un ensemble fini. Colloq Math 2:282\u2013285","journal-title":"Colloq Math"},{"key":"514_CR25","first-page":"768","volume":"21","author":"EW Forgy","year":"1965","unstructured":"Forgy EW (1965) Cluster analysis of multivariate data: efficiency versus interpretability of classifications. Biometrics 21:768\u2013769","journal-title":"Biometrics"},{"key":"514_CR26","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1093\/comjnl\/41.8.578","volume":"41","author":"C Fraley","year":"1998","unstructured":"Fraley C, Raftery AE (1998) How many clusters? Which clustering method? Answers via model-based cluster analysis. Comput J 41:578\u2013588","journal-title":"Comput J"},{"key":"514_CR27","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.patcog.2019.04.014","volume":"93","author":"P Fr\u00e4nti","year":"2019","unstructured":"Fr\u00e4nti P, Sieranoja S (2019) How much can k-means be improved by using better initialization and repeats? Pattern Recogn 93:95\u2013112","journal-title":"Pattern Recogn"},{"issue":"3","key":"514_CR28","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1109\/TNN.2002.1000150","volume":"13","author":"M Girolami","year":"2002","unstructured":"Girolami M (2002) Mercer kernel-based clustering in feature space. IEEE Trans Neural Netw 13(3):780\u2013784","journal-title":"IEEE Trans Neural Netw"},{"key":"514_CR29","doi-asserted-by":"crossref","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"},{"key":"514_CR30","unstructured":"Hafiz Affandi R, Fox EB, Taskar B (2013) Approximate inference in continuous determinantal point processes. ArXiv e-prints arXiv:1311.2971"},{"key":"514_CR31","unstructured":"Hafiz Affandi R, Fox EB, Adams RP, Taskar B (2014) Learning the parameters of determinantal point process kernels. arXiv e-prints arXiv:1402.4862"},{"key":"514_CR32","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2011","unstructured":"Han J, Kamber M, Pei J (2011) Data mining: concepts and techniques, 3rd edn. Morgan Kaufmann Publishers Inc., San Francisco","edition":"3"},{"key":"514_CR33","first-page":"1","volume-title":"Cluster validation by measurement of clustering characteristics relevant to the user, Chap 1","author":"C Hennig","year":"2019","unstructured":"Hennig C (2019) Cluster validation by measurement of clustering characteristics relevant to the user, Chap 1. Wiley, Hoboken, pp 1\u201324"},{"key":"514_CR34","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4170.001.0001","volume-title":"Learning kernel classifiers: theory and algorithms","author":"R Herbrich","year":"2001","unstructured":"Herbrich R (2001) Learning kernel classifiers: theory and algorithms. MIT Press, Cambridge"},{"key":"514_CR35","unstructured":"Hinneburg A, Keim DA (1999) Optimal grid-clustering: towards breaking the curse of dimensionality in high-dimensional clustering. In: 25th International conference on very large databases, pp 506\u2013517"},{"key":"514_CR36","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/11840930_43","volume-title":"Artificial Neural Networks\u2014ICANN 2006","author":"T Howley","year":"2006","unstructured":"Howley T, Madden MG (2006) An evolutionary approach to automatic kernel construction. In: Kollias S, Stafylopatis A, Duch W, Oja E (eds) Artificial Neural Networks\u2014ICANN 2006. Springer, Berlin, pp 417\u2013426"},{"issue":"1","key":"514_CR37","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. J Classif 2(1):193\u2013218. https:\/\/doi.org\/10.1007\/BF01908075","journal-title":"J Classif"},{"key":"514_CR38","unstructured":"Ibrahim LF, Harbi MHA (2013) Using modified partitioning around medoids clustering technique in mobile network planning. arXiv preprint arXiv:1302.6602"},{"key":"514_CR39","volume-title":"Algorithms for clustering data","author":"A Jain","year":"1988","unstructured":"Jain A, Dubes R (1988) Algorithms for clustering data. Prentice-Hall Inc, Upper Saddle River"},{"key":"514_CR40","first-page":"2319","volume-title":"Advances in neural information processing systems","author":"B Kang","year":"2013","unstructured":"Kang B (2013) Fast determinantal point process sampling with application to clustering. In: Burges C, Bottou L, Welling M, Ghahramani Z, Weinberger K (eds) Advances in neural information processing systems, vol 26. Curran Associates, Inc., New York, pp 2319\u20132327"},{"issue":"9","key":"514_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v011.i09","volume":"11","author":"A Karatzoglou","year":"2004","unstructured":"Karatzoglou A, Smola A, Hornik K, Zeileis A (2004) kernlab\u2014an s4 package for kernel methods in r. J Stat Softw 11(9):1\u201320","journal-title":"J Stat Softw"},{"issue":"10","key":"514_CR42","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/97.329844","volume":"1","author":"I Katsavounidis","year":"1994","unstructured":"Katsavounidis I, Kuo CCJ, Zhang Z (1994) A new initialization technique for generalized Lloyd iteration. IEEE Signal Process Lett 1(10):144\u2013146","journal-title":"IEEE Signal Process Lett"},{"key":"514_CR43","unstructured":"Kaufmann L, Rousseeuw P (1987) Clustering by means of medoids. In: Proceedings of the statistical data analysis based on the L1 norm conference, Neuchatel, Switzerland, vol 31, pp 405\u2013416"},{"issue":"2\u20133","key":"514_CR44","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1561\/2200000044","volume":"5","author":"A Kulesza","year":"2012","unstructured":"Kulesza A, Taskar B (2012) Determinantal point processes for machine learning. Found Trends Mach Learn 5(2\u20133):123\u2013286. https:\/\/doi.org\/10.1561\/2200000044","journal-title":"Found Trends Mach Learn"},{"issue":"3","key":"514_CR45","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1016\/j.patcog.2009.09.018","volume":"43","author":"LF Lago-Fern\u00e1ndez","year":"2010","unstructured":"Lago-Fern\u00e1ndez LF, Corbacho F (2010) Normality-based validation for crisp clustering. Pattern Recogn 43(3):782\u2013795","journal-title":"Pattern Recogn"},{"key":"514_CR46","unstructured":"Lewis D (1997) Reuters-21578 text categorization collection, distribution 1.0. http:\/\/kdd.ics.uci.edu\/databases\/reuters21578\/reuters21578.html"},{"key":"514_CR47","unstructured":"Lin D (1998) An information-theoretic definition of similarity. In: Proceedings of the 15th international conference on machine learning. Morgan Kaufmann, San Francisco, pp 296\u2013304"},{"key":"514_CR48","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd SP (1982) Least squares quantization in PCM. IEEE Trans Inf Theory 28:129\u2013136","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"514_CR49","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/TCBB.2007.70244","volume":"6","author":"R Maitra","year":"2009","unstructured":"Maitra R (2009) Initializing partition-optimization algorithms. IEEE\/ACM Trans Comput Biol Bioinf 6(1):144\u2013157","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"12","key":"514_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v051.i12","volume":"51","author":"V Melnykov","year":"2012","unstructured":"Melnykov V, Chen WC, Maitra R (2012) Mixsim: an r package for simulating data to study performance of clustering algorithms. J Stat Softw 51(12):1\u201325. https:\/\/doi.org\/10.18637\/jss.v051.i12","journal-title":"J Stat Softw"},{"issue":"1","key":"514_CR51","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/A:1023949509487","volume":"52","author":"S Monti","year":"2003","unstructured":"Monti S, Tamayo P, Mesirov J, Golub T (2003) Consensus clustering: a resampling-based method for class discovery and visualization of gene expression microarray data. Mach Learn 52(1):91\u2013118","journal-title":"Mach Learn"},{"issue":"3","key":"514_CR52","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1002\/sam.11373","volume":"11","author":"J Mu\u00f1oz","year":"2018","unstructured":"Mu\u00f1oz J, Murua A (2018) Building cancer prognosis systems with survival function clusters. Stat Anal Data Min ASA Data Sci J 11(3):98\u2013110. https:\/\/doi.org\/10.1002\/sam.11373","journal-title":"Stat Anal Data Min ASA Data Sci J"},{"issue":"3","key":"514_CR53","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1080\/10618600.2013.837828","volume":"23","author":"A Murua","year":"2014","unstructured":"Murua A, Wicker N (2014) The conditional-Potts clustering model. J Comput Graph Stat 23(3):717\u2013739","journal-title":"J Comput Graph Stat"},{"issue":"3","key":"514_CR54","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1198\/106186008X318855","volume":"17","author":"A Murua","year":"2008","unstructured":"Murua A, Stanberry L, Stuetzle W (2008) On Potts model clustering, kernel k-means, and density estimation. J Comput Graph Stat 17(3):629\u2013658","journal-title":"J Comput Graph Stat"},{"key":"514_CR55","first-page":"849","volume":"14","author":"A Ng","year":"2001","unstructured":"Ng A, Jordan M, Weiss Y (2001) On spectral clustering: analysis and an algorithm. Adv Neural Inf Process Syst 14:849\u2013856","journal-title":"Adv Neural Inf Process Syst"},{"key":"514_CR56","series-title":"Series in Probability and Statistics","doi-asserted-by":"crossref","DOI":"10.1002\/9780470317013","volume-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"A Okabe","year":"2000","unstructured":"Okabe A, Boots B, Sugihara K, Chiu SN (2000) Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd edn. Series in Probability and Statistics. Wiley, Hoboken","edition":"2"},{"issue":"2","key":"514_CR57","doi-asserted-by":"crossref","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","volume":"36","author":"HS Park","year":"2009","unstructured":"Park HS, Jun CH (2009) A simple and fast algorithm for k-medoids clustering. Expert Syst Appl 36(2):3336\u20133341","journal-title":"Expert Syst Appl"},{"issue":"10","key":"514_CR58","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1016\/S0167-8655(99)00069-0","volume":"20","author":"JM Pena","year":"1999","unstructured":"Pena JM, Lozano JA, Larranaga P (1999) An empirical comparison of four initialization methods for the k-means algorithm. Pattern Recogn Lett 20(10):1027\u20131040","journal-title":"Pattern Recogn Lett"},{"issue":"336","key":"514_CR59","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand WM (1971) Objective criteria for the evaluation of clustering methods. J Am Stat Assoc 66(336):846\u2013850","journal-title":"J Am Stat Assoc"},{"key":"514_CR60","first-page":"3","volume":"5","author":"D Saad","year":"1998","unstructured":"Saad D (1998) Online algorithms and stochastic approximations. Online Learn 5:3\u20136","journal-title":"Online Learn"},{"issue":"5","key":"514_CR61","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1162\/089976698300017467","volume":"10","author":"B Sch\u00f6lkopf","year":"1998","unstructured":"Sch\u00f6lkopf B, Smola A, M\u00fcller KR (1998) Nonlinear component analysis as a kernel eigenvalue problem. Neural Comput 10(5):1299\u20131319","journal-title":"Neural Comput"},{"key":"514_CR62","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4057.001.0001","volume-title":"Kernel methods in computational biology","author":"B Sch\u00f6lkopf","year":"2004","unstructured":"Sch\u00f6lkopf B, Tsuda K, Vert JP (2004) Kernel methods in computational biology. MIT Press, Cambridge"},{"key":"514_CR63","doi-asserted-by":"crossref","unstructured":"Schubert E, Rousseeuw PJ (2019) Faster k-medoids clustering: improving the PAM, CLARA, and CLARANS algorithms. In: International conference on similarity search and applications. Springer, pp 171\u2013187","DOI":"10.1007\/978-3-030-32047-8_16"},{"key":"514_CR64","doi-asserted-by":"crossref","first-page":"2263","DOI":"10.1214\/13-AOS1140","volume":"41","author":"D Sejdinovic","year":"2013","unstructured":"Sejdinovic D, Sriperumbudur B, Gretton A, Fukumizu K (2013) Equivalence of distance-based and RKHS-based statistics in hypothesis testing. Ann Stat 41:2263\u20132291","journal-title":"Ann Stat"},{"issue":"8","key":"514_CR65","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"514_CR66","unstructured":"Smyth P (1997) Clustering sequences with hidden Markov models. In: Proceedings of the 9th international conference on neural information processing systems (NIPS 1996). MIT Press, Cambridge, pp 648\u2013654"},{"key":"514_CR67","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1162\/153244303321897735","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:583\u2013617. https:\/\/doi.org\/10.1162\/153244303321897735","journal-title":"J Mach Learn Res"},{"issue":"1","key":"514_CR68","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00357-003-0004-6","volume":"20","author":"W Stuetzle","year":"2003","unstructured":"Stuetzle W (2003) Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample. J Classif 20(1):25\u201347","journal-title":"J Classif"},{"issue":"2","key":"514_CR69","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1198\/jcgs.2009.07049","volume":"19","author":"W Stuetzle","year":"2010","unstructured":"Stuetzle W, Nugent R (2010) A generalized single linkage method for estimating the cluster tree of a density. J Comput Graph Stat 19(2):397\u2013418","journal-title":"J Comput Graph Stat"},{"issue":"1","key":"514_CR70","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1186\/1471-2105-5-77","volume":"5","author":"HH Thygesen","year":"2004","unstructured":"Thygesen HH, Zwinderman AH (2004) Comparing transformation methods for DNA microarray data. BMC Bioinform 5(1):77","journal-title":"BMC Bioinform"},{"issue":"2","key":"514_CR71","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/2641190.2641198","volume":"15","author":"J Vanschoren","year":"2013","unstructured":"Vanschoren J, van Rijn JN, Bischl B, Torgo L (2013) Openml: networked science in machine learning. SIGKDD Explor 15(2):49\u201360. https:\/\/doi.org\/10.1145\/2641190.2641198","journal-title":"SIGKDD Explor"},{"key":"514_CR72","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The nature of statistical learning theory","author":"VN Vapnik","year":"1995","unstructured":"Vapnik VN (1995) The nature of statistical learning theory. Springer, Berlin"},{"issue":"03","key":"514_CR73","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1142\/S0218001411008683","volume":"25","author":"S Vega-Pons","year":"2011","unstructured":"Vega-Pons S, Ruiz-Shulcloper J (2011) A survey of clustering ensemble algorithms. Int J Pattern Recogn Artif Intell 25(03):337\u2013372. https:\/\/doi.org\/10.1142\/S0218001411008683","journal-title":"Int J Pattern Recogn Artif Intell"},{"key":"514_CR74","doi-asserted-by":"crossref","unstructured":"Verleysen M, Fran\u00e7ois D (2005) The curse of dimensionality in data mining and time series prediction. In: International work-conference on artificial neural networks. Springer, pp 758\u2013770","DOI":"10.1007\/11494669_93"},{"key":"514_CR75","doi-asserted-by":"crossref","first-page":"35","DOI":"10.7551\/mitpress\/4057.003.0004","volume":"47","author":"JP Vert","year":"2004","unstructured":"Vert JP, Tsuda K, Sch\u00f6lkopf B (2004) A primer on kernel methods. Kernel Methods Comput Biol 47:35\u201370","journal-title":"Kernel Methods Comput Biol"},{"issue":"10","key":"514_CR76","doi-asserted-by":"crossref","first-page":"2050","DOI":"10.1103\/PhysRevLett.86.2050","volume":"86","author":"F Wang","year":"2001","unstructured":"Wang F, Landau DP (2001) Efficient, multiple-range random walk algorithm to calculate the density of states. Phys Rev Lett 86(10):2050","journal-title":"Phys Rev Lett"},{"key":"514_CR77","first-page":"186","volume":"97","author":"W Wang","year":"1997","unstructured":"Wang W, Yang J, Muntz R et al (1997) Sting: a statistical information grid approach to spatial data mining. VLDB 97:186\u2013195","journal-title":"VLDB"},{"issue":"301","key":"514_CR78","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward Jr","year":"1963","unstructured":"Ward JH Jr (1963) Hierarchical grouping to optimize an objective function. J Am Stat Assoc 58(301):236\u2013244","journal-title":"J Am Stat Assoc"},{"key":"514_CR79","unstructured":"Watkins C (1999) Dynamic alignment kernels. In: Smola AJ, Bartlett PL, Sch\u00f6lkopf B, Schuurmans D (eds) Advances in large margin classifiers. MIT Press, pp 39\u201350"},{"key":"514_CR80","doi-asserted-by":"publisher","unstructured":"Xuan L, Zhigang C, Fan Y (2013) Exploring of clustering algorithm on class-imbalanced data. In: 8th International conference on computer science and education, ICCSE 2013, pp 89\u201393. https:\/\/doi.org\/10.1109\/ICCSE.2013.6553890","DOI":"10.1109\/ICCSE.2013.6553890"},{"key":"514_CR81","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1093\/bioinformatics\/17.10.977","volume":"17","author":"KY Yeung","year":"2001","unstructured":"Yeung KY, Fraley C, Murua A, Raftery AE, Ruzzo WL (2001) Model-based clustering and data transformations for gene expression data. Bioinformatics 17:977\u2013987","journal-title":"Bioinformatics"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-022-00514-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11634-022-00514-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-022-00514-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T15:59:45Z","timestamp":1727884785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11634-022-00514-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,25]]},"references-count":81,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["514"],"URL":"https:\/\/doi.org\/10.1007\/s11634-022-00514-6","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"type":"print","value":"1862-5347"},{"type":"electronic","value":"1862-5355"}],"subject":[],"published":{"date-parts":[[2022,8,25]]},"assertion":[{"value":"21 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}