{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:20:32Z","timestamp":1773883232238,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030158422","type":"print"},{"value":"9783030158439","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-15843-9_2","type":"book-chapter","created":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T12:02:38Z","timestamp":1552478558000},"page":"13-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the k-Medoids Model for Semi-supervised Clustering"],"prefix":"10.1007","author":[{"given":"Rodrigo","family":"Randel","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Aloise","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,14]]},"reference":[{"issue":"1\u20133","key":"2_CR1","first-page":"191","volume":"79","author":"P Hansen","year":"1997","unstructured":"Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Math. Program. 79(1\u20133), 191\u2013215 (1997)","journal-title":"Math. Program."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/TPAMI.1980.4767027","volume":"4","author":"M Delattre","year":"1980","unstructured":"Delattre, M., Hansen, P.: Bicriterion cluster analysis. IEEE TPAMI 4, 277\u2013291 (1980)","journal-title":"IEEE TPAMI"},{"key":"2_CR3","doi-asserted-by":"crossref","DOI":"10.1201\/b15410","volume-title":"Data Clustering: Algorithms and Applications","author":"CC Aggarwal","year":"2013","unstructured":"Aggarwal, C.C., Reddy, C.K.: Data Clustering: Algorithms and Applications. Chapman & Hall\/CRC, Boca Raton (2013)"},{"key":"2_CR4","doi-asserted-by":"crossref","DOI":"10.1201\/9781584889977","volume-title":"Constrained Clustering: Advances in Algorithms, Theory, and Applications","author":"S Basu","year":"2008","unstructured":"Basu, S., Davidson, I., Wagstaff, K.: Constrained Clustering: Advances in Algorithms, Theory, and Applications, 1st edn. Chapman & Hall\/CRC, Boca Raton (2008)","edition":"1"},{"issue":"3","key":"2_CR5","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. EJOR 130(3), 449\u2013467 (2001)","journal-title":"EJOR"},{"key":"2_CR6","unstructured":"Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Constrained k-means clustering with background knowledge. In: ICML, pp. 577\u2013584 (2001)"},{"key":"2_CR7","unstructured":"Bekkerman, R., Sahami, M.: Semi-supervised clustering using combinatorial MRFs. In: ICML (2006)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/11871842_49","volume-title":"Machine Learning: ECML 2006","author":"B Yan","year":"2006","unstructured":"Yan, B., Domeniconi, C.: An adaptive kernel method for semi-supervised clustering. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 521\u2013532. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_49"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Law, M.H.C., Topchy, A., Jain, A.K.: Model-based clustering with probabilistic constraints. In: SIAM-SDM, pp. 641\u2013645 (2005)","DOI":"10.1137\/1.9781611972757.77"},{"issue":"3","key":"2_CR10","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10618-009-0157-y","volume":"21","author":"C Ruiz","year":"2010","unstructured":"Ruiz, C., Spiliopoulou, M., Menasalvas, E.: Density-based semi-supervised clustering. Data Min. Knowl. Disc. 21(3), 345\u2013370 (2010)","journal-title":"Data Min. Knowl. Disc."},{"issue":"2","key":"2_CR11","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/s10618-008-0104-3","volume":"18","author":"Y Xia","year":"2009","unstructured":"Xia, Y.: A global optimization method for semi-supervised clustering. Data Min. Knowl. Disc. 18(2), 214\u2013256 (2009)","journal-title":"Data Min. Knowl. Disc."},{"key":"2_CR12","first-page":"1437","volume":"5","author":"H Tuy","year":"1964","unstructured":"Tuy, H.: Concave programming under linear constraints. Soviet Math. 5, 1437\u20131440 (1964)","journal-title":"Soviet Math."},{"issue":"1","key":"2_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10994-008-5084-4","volume":"74","author":"B Kulis","year":"2009","unstructured":"Kulis, B., Basu, S., Dhillon, I., Mooney, R.: Semi-supervised graph clustering: a kernel approach. Mach. Learn. 74(1), 1\u201322 (2009)","journal-title":"Mach. Learn."},{"issue":"5","key":"2_CR14","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, K.R.: Nonlinear component analysis as a kernel eigenvalue problem. Neural Comp. 10(5), 1299\u20131319 (1998)","journal-title":"Neural Comp."},{"key":"2_CR15","volume-title":"Graph Theory: An Algorithmic Approach (Computer Science and Applied Mathematics)","author":"N Christofides","year":"1975","unstructured":"Christofides, N.: Graph Theory: An Algorithmic Approach (Computer Science and Applied Mathematics). Academic Press Inc., Orlando (1975)"},{"key":"2_CR16","unstructured":"Steinley, D.: K-medoids and other criteria for crisp clustering. In: Handbook of Cluster Analysis. Chapman and Hall\/CRC Handbooks of Modern Statistical Methods. CRC Press (2015)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Kaufman, L., Rousseeuw, P.J.: Partitioning around medoids (program PAM). In: Finding Groups in Data: An Introduction to Cluster Analysis, pp. 68\u2013125 (1990)","DOI":"10.1002\/9780470316801.ch2"},{"issue":"5","key":"2_CR18","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"MB Teitz","year":"1968","unstructured":"Teitz, M.B., Bart, P.: Heuristic methods for estimating the generalized vertex median of aweighted graph. Oper. Res. 16(5), 955\u2013961 (1968)","journal-title":"Oper. Res."},{"issue":"2","key":"2_CR19","first-page":"95","volume":"21","author":"R Whitaker","year":"1983","unstructured":"Whitaker, R.: A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR 21(2), 95\u2013108 (1983)","journal-title":"INFOR"},{"issue":"4","key":"2_CR20","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P Hansen","year":"1997","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search for the P-median. Locat. Sci. 5(4), 207\u2013226 (1997)","journal-title":"Locat. Sci."},{"issue":"1","key":"2_CR21","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10479-006-0154-0","volume":"150","author":"MGC Resende","year":"2007","unstructured":"Resende, M.G.C., Werneck, R.F.: A fast swap-based local search procedure for location problems. ANOR 150(1), 205\u2013230 (2007)","journal-title":"ANOR"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Davidson, I., Ravi, S.: Clustering with constraints: feasibility issues and the k-means algorithm. In: SIAM-SDM, pp. 138\u2013149 (2005)","DOI":"10.1137\/1.9781611972757.13"},{"issue":"11","key":"2_CR23","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"2_CR24","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.ins.2017.06.019","volume":"415","author":"LR Costa","year":"2017","unstructured":"Costa, L.R., Aloise, D., Mladenovi\u0107, N.: Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering. Inf. Sci. 415, 247\u2013253 (2017)","journal-title":"Inf. Sci."},{"issue":"12","key":"2_CR25","doi-asserted-by":"crossref","first-page":"4337","DOI":"10.1016\/j.patcog.2012.04.029","volume":"45","author":"P Hansen","year":"2012","unstructured":"Hansen, P., Ruiz, M., Aloise, D.: A VNS heuristic for escaping local extrema entrapment in normalized cut clustering. Pattern Recog. 45(12), 4337\u20134345 (2012)","journal-title":"Pattern Recog."},{"issue":"2","key":"2_CR26","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","volume":"34","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: J-means: a new local search heuristic for minimum sum of squares clustering. Pattern Recog. 34(2), 405\u2013413 (2001)","journal-title":"Pattern Recog."},{"issue":"3","key":"2_CR27","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/j.ejor.2016.03.033","volume":"253","author":"\u00c9 Santi","year":"2016","unstructured":"Santi, \u00c9., Aloise, D., Blanchard, S.J.: A model for clustering data from heterogeneous dissimilarities. EJOR 253(3), 659\u2013672 (2016)","journal-title":"EJOR"},{"key":"2_CR28","unstructured":"Kleinberg, J.: An impossibility theorem for clustering. In: Advances in Neural Information Processing Systems, pp. 463\u2013470 (2003)"},{"issue":"1","key":"2_CR29","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985)","journal-title":"J. Classif."},{"key":"2_CR30","unstructured":"Lichman, M.: UCI machine learning repository (2013)"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Bilenko, M., Basu, S., Mooney, R.J.: Integrating constraints and metric learning in semi-supervised clustering. In: Proceedings of the Twenty-First International Conference on Machine Learning. ICML 2004, pp. 81\u201388. ACM, New York (2004)","DOI":"10.1145\/1015330.1015360"}],"container-title":["Lecture Notes in Computer Science","Variable Neighborhood Search"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15843-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T13:00:36Z","timestamp":1694696436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15843-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030158422","9783030158439"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15843-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICVNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Variable Neighborhood Search","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sithonia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icvns2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/vns2018.uom.gr\/","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"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"47% - 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"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"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"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"14 submissions were accepted for oral presentation only.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}