{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:44:27Z","timestamp":1780587867219,"version":"3.54.1"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031703676","type":"print"},{"value":"9783031703683","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70368-3_1","type":"book-chapter","created":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T23:03:11Z","timestamp":1725058991000},"page":"3-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Data with\u00a0Density-Based Clusters: A Generator for\u00a0Systematic Evaluation of\u00a0Clustering Algorithms"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Jahn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian M. M.","family":"Frey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anna","family":"Beer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Collin","family":"Leiber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,22]]},"reference":[{"key":"1_CR1","series-title":"Advances in Computer Vision and Pattern Recognition","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-319-58347-1_2","volume-title":"Domain Adaptation in Computer Vision Applications","author":"T Tommasi","year":"2017","unstructured":"Tommasi, T., Patricia, N., Caputo, B., Tuytelaars, T.: A deeper look at dataset bias. In: Csurka, G. (ed.) Domain Adaptation in Computer Vision Applications. ACVPR, pp. 37\u201355. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58347-1_2"},{"key":"1_CR2","unstructured":"Ester, M., Kriegel, H., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, AAAI Press, pp. 226\u2013231 (1996)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Tobin, J., Zhang, M.: DCF: an efficient and robust density-based clustering method. In: ICDM, pp. 629\u2013638. IEEE (2021)","DOI":"10.1109\/ICDM51629.2021.00074"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Hess, S., Duivesteijn, W., Honysz, P., Morik, K.: The SpectACl of nonconvex clustering: a spectral approach to density-based clustering. In: AAAI, AAAI Press, pp. 3788\u20133795 (2019)","DOI":"10.1609\/aaai.v33i01.33013788"},{"issue":"11","key":"1_CR5","doi-asserted-by":"publisher","first-page":"3031","DOI":"10.14778\/3551793.3551850","volume":"15","author":"E Hohma","year":"2022","unstructured":"Hohma, E., Frey, C.M.M., Beer, A., Seidl, T.: SCAR - spectral clustering accelerated and robustified. Proc. VLDB Endow. 15(11), 3031\u20133044 (2022)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/A:1009745219419","volume":"2","author":"J Sander","year":"1998","unstructured":"Sander, J., Ester, M., Kriegel, H., Xu, X.: Density-based clustering in spatial databases: the algorithm GDBSCAN and its applications. Data Min. Knowl. Discov. 2(2), 169\u2013194 (1998)","journal-title":"Data Min. Knowl. Discov."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H., Sander, J.: OPTICS: ordering points to identify the clustering structure, pp. 49\u201360 (1999)","DOI":"10.1145\/304181.304187"},{"issue":"5","key":"1_CR8","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1109\/TKDE.2017.2780123","volume":"30","author":"C Frey","year":"2018","unstructured":"Frey, C., Z\u00fcfle, A., Emrich, T., Renz, M.: Efficient information flow maximization in probabilistic graphs. IEEE Trans. Knowl. Data Eng. 30(5), 880\u2013894 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-642-23878-9_53","volume-title":"Intelligent Data Engineering and Automated Learning - IDEAL 2011","author":"W Ashour","year":"2011","unstructured":"Ashour, W., Sunoallah, S.: Multi density DBSCAN. In: Yin, H., Wang, W., Rayward-Smith, V. (eds.) IDEAL 2011. LNCS, vol. 6936, pp. 446\u2013453. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23878-9_53"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Frey, C.M., Jungwirth, A., Frey, M., Kolisch, R.: The vehicle routing problem with time windows and flexible delivery locations. Eur. J. Oper. Res. 308(3), 1142\u20131159 (2023). ISSN 0377-2217","DOI":"10.1016\/j.ejor.2022.11.029"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-37456-2_14","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"RJGB Campello","year":"2013","unstructured":"Campello, R.J.G.B., Moulavi, D., Sander, J.: Density-based clustering based on hierarchical density estimates. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013. LNCS (LNAI), vol. 7819, pp. 160\u2013172. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37456-2_14"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Yale, A., Dash, S., Dutta, R., Guyon, I., Pavao, A., Bennett, K.P.: Generation and evaluation of privacy preserving synthetic health data. Neurocomputing 416, 244\u2013255 (2020). ISSN 0925-2312","DOI":"10.1016\/j.neucom.2019.12.136"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Libes, D., Lechevalier, D., Jain, S.: Issues in synthetic data generation for advanced manufacturing. In: 2017 IEEE International Conference on Big Data (Big Data), Boston, MA, USA, pp. 1746-1754 (2017)","DOI":"10.1109\/BigData.2017.8258117"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Gan, J., Tao, Y.: DBSCAN revisited: Mis-claim, un-fixability, and approximation. In: SIGMOD Conference, pp. 519\u2013530. ACM (2015)","DOI":"10.1145\/2723372.2737792"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Mai, S.T., Assent, I., Storgaard, M.: AnyDBC: an efficient anytime density-based clustering algorithm for very large complex datasets. In: KDD, pp. 1025\u20131034. ACM (2016)","DOI":"10.1145\/2939672.2939750"},{"issue":"7","key":"1_CR16","doi-asserted-by":"publisher","first-page":"3182","DOI":"10.1109\/TIP.2016.2559803","volume":"25","author":"J Hou","year":"2016","unstructured":"Hou, J., Gao, H., Li, X.: DSets-DBSCAN: a parameter-free clustering algorithm. IEEE Trans. Image Process. 25(7), 3182\u20133193 (2016)","journal-title":"IEEE Trans. Image Process."},{"issue":"6","key":"1_CR17","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/TKDE.2017.2787640","volume":"30","author":"A Bryant","year":"2018","unstructured":"Bryant, A., Cios, K.J.: RNN-DBSCAN: a density-based clustering algorithm using reverse nearest neighbor density estimates. IEEE Trans. Knowl. Data Eng. 30(6), 1109\u20131121 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/s11227-018-2380-z","volume":"75","author":"J Kim","year":"2019","unstructured":"Kim, J., Choi, J., Yoo, K., Nasridinov, A.: AA-DBSCAN: an approximate adaptive DBSCAN for finding clusters with varying densities. J. Supercomput. 75(1), 142\u2013169 (2019)","journal-title":"J. Supercomput."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"105841","DOI":"10.1016\/j.knosys.2020.105841","volume":"197","author":"Y Ren","year":"2020","unstructured":"Ren, Y., Wang, N., Li, M., Xu, Z.: Deep density-based image clustering. Knowl. Based Syst. 197, 105841 (2020)","journal-title":"Knowl. Based Syst."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"107624","DOI":"10.1016\/j.patcog.2020.107624","volume":"109","author":"Y Chen","year":"2021","unstructured":"Chen, Y., Zhou, L., Bouguila, N., Wang, C., Chen, Y., Du, J.: BLOCK-DBSCAN: fast clustering for large scale data. Pattern Recognit. 109, 107624 (2021)","journal-title":"Pattern Recognit."},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/TBDATA.2019.2907624","volume":"7","author":"JA dos Santos","year":"2021","unstructured":"dos Santos, J.A., Iqbal, S.T., Naldi, M.C., Campello, R.J.G.B., Sander, J.: Hierarchical density-based clustering using MapReduce. IEEE Trans. Big Data 7(1), 102\u2013114 (2021)","journal-title":"IEEE Trans. Big Data"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Wang, Z., et al.: AMD-DBSCAN: an adaptive multi-density DBSCAN for datasets of extremely variable density. In: DSAA, pp. 1\u201310. IEEE (2022)","DOI":"10.1109\/DSAA54385.2022.10032412"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"109658","DOI":"10.1016\/j.patcog.2023.109658","volume":"142","author":"X Huang","year":"2023","unstructured":"Huang, X., Ma, T., Liu, C., Liu, S.: GriT-DBSCAN: a spatial clustering algorithm for very large databases. Pattern Recognit. 142, 109658 (2023)","journal-title":"Pattern Recognit."},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Ma, B., Yang, C., Li, A., Chi, Y., Chen, L.: A faster dbscan algorithm based on self-adaptive determination of parameters. Procedia Comput. Sci. 221, 113\u2013120 (2023). (ITQM 2023)","DOI":"10.1016\/j.procs.2023.07.017"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"127329","DOI":"10.1016\/j.neucom.2024.127329","volume":"576","author":"J Qian","year":"2024","unstructured":"Qian, J., Zhou, Y., Han, X., Wang, Y.: MDBSCAN: a multi-density dbscan based on relative density. Neurocomputing 576, 127329 (2024)","journal-title":"Neurocomputing"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02294153","volume":"50","author":"GW Milligan","year":"1985","unstructured":"Milligan, G.W.: An algorithm for generating artificial test clusters. Psychometrika 50, 123\u2013127 (1985)","journal-title":"Psychometrika"},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s00357-006-0018-y","volume":"23","author":"W Qiu","year":"2006","unstructured":"Qiu, W., Joe, H.: Generation of random clusters with specified degree of separation. J. Classif. 23(2), 315\u2013334 (2006)","journal-title":"J. Classif."},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v051.i12","volume":"51","author":"V Melnykov","year":"2012","unstructured":"Melnykov, V., Chen, W.-C., Maitra, R.: MixSim: an r package for simulating data to study performance of clustering algorithms. J. Stat. Softw. 51, 1\u201325 (2012)","journal-title":"J. Stat. Softw."},{"key":"1_CR29","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"110836","DOI":"10.1016\/j.knosys.2023.110836","volume":"277","author":"N Fachada","year":"2023","unstructured":"Fachada, N., de Andrade, D.: Generating multidimensional clusters with support lines. Knowl. Based Syst. 277, 110836 (2023)","journal-title":"Knowl. Based Syst."},{"issue":"2","key":"1_CR31","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00357-005-0015-6","volume":"22","author":"DL Steinley","year":"2005","unstructured":"Steinley, D.L., Henson, R.: OCLUS: an analytic method for generating clusters with known overlap. J. Classif. 22(2), 221\u2013250 (2005)","journal-title":"J. Classif."},{"issue":"6","key":"1_CR32","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1109\/TEVC.2021.3137369","volume":"26","author":"C Shand","year":"2022","unstructured":"Shand, C., Allmendinger, R., Handl, J., Webb, A.M., Keane, J.: HAWKS: evolving challenging benchmark sets for cluster analysis. IEEE Trans. Evol. Comput. 26(6), 1206\u20131220 (2022)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"1_CR33","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s00357-019-9312-3","volume":"36","author":"F Iglesias","year":"2019","unstructured":"Iglesias, F., Zseby, T., Ferreira, D.C., Zimek, A.: MDCGen: multidimensional dataset generator for clustering. J. Classif. 36(3), 599\u2013618 (2019)","journal-title":"J. Classif."},{"key":"1_CR34","unstructured":"Vennam, J.R., Vadapalli, S.: SynDECA: a tool to generate synthetic datasets for evaluation of clustering algorithms. In: COMAD, Computer Society of India, pp. 27\u201336 (2005)"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Gan, J., Tao, Y.: On the hardness and approximation of euclidean DBSCAN. ACM Trans. Database Syst. 42(3), 14:1\u201314:45 (2017)","DOI":"10.1145\/3083897"},{"issue":"7","key":"1_CR36","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1016\/S0167-8655(98)00053-1","volume":"19","author":"DA Rachkovskij","year":"1998","unstructured":"Rachkovskij, D.A., Kussul, E.M.: DataGen: a generator of datasets for evaluation of classification algorithms. Pattern Recognit. Lett. 19(7), 537\u2013544 (1998)","journal-title":"Pattern Recognit. Lett."},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Fr\u00e4nti, P., Sieranoja, S.: K-means properties on six clustering benchmark datasets, pp. 4743\u20134759 (2018). http:\/\/cs.uef.fi\/sipu\/datasets\/","DOI":"10.1007\/s10489-018-1238-7"},{"key":"1_CR38","unstructured":"Beer, A., Sch\u00fcler, N.S., Seidl, T.: A generator for subspace clusters. In: LWDA, ser. CEUR Workshop Proceedings, vol. 2454, pp. 69\u201373 (2019). CEUR-WS.org"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Schubert, E., Sander, J., Ester, M., Kriegel, H., Xu, X.: DBSCAN revisited, revisited: why and how you should (still) use DBSCAN. ACM Trans. Database Syst. 42(3), 19:1\u201319:21 (2017)","DOI":"10.1145\/3068335"},{"issue":"1","key":"1_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12874-020-00977-1","volume":"20","author":"A Goncalves","year":"2020","unstructured":"Goncalves, A., Ray, P., Soper, B., Stevens, J., Coyle, L., Sales, A.P.: Generation and evaluation of synthetic patient data. BMC Med. Res. Methodol. 20(1), 1\u201340 (2020)","journal-title":"BMC Med. Res. Methodol."},{"key":"1_CR41","unstructured":"Pei, Y., Zaiane, O.R.: A synthetic data generator for clustering and outlier analysis (2006)"},{"issue":"2","key":"1_CR42","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013136 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"Georgoulas, G.K., Konstantaras, A., Katsifarakis, E., Stylios, C.D., Maravelakis, E., Vachtsevanos, G.J.: \u201cSeismic-mass\u201d density-based algorithm for spatio-temporal clustering. Expert Syst. Appl. 40(10), 4183\u20134189 (2013)","DOI":"10.1016\/j.eswa.2013.01.028"},{"issue":"8","key":"1_CR44","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.: Data clustering: 50 years beyond k-means. Pattern Recognit. Lett. 31(8), 651\u2013666 (2010)","journal-title":"Pattern Recognit. Lett."},{"issue":"5","key":"1_CR45","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/34.1000236","volume":"24","author":"D Comaniciu","year":"2002","unstructured":"Comaniciu, D., Meer, P.: Mean Shift: a robust approach toward feature space analysis. IEEE Trans. Pattern Anal. Mach. Intell. 24(5), 603\u2013619 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"1_CR46","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s11634-022-00496-5","volume":"17","author":"T Ullmann","year":"2023","unstructured":"Ullmann, T., Beer, A., H\u00fcnem\u00f6rder, M., Seidl, T., Boulesteix, A.: Over-optimistic evaluation and reporting of novel cluster algorithms: an illustrative study. Adv. Data Anal. Classif. 17(1), 211\u2013238 (2023)","journal-title":"Adv. Data Anal. Classif."},{"key":"1_CR47","unstructured":"Levina, E., Bickel, P.: Maximum likelihood estimation of intrinsic dimension. In: Saul, L., Weiss, Y., Bottou, L. (eds.) NIPS, vol.\u00a017. MIT Press (2004)"},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume-title":"Database Theory \u2014 ICDT\u201999","author":"K Beyer","year":"1999","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When Is \u201cNearest Neighbor\u2019\u2019 meaningful? In: Beeri, C., Buneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 217\u2013235. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49257-7_15"},{"key":"1_CR49","doi-asserted-by":"crossref","unstructured":"Beer, A., Draganov, A., Hohma, E., Jahn, P., Frey, C.M., Assent, I.: Connecting the dots - density-connectivity distance unifies dbscan, k-center and spectral clustering. In: KDD, pp. 80\u201392. ACM (2023)","DOI":"10.1145\/3580305.3599283"},{"issue":"4","key":"1_CR50","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U von Luxburg","year":"2007","unstructured":"von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"issue":"301","key":"1_CR51","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward Jr","year":"1963","unstructured":"Ward, J.H., Jr.: Hierarchical grouping to optimize an objective function. J. Am. Stat. Assoc. 58(301), 236\u2013244 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"1_CR52","unstructured":"Xie, J., Girshick, R.B., Farhadi, A.: Unsupervised deep embedding for clustering analysis. In: ICML, ser. JMLR Workshop and Conference Proceedings, vol.\u00a048, pp. 478\u2013487 (2016). JMLR.org"},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"Leiber, C., Bauer, L.G.M., Schelling, B., B\u00f6hm, C., Plant, C.: Dip-based deep embedded clustering with k-estimation. In: KDD, pp. 903\u2013913. ACM (2021)","DOI":"10.1145\/3447548.3467316"},{"issue":"6191","key":"1_CR54","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez, A., Laio, A.: Clustering by fast search and find of density peaks. Science 344(6191), 1492\u20131496 (2014)","journal-title":"Science"},{"key":"1_CR55","doi-asserted-by":"crossref","unstructured":"Leiber, C., Miklautz, L., Plant, C., B\u00f6hm, C.: Benchmarking deep clustering algorithms with clustpy. In: ICDM (Workshops), pp. 625\u2013632. IEEE (2023)","DOI":"10.1109\/ICDMW60847.2023.00087"},{"key":"1_CR56","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2, 193\u2013218 (1985)","journal-title":"J. Classif."},{"key":"1_CR57","first-page":"583","volume":"3","author":"A Strehl","year":"2002","unstructured":"Strehl, A., Ghosh, J.: Cluster ensembles \u2013 a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3, 583\u2013617 (2002)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases. Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70368-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T23:09:46Z","timestamp":1725059386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70368-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031703676","9783031703683"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70368-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vilnius","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lithuania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}