{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:14:39Z","timestamp":1754486079493,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T00:00:00Z","timestamp":1638144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T00:00:00Z","timestamp":1638144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003542","name":"Ministerium f\u00fcr Wissenschaft, Forschung und Kunst Baden-W\u00fcrttemberg","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003542","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["01IS17051"],"award-info":[{"award-number":["01IS17051"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Clustering is a fundamental primitive in manifold applications. In order to achieve valuable results in exploratory clustering analyses, parameters of the clustering algorithm have to be set appropriately, which is a tremendous pitfall. We observe multiple challenges for large-scale exploration processes. On the one hand, they require specific methods to efficiently explore large parameter search spaces. On the other hand, they often exhibit large runtimes, in particular when large datasets are analyzed using clustering algorithms with super-polynomial runtimes, which repeatedly need to be executed within exploratory clustering analyses. We address these challenges as follows: First, we present LOG-Means and show that it provides estimates for the number of clusters in sublinear time regarding the defined search space, i.e., provably requiring less executions of a clustering algorithm than existing methods. Second, we demonstrate how to exploit fundamental characteristics of exploratory clustering analyses in order to significantly accelerate the (repetitive) execution of clustering algorithms on large datasets. Third, we show how these challenges can be tackled at the same time. To the best of our knowledge, this is the first work which simultaneously addresses the above-mentioned challenges. In our comprehensive evaluation, we unveil that our proposed methods significantly outperform state-of-the-art methods, thus especially supporting novice analysts for exploratory clustering analyses in large-scale exploration processes.<\/jats:p>","DOI":"10.1007\/s00778-021-00716-y","type":"journal-article","created":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T13:02:53Z","timestamp":1638190973000},"page":"711-732","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient exploratory clustering analyses in large-scale exploration processes"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4640-8477","authenticated-orcid":false,"given":"Manuel","family":"Fritz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Behringer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Tschechlov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holger","family":"Schwarz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,29]]},"reference":[{"key":"716_CR1","unstructured":"Abdullah, A., Kumar, R., McGregor, A., Vassilvitskii, S., Venkatasubramanian, S.: Sketching, embedding, and dimensionality reduction for information spaces. In: Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, AISTATS 2016, vol.\u00a041, pp. 948\u2013956 (2016)"},{"issue":"6","key":"716_CR2","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TAC.1974.1100705","volume":"19","author":"H Akaike","year":"1974","unstructured":"Akaike, H.: A new look at the statistical model identification. IEEE Trans. Autom. Control 19(6), 716\u2013723 (1974)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"716_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D Aloise","year":"2009","unstructured":"Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245\u2013248 (2009)","journal-title":"Mach. Learn."},{"key":"716_CR4","doi-asserted-by":"crossref","unstructured":"Arthur, D., Vassilvitskii, S.: How slow is the k-means method? In: Proceedings of the Annual Symposium on Computational Geometry, vol. 2006, pp. 144\u2013153 (2006)","DOI":"10.1145\/1137856.1137880"},{"key":"716_CR5","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1027\u20131025 (2007)"},{"key":"716_CR6","doi-asserted-by":"crossref","unstructured":"Bachem, O., Lucic, M., Krause, A.: Scalable k-means clustering via lightweight coresets. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1119\u20131127 (2018)","DOI":"10.1145\/3219819.3219973"},{"key":"716_CR7","unstructured":"Bachem, O., Lucic, M., Lattanzi, S.: One-shot coresets: the case of k-clustering. In: International Conference on Artificial Intelligence and Statistics (AISTATS) (2018)"},{"issue":"7","key":"716_CR8","first-page":"622","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani, B., Moseley, B., Vattani, A., Kumar, R., Vassilvitskii, S.: Scalable K-means++. PVLDB 5(7), 622\u2013633 (2012)","journal-title":"PVLDB"},{"key":"716_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511541773","volume-title":"DNA Microarrays and Gene Expression: From Experiments to Data Analysis and Modeling","author":"P Baldi","year":"2002","unstructured":"Baldi, P., Hatfield, G.W.: DNA Microarrays and Gene Expression: From Experiments to Data Analysis and Modeling. Cambridge University Press, Cambridge (2002)"},{"issue":"3","key":"716_CR10","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1109\/3477.678640","volume":"28","author":"SK Bhatia","year":"1998","unstructured":"Bhatia, S.K., Deogun, J.S.: Conceptual clustering in information retrieval. IEEE Trans. Syst. Man Cybern. B Cybern. 28(3), 427\u2013436 (1998)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"key":"716_CR11","unstructured":"Bradley, P.S., Mangasarian, O.L., Street, W.N.: Clustering via concave minimization. In: Advances in Neural Information Processing Systems, pp. 368\u2013374 (1997)"},{"issue":"1","key":"716_CR12","first-page":"1","volume":"3","author":"T Cali\u00f1ski","year":"1974","unstructured":"Cali\u00f1ski, T., Harabasz, J.: A dendrite method for cluster analysis. Commun. Stat. 3(1), 1\u201327 (1974)","journal-title":"Commun. Stat."},{"issue":"7","key":"716_CR13","first-page":"766","volume":"12","author":"M Ceccarello","year":"2019","unstructured":"Ceccarello, M., Pietracaprina, A., Pucci, G.: Solving k-center clustering (with outliers) in MapReduce and streaming, almost as accurately as sequentially. PVLDB 12(7), 766\u2013778 (2019)","journal-title":"PVLDB"},{"issue":"1","key":"716_CR14","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.: A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert Syst. Appl. 40(1), 200\u2013210 (2013)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"716_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0167-8655(85)90053-4","volume":"3","author":"JM Coggins","year":"1985","unstructured":"Coggins, J.M., Jain, A.K.: A spatial filtering approach to texture analysis. Pattern Recognit. Lett. 3(3), 195\u2013203 (1985)","journal-title":"Pattern Recognit. Lett."},{"key":"716_CR16","doi-asserted-by":"crossref","unstructured":"Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-1(2), 224\u2013227 (1979)","DOI":"10.1109\/TPAMI.1979.4766909"},{"issue":"1","key":"716_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/01969727408546059","volume":"4","author":"JC Dunn","year":"1974","unstructured":"Dunn, J.C.: Well-separated clusters and optimal fuzzy partitions. J. Cybern. 4(1), 95\u2013104 (1974)","journal-title":"J. Cybern."},{"key":"716_CR18","unstructured":"Elkan, C.: Using the triangle inequality to accelerate k-means. In: Proceedings of the Twentieth International Conference on Machine Learning, pp. 147\u2013153 (2003)"},{"issue":"3","key":"716_CR19","first-page":"768","volume":"21","author":"E Forgy","year":"1965","unstructured":"Forgy, E.: Cluster analysis of multivariate data: efficiency versus interpretability of classification. Biometrics 21(3), 768\u2013769 (1965)","journal-title":"Biometrics"},{"key":"716_CR20","doi-asserted-by":"publisher","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.: How much can k-means be improved by using better initialization and repeats? Pattern Recognit. 93, 95\u2013112 (2019)","journal-title":"Pattern Recognit."},{"issue":"5","key":"716_CR21","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/34.765656","volume":"21","author":"H Frigui","year":"1999","unstructured":"Frigui, H., Krishnapuram, R.: A robust competitive clustering algorithm with applications in computer vision. IEEE Trans. Pattern Anal. Mach. Intell. 21(5), 450\u2013465 (1999)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2\u20133","key":"716_CR22","first-page":"129","volume":"34","author":"M Fritz","year":"2019","unstructured":"Fritz, M., Behringer, M., Schwarz, H.: Quality-driven early stopping for explorative cluster analysis for big data. SICS Softw.-Intensive Cyber-Phys. Syst. 34(2\u20133), 129\u2013140 (2019)","journal-title":"SICS Softw.-Intensive Cyber-Phys. Syst."},{"issue":"11","key":"716_CR23","doi-asserted-by":"publisher","first-page":"2118","DOI":"10.14778\/3407790.3407813","volume":"13","author":"M Fritz","year":"2020","unstructured":"Fritz, M., Behringer, M., Schwarz, H.: LOG-means: efficiently estimating the number of clusters in large datasets. Proc. VLDB Endow. 13(11), 2118\u20132131 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"716_CR24","doi-asserted-by":"crossref","unstructured":"Fritz, M., Schwarz, H.: Initializing k-means efficiently: Benefits for exploratory cluster analysis. In: Proceedings of OnTheMove Federated Conferences and Workshops (OTM), 27th International Conference on Cooperative Information Systems (CoopIS 2019), vol. 11877 LNCS, pp. 146\u2013163. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-33246-4_9"},{"key":"716_CR25","doi-asserted-by":"crossref","unstructured":"Fritz, M., Tschechlov, D., Schwarz, H.: Efficient exploratory clustering analyses with qualitative approximations. In: International Conference on Extending Database Technology (EDBT) (2021)","DOI":"10.1007\/s00778-021-00716-y"},{"issue":"2","key":"716_CR26","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1109\/TIT.1982.1056488","volume":"28","author":"MR Garey","year":"1982","unstructured":"Garey, M.R., Johnson, D.S., Witsenhausen, H.S.: The complexity of the generalized Lloyd-max problem. IEEE Trans. Inf. Theory 28(2), 255\u2013256 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"716_CR27","doi-asserted-by":"crossref","unstructured":"Guan, H., Ding, Y., Shen, X., Krim, H.: Reuse-centric k-means configuration. In: IEEE 34th International Conference on Data Engineering, ICDE 2018, pp. 1228\u20131231. Institute of Electrical and Electronics Engineers Inc. (2018)","DOI":"10.1109\/ICDE.2018.00116"},{"key":"716_CR28","doi-asserted-by":"crossref","unstructured":"Hamerly, G.: Making k-means even faster. In: Proceedings of the 2010 SIAM International Conference on Data Mining, pp. 130\u2013140 (2010)","DOI":"10.1137\/1.9781611972801.12"},{"key":"716_CR29","doi-asserted-by":"crossref","unstructured":"Hamerly, G., Drake, J.: Accelerating Lloyd\u2019s algorithm for k-means clustering. In: Partitional Clustering Algorithms, pp. 41\u201378. Springer (2015)","DOI":"10.1007\/978-3-319-09259-1_2"},{"key":"716_CR30","first-page":"1","volume":"17","author":"G Hamerly","year":"2004","unstructured":"Hamerly, G., Elkan, C.: Learning the k in k-means. Adv. Neural. Inf. Process. Syst. 17, 1\u20138 (2004)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"2","key":"716_CR31","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"issue":"3\u20134","key":"716_CR32","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1147\/rd.513.0281","volume":"51","author":"J Hu","year":"2007","unstructured":"Hu, J., Ray, B.K., Singh, M.: Statistical methods for automated generation of service engagement staffing plans. IBM J. Res. Dev. 51(3\u20134), 281\u2013293 (2007)","journal-title":"IBM J. Res. Dev."},{"issue":"5","key":"716_CR33","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1109\/TCYB.2017.2702343","volume":"48","author":"D Huang","year":"2018","unstructured":"Huang, D., Wang, C.D., Lai, J.H.: Locally weighted ensemble clustering. IEEE Trans. Cybern. 48(5), 1460\u20131473 (2018)","journal-title":"IEEE Trans. Cybern."},{"key":"716_CR34","unstructured":"Huang, D., Wang, C.D., Peng, H., Lai, J., Kwoh, C.K.: Enhanced ensemble clustering via fast propagation of cluster-wise similarities. IEEE Trans. Syst. Man Cybern.: Syst. (2018)"},{"key":"716_CR35","unstructured":"Huang, Z.: A fast clustering algorithm to cluster very large categorical data sets in data mining. Research Issues on Data Mining and Knowledge Discovery, pp. 1\u20138 (1997)"},{"key":"716_CR36","doi-asserted-by":"crossref","unstructured":"Iwayama, M., Tokunaga, T.: Cluster-based text categorization: a comparison of category search strategies. In: Proceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 273\u2013280. Association for Computing Machinery (ACM) (1995)","DOI":"10.1145\/215206.215371"},{"issue":"8","key":"716_CR37","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."},{"key":"716_CR38","volume-title":"Algorithms for Data Clustering","author":"AK Jain","year":"1988","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for Data Clustering. Prentice Hall, London (1988)"},{"issue":"7","key":"716_CR39","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo, T., Mount, D., Netanyahu, N., Piatko, C., Silverman, R., Wu, A.: An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell. 24(7), 881\u2013892 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"716_CR40","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\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"716_CR41","unstructured":"Macqueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281\u2013297 (1967)"},{"key":"716_CR42","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to Information Retrieval","author":"CD Manning","year":"2008","unstructured":"Manning, C.D., Raghavan, P., Sch\u00fctze, H.: Introduction to Information Retrieval. Cambridge University Press, Cambridge (2008)"},{"key":"716_CR43","doi-asserted-by":"crossref","unstructured":"Mexicano, A., Rodr\u00edguez, R., Cervantes, S., Montes, P., Jim\u00e9nez, M., Almanza, N., Abrego, A.: The early stop heuristic: a new convergence criterion for K-means. In: AIP Conference Proceedings, vol. 1738 (2016)","DOI":"10.1063\/1.4952103"},{"key":"716_CR44","unstructured":"Pelleg, D., Moore, A.: X-means: extending K-means with efficient estimation of the number of clusters. In Proceedings of the 17th International Conference on Machine Learning, pp. 727\u2014-734 (2000)"},{"issue":"2","key":"716_CR45","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1177\/002224378302000204","volume":"20","author":"G Punj","year":"1983","unstructured":"Punj, G., Stewart, D.W.: Cluster analysis in marketing research: review and suggestions for application. J. Mark. Res. 20(2), 134\u2013148 (1983)","journal-title":"J. Mark. Res."},{"key":"716_CR46","doi-asserted-by":"crossref","unstructured":"Rousseeuw, P.J.: Silhouettes: A graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20(C), 53\u201365 (1987)","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"716_CR47","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G Schwarz","year":"1978","unstructured":"Schwarz, G.: Estimating the dimension of a model. Ann. Stat. 6, 461\u2013464 (1978)","journal-title":"Ann. Stat."},{"issue":"8","key":"716_CR48","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"463","key":"716_CR49","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1198\/016214503000000666","volume":"98","author":"CA Sugar","year":"2003","unstructured":"Sugar, C.A., James, G.M.: Finding the number of clusters in a dataset: an information-theoretic approach. J. Am. Stat. Assoc. 98(463), 750\u2013763 (2003)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"716_CR50","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02289263","volume":"18","author":"RL Thorndike","year":"1953","unstructured":"Thorndike, R.L.: Who belongs in the family? Psychometrika 18(4), 267\u2013276 (1953)","journal-title":"Psychometrika"},{"key":"716_CR51","doi-asserted-by":"crossref","unstructured":"Tibshirani, R., Walther, G., Hastie, T.: Estimating the number of clusters in a data set via the gap statistic. J. R. Stat. Soc. Ser. B: Stat. Methodol. 63(2), 411\u2013423 (2001)","DOI":"10.1111\/1467-9868.00293"},{"key":"716_CR52","unstructured":"Tschechlov, D., Fritz, M., Schwarz, H.: AutoML4Clust: efficient AutoML for clustering analyses. In: International Conference on Extending Database Technology (EDBT) (2021)"},{"issue":"1","key":"716_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","volume":"14","author":"X Wu","year":"2008","unstructured":"Wu, X., Kumar, V., Ross, Q.J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G.J., Ng, A., Liu, B., Yu, P.S., Zhou, Z.H., Steinbach, M., Hand, D.J., Steinberg, D.: Top 10 algorithms in data mining. Knowl. Inf. Syst. 14(1), 1\u201337 (2008)","journal-title":"Knowl. Inf. Syst."},{"key":"716_CR54","doi-asserted-by":"crossref","unstructured":"Zhang, L., Guan, H., Ding, Y., Shen, X., Krim, H.: Reuse-centric k-means configuration. Inf. Syst. 100, 101787 (2021)","DOI":"10.1016\/j.is.2021.101787"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00716-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-021-00716-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00716-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T04:05:01Z","timestamp":1656129901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-021-00716-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,29]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["716"],"URL":"https:\/\/doi.org\/10.1007\/s00778-021-00716-y","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2021,11,29]]},"assertion":[{"value":"17 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}