{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T14:22:12Z","timestamp":1780582932774,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540749752","type":"print"},{"value":"9783540749769","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74976-9_58","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T10:52:35Z","timestamp":1188384755000},"page":"556-564","source":"Crossref","is-referenced-by-count":2,"title":["A Cooperative Game Theoretic Approach to Prototype Selection"],"prefix":"10.1007","author":[{"given":"Narayanan Rama","family":"Suri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V. Santosh","family":"Srinivas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. Narasimha","family":"Murty","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T.M. Cover","year":"1967","unstructured":"Cover, T.M.: Nearest neighbor pattern classification. IEEE Transactions of Information Theory\u00a013, 21\u201327 (1967)","journal-title":"IEEE Transactions of Information Theory"},{"key":"58_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01245567","volume":"22","author":"E. Inarra","year":"1993","unstructured":"Inarra, E., Usategui, J.M.: The shapley value and average convex games. International Journal of Game Theory\u00a022, 13\u201329 (1993)","journal-title":"International Journal of Game Theory"},{"issue":"9","key":"58_CR3","doi-asserted-by":"publisher","first-page":"1887","DOI":"10.1162\/0899766041336387","volume":"16","author":"A. Keinan","year":"2004","unstructured":"Keinan, A., Sandbank, B., Hilgetag, C., Meilijson, I., Ruppin, E.: Fair attribution of functional contribution in artificial and biological networks. Journal of Neural Computation\u00a016(9), 1887\u20131915 (2004)","journal-title":"Journal of Neural Computation"},{"key":"58_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Natural Computation","author":"Y. Li","year":"2005","unstructured":"Li, Y., Hu, Z., Cai, Y., Zhang, W.: Support Vector Based Prototype Selection Method for Nearest Neighbor Rules. In: Advances in Natural Computation. LNCS, Springer, Berlin (2005)"},{"key":"58_CR5","unstructured":"Murphy, P.M., Aha, D.W.: UCI repository of machine learning databases (1994)"},{"key":"58_CR6","unstructured":"Myerson, R.B.: Game Theory: Analysis of Conflict. Harvard University Press (1997)"},{"key":"58_CR7","doi-asserted-by":"crossref","unstructured":"Sanchez, J.S., Barandela, R., Alejo, R., Marques, A.I.: Performance evaluation of prototype selection algorithms for nearest neighbor classification. In: SIBGRAPI 2001. Proceedings of 14th Brazilian Symposium on Computer Graphics and Image Processing (2001)","DOI":"10.1109\/SIBGRAPI.2001.963036"},{"issue":"1","key":"58_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"L.S. Shapley","year":"1971","unstructured":"Shapley, L.S.: Cores of convex games. International Journal of Game Theory\u00a01(1), 11\u201326 (1971)","journal-title":"International Journal of Game Theory"},{"key":"58_CR9","unstructured":"Straffin, P.D.: Game Theory and Strategy. The Mathematical Association of America (1993)"},{"issue":"3","key":"58_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"D.R. Wilson","year":"2000","unstructured":"Wilson, D.R., Martinez, T.R.: Reduction techniques for instance-based learing algorithms. Machine Learning\u00a038(3), 257\u2013286 (2000)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74976-9_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:50:24Z","timestamp":1619520624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74976-9_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749752","9783540749769"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74976-9_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}