{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:34:09Z","timestamp":1770338049978,"version":"3.49.0"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030865139","type":"print"},{"value":"9783030865146","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-86514-6_33","type":"book-chapter","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T12:05:38Z","timestamp":1631189138000},"page":"535-551","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["SPOT: A Framework for Selection of Prototypes Using Optimal Transport"],"prefix":"10.1007","author":[{"given":"Karthik S.","family":"Gurumoorthy","sequence":"first","affiliation":[]},{"given":"Pratik","family":"Jawanpuria","sequence":"additional","affiliation":[]},{"given":"Bamdev","family":"Mishra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,10]]},"reference":[{"key":"33_CR1","unstructured":"Arjovsky, M., Chintala, S., Bottou, L.: Wasserstein generative adversarial networks. In: ICML (2017)"},{"issue":"4","key":"33_CR2","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1214\/11-AOAS495","volume":"5","author":"J Bien","year":"2011","unstructured":"Bien, J., Tibshirani, R.: Prototype selection for interpretable classification. Ann. Appl. Stat. 5(4), 2403\u20132424 (2011)","journal-title":"Ann. Appl. Stat."},{"issue":"495","key":"33_CR3","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1198\/jasa.2011.tm10183","volume":"106","author":"J Bien","year":"2011","unstructured":"Bien, J., Tibshirani, R.: Hierarchical clustering with prototypes via minimax linkage. J. Am. Stat. Assoc. 106(495), 1075\u20131084 (2011)","journal-title":"J. Am. Stat. Assoc."},{"key":"33_CR4","unstructured":"Canas, G., Rosasco, L.: Learning probability measures with respect to optimal transport metrics. In: NeurIPS (2012)"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Caruana, R., Lou, Y., Gehrke, J., Koch, P., Sturm, M., Elhadad, N.: Intelligible models for healthcare. In: SIGKDD (2015)","DOI":"10.1145\/2783258.2788613"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Courty, N., Flamary, R., Habrard, A., Rakotomamonjy, A.: Joint distribution optimal transportation for domain adaptation. In: NeurIPS (2017)","DOI":"10.1109\/TPAMI.2016.2615921"},{"issue":"9","key":"33_CR7","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1109\/TPAMI.2016.2615921","volume":"39","author":"N Courty","year":"2017","unstructured":"Courty, N., Flamary, R., Tuia, D., Rakotomamonjy, A.: Optimal transport for domain adaptation. TPAMI 39(9), 1853\u20131865 (2017)","journal-title":"TPAMI"},{"key":"33_CR8","unstructured":"Crammer, K., Gilad-Bachrach, R., Navot, A., Tishby, N.: Margin analysis of the LVQ algorithm. In: NeurIPS (2002)"},{"issue":"1","key":"33_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF02018661","volume":"2","author":"I Csisz\u00e1r","year":"1972","unstructured":"Csisz\u00e1r, I.: A class of measures of informativity of observation channels. Period. Math. Hung. 2(1), 191\u2013213 (1972)","journal-title":"Period. Math. Hung."},{"key":"33_CR10","unstructured":"Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. In: NeurIPS (2013)"},{"key":"33_CR11","unstructured":"Cuturi, M., Doucet, A.: Fast computation of Wasserstein barycenters. In: ICML (2014)"},{"key":"33_CR12","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection. In: ICML (2011)"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Dhurandhar, A., Gurumoorthy, K.S.: Classifier invariant approach to learn from positive-unlabeled data. In: IEEE ICDM (2020)","DOI":"10.1109\/ICDM50108.2020.00019"},{"key":"33_CR14","unstructured":"Donahue, J., et al.: DeCAF: a deep convolutional activation feature for generic visual recognition. In: ICML (2014)"},{"key":"33_CR15","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017)"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"3539","DOI":"10.1214\/17-AOS1679","volume":"46","author":"E Elenberg","year":"2018","unstructured":"Elenberg, E., Khanna, R., Dimakis, A.G., Negahban, S.: Restricted strong convexity implies weak submodularity. Ann. Stat. 46, 3539\u20133568 (2018)","journal-title":"Ann. Stat."},{"key":"33_CR17","unstructured":"Feydy, J., S\u00e9journ\u00e9, T., Vialard, F.X., Amari, S., Trouv\u00e9, A., Peyr\u00e9, G.: Interpolating between optimal transport and MMD using Sinkhorn divergences. In: AISTATS (2018)"},{"key":"33_CR18","unstructured":"Frogner, C., Zhang, C., Mobahi, H., Araya-Polo, M., Poggio, T.: Learning with a Wasserstein loss. In: NeurIPS (2015)"},{"key":"33_CR19","unstructured":"Fujishige, S.: Submodular Functions and Optimization. Elsevier (2005)"},{"key":"33_CR20","unstructured":"Gong, B., Shi, Y., Sha, F., Grauman, K.: Geodesic flow kernel for unsupervised domain adaptation. In: CVPR (2012)"},{"issue":"25","key":"33_CR21","first-page":"723","volume":"13","author":"A Gretton","year":"2012","unstructured":"Gretton, A., Borgwardt, K.M., Rasch, M., Sch\u00f6lkopf, B., Smola, A.J.: A kernel two-sample test. J. Mach. Learn. Res. 13(25), 723\u2013773 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Gurumoorthy, K.S., Dhurandhar, A., Cecchi, G., Aggarwal, C.: Efficient data representation by selecting prototypes with importance weights. In: IEEE ICDM (2019)","DOI":"10.1109\/ICDM.2019.00036"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Gurumoorthy, K.S., Jawanpuria, P., Mishra, B.: SPOT: a framework for selection of prototypes using optimal transport. Technical report, arXiv preprint arXiv:2103.10159 (2021)","DOI":"10.1007\/978-3-030-86514-6_33"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: CVPR (2016)","DOI":"10.1109\/CVPR.2016.90"},{"issue":"5","key":"33_CR25","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/34.291440","volume":"16","author":"J Hull","year":"1994","unstructured":"Hull, J.: A database for handwritten text recognition research. TPAMI 16(5), 550\u2013554 (1994)","journal-title":"TPAMI"},{"issue":"1","key":"33_CR26","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10115-016-0976-2","volume":"51","author":"T Id\u00e9","year":"2017","unstructured":"Id\u00e9, T., Dhurandhar, A.: Supervised item response models for informative prediction. Knowl. Inf. Syst. 51(1), 235\u2013257 (2017)","journal-title":"Knowl. Inf. Syst."},{"key":"33_CR27","unstructured":"Jawanpuria, P., Dev, S., Mishra, B.: Efficient robust optimal transport: formulations and algorithms. Technical report, arXiv preprint arXiv:2010.11852 (2020)"},{"key":"33_CR28","doi-asserted-by":"crossref","unstructured":"Jawanpuria, P., Meghwanshi, M., Mishra, B.: Geometry-aware domain adaptation for unsupervised alignment of word embeddings. In: ACL (2020)","DOI":"10.18653\/v1\/2020.acl-main.276"},{"key":"33_CR29","first-page":"199","volume":"37","author":"L Kantorovich","year":"1942","unstructured":"Kantorovich, L.: On the translocation of masses. Doklady Acad. Sci. USSR 37, 199\u2013201 (1942)","journal-title":"Doklady Acad. Sci. USSR"},{"key":"33_CR30","unstructured":"Kim, B., Khanna, R., Koyejo, O.: Examples are not enough, learn to criticize! criticism for interpretability. In: NeurIPS (2016)"},{"key":"33_CR31","unstructured":"Kim, B., Rudin, C., Shah, J.: The Bayesian case model: a generative approach for case-based reasoning and prototype classification. In: NeurIPS (2014)"},{"issue":"1","key":"33_CR32","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1137\/060659624","volume":"30","author":"PA Knight","year":"2008","unstructured":"Knight, P.A.: The Sinkhorn-Knopp algorithm: convergence and applications. SIAM J. Matrix Anal. Appl. 30(1), 261\u2013275 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"33_CR33","unstructured":"Koh, P.W., Liang, P.: Understanding black-box predictions via influence functions. In: ICML (2017)"},{"issue":"11","key":"33_CR34","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"issue":"4","key":"33_CR35","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10208-011-9093-5","volume":"11","author":"F M\u00e9moli","year":"2011","unstructured":"M\u00e9moli, F.: Gromov-Wasserstein distances and the metric approach to object matching. Found. Comput. Math. 11(4), 417\u2013487 (2011)","journal-title":"Found. Comput. Math."},{"issue":"235","key":"33_CR36","first-page":"1","volume":"17","author":"B Mirzasoleiman","year":"2016","unstructured":"Mirzasoleiman, B., Karbasi, A., Sarkar, R., Krause, A.: Distributed submodular maximization. J. Mach. Learn. Res. 17(235), 1\u201344 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"33_CR37","unstructured":"Nath, J.S., Jawanpuria, P.: Statistical optimal transport posed as learning kernel mean embedding. In: NeurIPS (2020)"},{"key":"33_CR38","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"5\u20136","key":"33_CR39","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9, G., Cuturi, M.: Computational optimal transport. Found. Trends Mach. Learn. 11(5\u20136), 355\u2013607 (2019)","journal-title":"Found. Trends Mach. Learn."},{"key":"33_CR40","unstructured":"Peyr\u00e9, G., Cuturi, M., Solomon, J.: Gromov-Wasserstein averaging of kernel and distance matrices. In: ICML (2016)"},{"key":"33_CR41","volume-title":"Dataset Shift in Machine Learning","author":"J Quionero-Candela","year":"2009","unstructured":"Quionero-Candela, J., Sugiyama, M., Schwaighofer, A., Lawrence, N.: Dataset Shift in Machine Learning. The MIT Press, Cambridge (2009)"},{"key":"33_CR42","doi-asserted-by":"crossref","unstructured":"Ribeiro, M., Singh, S., Guestrin, C.: Why should I trust you? Explaining the predictions of any classifier. In: SIGKDD (2016)","DOI":"10.18653\/v1\/N16-3020"},{"key":"33_CR43","volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis","author":"PJ Rousseeuw","year":"2009","unstructured":"Rousseeuw, P.J., Kaufman, L.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, Hoboken (2009)"},{"issue":"2","key":"33_CR44","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y Rubner","year":"2000","unstructured":"Rubner, Y., Tomasi, C., Guibas, L.J.: The earth mover\u2019s distance as a metric for image retrieval. IJCV 40(2), 99\u2013121 (2000)","journal-title":"IJCV"},{"issue":"3","key":"33_CR45","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s11263-015-0816-y","volume":"115","author":"O Russakovsky","year":"2015","unstructured":"Russakovsky, O., et al.: ImageNet large scale visual recognition challenge. Int. J. Comput. Vis. 115(3), 211\u2013252 (2015). https:\/\/doi.org\/10.1007\/s11263-015-0816-y","journal-title":"Int. J. Comput. Vis."},{"key":"33_CR46","doi-asserted-by":"crossref","unstructured":"Schubert, E., Rousseeuw, P.J.: Faster k-Medoids clustering: improving the PAM, CLARA, and CLARANS algorithms. In: International Conference on Similarity Search and Applications (2019)","DOI":"10.1007\/978-3-030-32047-8_16"},{"key":"33_CR47","doi-asserted-by":"crossref","unstructured":"Smola, A., Gretton, A., Song, L., Sch\u00f6lkopf, B.: A Hilbert space embedding for distributions. In: International Conference on Algorithmic Learning Theory (2007)","DOI":"10.1007\/978-3-540-75225-7_5"},{"key":"33_CR48","doi-asserted-by":"crossref","unstructured":"Solomon, J., et al.: Convolutional Wasserstein distances: efficient optimal transportation on geometric domains. ACM Trans. Graph. 34(4), 66:1\u201366:11 (2015)","DOI":"10.1145\/2766963"},{"issue":"2","key":"33_CR49","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/2812802","volume":"59","author":"B Thomee","year":"2016","unstructured":"Thomee, B., et al.: YFCC100M: the new data in multimedia research. Commun. ACM 59(2), 64\u201373 (2016)","journal-title":"Commun. ACM"},{"issue":"10","key":"33_CR50","doi-asserted-by":"publisher","first-page":"6567","DOI":"10.1073\/pnas.082099299","volume":"99","author":"R Tibshirani","year":"2002","unstructured":"Tibshirani, R., Hastie, T., Narasimhan, B., Chu, G.: Diagnosis of multiple cancer types by shrunken centroids of gene expression. PNAS 99(10), 6567\u20136572 (2002)","journal-title":"PNAS"},{"key":"33_CR51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal Transport: Old and New","author":"C Villani","year":"2009","unstructured":"Villani, C.: Optimal Transport: Old and New. Springer, Heidelberg (2009)"},{"key":"33_CR52","unstructured":"Wei, K., Iyer, R., Bilmes, J.: Submodularity in data subset selection and active learning. In: ICML (2015)"},{"issue":"7","key":"33_CR53","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1145\/358557.358577","volume":"25","author":"M Weiser","year":"1982","unstructured":"Weiser, M.: Programmers use slices when debugging. Commun. ACM 25(7), 446\u2013452 (1982)","journal-title":"Commun. ACM"},{"key":"33_CR54","doi-asserted-by":"crossref","unstructured":"Wohlhart, P., K\u00f6stinger, M., Donoser, M., Roth, P., Bischof, H.: Optimizing 1-nearest prototype classifiers. In: CVPR (2013)","DOI":"10.1109\/CVPR.2013.66"},{"key":"33_CR55","unstructured":"Yeh, C.K., Kim, J., Yen, I.E.H., Ravikumar, P.K.: Representer point selection for explaining deep neural networks. In: NeurIPS (2018)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases. Applied Data Science Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86514-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T22:09:16Z","timestamp":1757369356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86514-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030865139","9783030865146"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86514-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 September 2021","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":"Bilbao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2021.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"869","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":"210","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":"0","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":"24% - 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-4","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":"3-9","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}