{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:29:34Z","timestamp":1745468974935,"version":"3.40.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031758225"},{"type":"electronic","value":"9783031758232"}],"license":[{"start":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T00:00:00Z","timestamp":1729814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T00:00:00Z","timestamp":1729814400000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-75823-2_19","type":"book-chapter","created":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T20:33:24Z","timestamp":1729802004000},"page":"223-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Advancing the PAM Algorithm to Semi-supervised k-Medoids Clustering"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-4807-1023","authenticated-orcid":false,"given":"Miriama","family":"J\u00e1no\u0161ov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3212-5548","authenticated-orcid":false,"given":"Andreas","family":"Lang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1523-1744","authenticated-orcid":false,"given":"Petra","family":"Budikova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9143-4880","authenticated-orcid":false,"given":"Erich","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7768-7435","authenticated-orcid":false,"given":"Vlastislav","family":"Dohnal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,25]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Alpaydin, E., Kaynak, C.: Optical Recognition of Handwritten Digits. UCI Machine Learning Repository (1998). https:\/\/doi.org\/10.24432\/C50P49","DOI":"10.24432\/C50P49"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Balcan, M.F., Blum, A., Gupta, A.: Clustering under approximation stability. J. ACM 60(2) (2013). https:\/\/doi.org\/10.1145\/2450142.2450144","DOI":"10.1145\/2450142.2450144"},{"key":"19_CR3","unstructured":"Basu, S., Banerjee, A., Mooney, R.J.: Semi-supervised clustering by seeding. In: ICML, pp. 27\u201334 (2002)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-64383-4_10","volume":"1394","author":"V Estivill-Castro","year":"1998","unstructured":"Estivill-Castro, V., Murray, A.T.: Discovering associations in spatial data - an efficient medoid based approach. PAKDD 1394, 110\u2013121 (1998). https:\/\/doi.org\/10.1007\/3-540-64383-4_10","journal-title":"PAKDD"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/B:DAMI.0000015869.08323.b3","volume":"8","author":"V Estivill-Castro","year":"2004","unstructured":"Estivill-Castro, V., Yang, J.: Fast and robust general purpose clustering algorithms. Data Min. Knowl. Discov. 8(2), 127\u2013150 (2004). https:\/\/doi.org\/10.1023\/B:DAMI.0000015869.08323.b3","journal-title":"Data Min. Knowl. Discov."},{"key":"19_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.104743","volume":"110","author":"AE Ezugwu","year":"2022","unstructured":"Ezugwu, A.E., Ikotun, A.M., Oyelade, O.O., Abualigah, L., Agushaka, J.O., Eke, C.I., Akinyelu, A.A.: A comprehensive survey of clustering algorithms: state-of-the-art machine learning applications, taxonomy, challenges, and future research prospects. Eng. Appl. Artif. Intell. 110, 104743 (2022). https:\/\/doi.org\/10.1016\/j.engappai.2022.104743","journal-title":"Eng. Appl. Artif. Intell."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"LJ Hubert","year":"1985","unstructured":"Hubert, L.J., Arabie, P.: Comparing partitions. J. Classif. 2, 193\u2013218 (1985)","journal-title":"J. Classif."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.neucom.2012.06.013","volume":"99","author":"H Jiang","year":"2013","unstructured":"Jiang, H., Ren, Z., Xuan, J., Wu, X.: Extracting elite pairwise constraints for clustering. Neurocomputing 99, 124\u2013133 (2013). https:\/\/doi.org\/10.1016\/j.neucom.2012.06.013","journal-title":"Neurocomputing"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley (2009). https:\/\/doi.org\/10.1002\/9780470316801","DOI":"10.1002\/9780470316801"},{"key":"19_CR10","unstructured":"Krizhevsky, A.: Learning multiple layers of features from tiny images. Tech. rep., University of Toronto (2009)"},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"Lange, T., Law, M.H., Jain, A.K., Buhmann, J.M.: Learning with constrained and unlabelled data. In: CVPR, pp. 731\u2013738 (2005). https:\/\/doi.org\/10.1109\/CVPR.2005.210","DOI":"10.1109\/CVPR.2005.210"},{"key":"19_CR12","unstructured":"LeCun, Y., Cortes, C., Burges, C.: MNIST handwritten digit database. http:\/\/yann.lecun.com\/exdb\/mnist (1998)"},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Lenssen, L., Schubert, E.: Sparse partitioning around medoids. In: Machine Learning Under Resource Constraints \u2013 Volume 1: Fundamentals, pp. 182\u2013196. De Gruyter (2022). https:\/\/doi.org\/10.1515\/9783110785944-005","DOI":"10.1515\/9783110785944-005"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Leonard\u00a0Kaufman, P.J.R.: Partitioning Around Medoids (Program PAM), pp. 68\u2013125. Wiley (1990) (chapter 2)","DOI":"10.1002\/9780470316801.ch2"},{"key":"19_CR15","unstructured":"Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G., Sutskever, I.: Learning transferable visual models from natural language supervision. In: ICML, pp. 8748\u20138763 (2021)"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10852-005-9022-1","volume":"5","author":"AP Reynolds","year":"2006","unstructured":"Reynolds, A.P., Richards, G., de la Iglesia, B., Rayward-Smith, V.J.: Clustering rules: a comparison of partitioning and hierarchical clustering algorithms. J. Math. Model. Algorith. 5, 475\u2013504 (2006). https:\/\/doi.org\/10.1007\/s10852-005-9022-1","journal-title":"J. Math. Model. Algorith."},{"key":"19_CR17","doi-asserted-by":"publisher","unstructured":"Schubert, E.: Automatic indexing for similarity search in ELKI. In: Similarity Search and Applications. SISAP (2022). https:\/\/doi.org\/10.1007\/978-3-031-17849-8_16","DOI":"10.1007\/978-3-031-17849-8_16"},{"key":"19_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2021.101804","volume":"101","author":"E Schubert","year":"2021","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","journal-title":"Inf. Syst."},{"key":"19_CR19","unstructured":"Schubert, E., Zimek, A.: ELKI Multi-View Clustering Data Sets Based on the Amsterdam Library of Object Images (ALOI). Zenodo (2010)"},{"issue":"2","key":"19_CR20","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10994-019-05855-6","volume":"109","author":"JE Van Engelen","year":"2020","unstructured":"Van Engelen, J.E., Hoos, H.H.: A survey on semi-supervised learning. Mach. Learn. 109(2), 373\u2013440 (2020). https:\/\/doi.org\/10.1007\/s10994-019-05855-6","journal-title":"Mach. Learn."},{"key":"19_CR21","unstructured":"Wagstaff, K., Cardie, C., Rogers, S., Schr\u00f6dl, S.: Constrained k-means clustering with background knowledge. In: ICML, pp. 577\u2013584 (2001)"}],"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-75823-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T17:05:15Z","timestamp":1745427915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75823-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,25]]},"ISBN":["9783031758225","9783031758232"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75823-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,25]]},"assertion":[{"value":"25 October 2024","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":"Providence, RI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"5 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.sisap.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}