{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T10:20:02Z","timestamp":1783160402164,"version":"3.54.6"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031178481","type":"print"},{"value":"9783031178498","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17849-8_15","type":"book-chapter","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T20:19:42Z","timestamp":1664309982000},"page":"190-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Clustering by\u00a0Direct Optimization of\u00a0the\u00a0Medoid Silhouette"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0037-0418","authenticated-orcid":false,"given":"Lars","family":"Lenssen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9143-4880","authenticated-orcid":false,"given":"Erich","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"key":"15_CR1","unstructured":"Ackerman, M., Ben-David, S.: Measures of clustering quality: a working set of axioms for clustering. In: Advances in Neural Information Processing Systems (NIPS 2008), pp. 121\u2013128 (2008). https:\/\/proceedings.neurips.cc\/paper\/2008\/hash\/beed13602b9b0e6ecb5b568ff5058f07-Abstract.html"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.patcog.2012.07.021","volume":"46","author":"O Arbelaitz","year":"2013","unstructured":"Arbelaitz, O., Gurrutxaga, I., Muguerza, J., P\u00e9rez, J.M., Perona, I.: An extensive comparative study of cluster validity indices. Pattern Recognit. 46(1), 243\u2013256 (2013). https:\/\/doi.org\/10.1016\/j.patcog.2012.07.021","journal-title":"Pattern Recognit."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"107190","DOI":"10.1016\/j.csda.2021.107190","volume":"158","author":"F Batool","year":"2021","unstructured":"Batool, F., Hennig, C.: Clustering with the average silhouette width. Comput. Stat. Data Anal. 158, 107190 (2021). https:\/\/doi.org\/10.1016\/j.csda.2021.107190","journal-title":"Comput. Stat. Data Anal."},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1147\/rd.81.0022","volume":"8","author":"RE Bonner","year":"1964","unstructured":"Bonner, R.E.: On some clustering techniques. IBM J. Res. Devel. 8(1), 22\u201332 (1964). https:\/\/doi.org\/10.1147\/rd.81.0022","journal-title":"IBM J. Res. Devel."},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.patcog.2006.06.026","volume":"40","author":"M Brun","year":"2007","unstructured":"Brun, M., et al.: Model-based evaluation of clustering validation measures. Pattern Recognit. 40(3), 807\u2013824 (2007). https:\/\/doi.org\/10.1016\/j.patcog.2006.06.026","journal-title":"Pattern Recognit."},{"key":"15_CR6","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: International Conference on Knowledge Discovery and Data Mining, KDD\u201996, pp. 226\u2013231 (1996). https:\/\/dl.acm.org\/doi\/10.5555\/3001460.3001507"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/568574.568575","volume":"4","author":"V Estivill-Castro","year":"2002","unstructured":"Estivill-Castro, V.: Why so many clustering algorithms \u2013 a position paper. SIGKDD Explor. 4(1), 65\u201375 (2002). https:\/\/doi.org\/10.1145\/568574.568575","journal-title":"SIGKDD Explor."},{"key":"15_CR8","unstructured":"Kaufman, L., Rousseeuw, P.J.: Clustering by means of medoids. In: Statistical Data Analysis Based on the $$L_1$$ Norm and Related Methods. North-Holland (1987)"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Kaufman, L., Rousseeuw, P.J.: Clustering large applications (program CLARA). In: Finding Groups in Data. Wiley (1990). https:\/\/doi.org\/10.1002\/9780470316801.ch3","DOI":"10.1002\/9780470316801.ch3"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1016\/j.cell.2015.04.044","volume":"161","author":"A Klein","year":"2015","unstructured":"Klein, A., et al.: Droplet barcoding for single-cell transcriptomics applied to embryonic stem cells. Cell 161, 1187\u20131201 (2015). https:\/\/doi.org\/10.1016\/j.cell.2015.04.044","journal-title":"Cell"},{"key":"15_CR11","unstructured":"Kleinberg, J.: An impossibility theorem for clustering. In: Advances in Neural Information Processing Systems (NIPS 2002), vol. 15, pp. 463\u2013470 (2002). https:\/\/papers.nips.cc\/paper\/2002\/hash\/43e4e6a6f341e00671e123714de019a8-Abstract.html"},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.stem.2015.09.011","volume":"17","author":"A Kolodziejczyk","year":"2015","unstructured":"Kolodziejczyk, A., et al.: Single cell RNA-sequencing of pluripotent states unlocks modular transcriptional variation. Cell Stem Cell 17(4), 471\u2013485 (2015). https:\/\/doi.org\/10.1016\/j.stem.2015.09.011","journal-title":"Cell Stem Cell"},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10115-016-1004-2","volume":"52","author":"H-P Kriegel","year":"2016","unstructured":"Kriegel, H.-P., Schubert, E., Zimek, A.: The (black) art of runtime evaluation: are we comparing algorithms or implementations? Knowl. Inf. Syst. 52(2), 341\u2013378 (2016). https:\/\/doi.org\/10.1007\/s10115-016-1004-2","journal-title":"Knowl. Inf. Syst."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53 (1987). https:\/\/doi.org\/10.1016\/0377-0427(87)90125-7","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3068335","volume":"42","author":"E Schubert","year":"2017","unstructured":"Schubert, E., Sander, J., Ester, M., Kriegel, H.P., Xu, X.: DBSCAN revisited, revisited: why and how you should (still) use DBSCAN. ACM Trans. Database Syst. 42(3), 1\u201321 (2017). https:\/\/doi.org\/10.1145\/3068335","journal-title":"ACM Trans. Database Syst."},{"key":"15_CR16","unstructured":"Schubert, E., Hess, S., Morik, K.: The relationship of DBSCAN to matrix factorization and spectral clustering. In: Lernen, Wissen, Daten, Analysen (2018)"},{"issue":"75","key":"15_CR17","doi-asserted-by":"publisher","first-page":"4183","DOI":"10.21105\/joss.04183","volume":"7","author":"E Schubert","year":"2022","unstructured":"Schubert, E., Lenssen, L.: Fast k-medoids clustering in Rust and Python. J. Open Source Softw. 7(75), 4183 (2022). https:\/\/doi.org\/10.21105\/joss.04183","journal-title":"J. Open Source Softw."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-030-32047-8_16","volume-title":"Similarity Search and Applications","author":"E Schubert","year":"2019","unstructured":"Schubert, E., Rousseeuw, P.J.: Faster k-medoids clustering: improving the PAM, CLARA, and CLARANS algorithms. In: Amato, G., Gennaro, C., Oria, V., Radovanovi\u0107, M. (eds.) SISAP 2019. LNCS, vol. 11807, pp. 171\u2013187. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32047-8_16"},{"key":"15_CR19","doi-asserted-by":"publisher","unstructured":"Schubert, E., Rousseeuw, P.J.: Fast and eager k-medoids clustering: O(k) runtime improvement of the PAM, CLARA, and CLARANS algorithms. Inf. Syst. 101, 101804 (2021). https:\/\/doi.org\/10.1016\/j.is.2021.101804","DOI":"10.1016\/j.is.2021.101804"},{"issue":"8","key":"15_CR20","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1080\/0094965031000136012","volume":"73","author":"M Van der Laan","year":"2003","unstructured":"Van der Laan, M., Pollard, K., Bryan, J.: A new partitioning around medoids algorithm. J. Stat. Comput. Simul. 73(8), 575\u2013584 (2003). https:\/\/doi.org\/10.1080\/0094965031000136012","journal-title":"J. Stat. Comput. Simul."}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17849-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T23:05:01Z","timestamp":1664319901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17849-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031178481","9783031178498"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17849-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bologna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}