{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:06:39Z","timestamp":1770815199928,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319265315","type":"print"},{"value":"9783319265322","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26532-2_74","type":"book-chapter","created":{"date-parts":[[2016,3,23]],"date-time":"2016-03-23T21:06:19Z","timestamp":1458767179000},"page":"671-679","source":"Crossref","is-referenced-by-count":3,"title":["Prototype Selection on Large and Streaming Data"],"prefix":"10.1007","author":[{"given":"Lakhpat","family":"Meena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. Susheela","family":"Devi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"74_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"TM Cover","year":"1967","unstructured":"Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theor. (IT) 13, 21\u201327 (1967)","journal-title":"IEEE Trans. Inf. Theor. (IT)"},{"issue":"3","key":"74_CR2","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"14","author":"PE Hart","year":"1968","unstructured":"Hart, P.E.: The condensed nearest neighbor rule. IEEE Trans. Inf. Theor. (IT) 14(3), 515\u2013516 (1968)","journal-title":"IEEE Trans. Inf. Theor. (IT)"},{"issue":"3","key":"74_CR3","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","volume":"18","author":"GW Gates","year":"1972","unstructured":"Gates, G.W.: The reduced nearest neighbour rule. IEEE Trans. Inf. Theor. (IT) 18(3), 431\u2013433 (1972)","journal-title":"IEEE Trans. Inf. Theor. (IT)"},{"key":"74_CR4","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/S0031-3203(00)00184-9","volume":"35","author":"VS Devi","year":"2002","unstructured":"Devi, V.S., Murty, M.N.: An incremental prototype set building technique. Pattern Recogn. 35, 505\u2013513 (2002)","journal-title":"Pattern Recogn."},{"key":"74_CR5","doi-asserted-by":"crossref","unstructured":"Angiulli, F.: Fast condensed nearest neighbor rule. In: Proceedings of 22nd International Conference on Machine Learning (ICML 2005) (2005)","DOI":"10.1145\/1102351.1102355"},{"issue":"1","key":"74_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1109\/TNN.2002.804315","volume":"14","author":"B Karacali","year":"2003","unstructured":"Karacali, B., Krim, H.: Fast minimization of structural risk by nearest neighbor rule. IEEE Trans. Neural Netw. 14(1), 127\u2013134 (2003)","journal-title":"IEEE Trans. Neural Netw."},{"key":"74_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/11564126_15","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"Y-N Law","year":"2005","unstructured":"Law, Y.-N., Zaniolo, C.: An adaptive nearest neighbor classification algorithm for data streams. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol. 3721, pp. 108\u2013120. Springer, Heidelberg (2005)"},{"issue":"6","key":"74_CR8","doi-asserted-by":"crossref","first-page":"627","DOI":"10.3233\/IDA-2007-11604","volume":"11","author":"J Beringer","year":"2007","unstructured":"Beringer, J., H\u00fcllermeier, E.: Efficient instance-based learning on data streams. Intell. Data Anal. 11(6), 627\u2013650 (2007)","journal-title":"Intell. Data Anal."},{"key":"74_CR9","doi-asserted-by":"publisher","first-page":"3162","DOI":"10.1016\/j.patcog.2010.03.012","volume":"43","author":"K Tabata","year":"2010","unstructured":"Tabata, K., Sato, M., Kudo, M.: Data compression by volume prototypes for streaming data. Pattern Recogn. 43, 3162\u20133176 (2010)","journal-title":"Pattern Recogn."},{"key":"74_CR10","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TPAMI.2011.142","volume":"34","author":"S Garcia","year":"2012","unstructured":"Garcia, S., Derrac, J.: Prototype selection for nearest neighbor classification : taxonomy and empirical study. IEEE Trans. PAMI 34, 417\u2013435 (2012)","journal-title":"IEEE Trans. PAMI"},{"key":"74_CR11","doi-asserted-by":"crossref","unstructured":"Czarnowski, I., Jedrzejowicz, P.: Ensemble classifier for mining data streams. In: 18th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems(KES 2014), Procedia Computer Science, vol. 35, pp. 397\u2013406 (2014)","DOI":"10.1016\/j.procs.2014.08.120"},{"issue":"4","key":"74_CR12","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."},{"key":"74_CR13","unstructured":"Gadodiya, S.V., Chandak, M.B.: Prototype selection algorithms for kNN classifier: a survey. Int. J. Adv. Res. Comput. Commun. Eng. (IJARCCE) 2(12) (2013)"},{"issue":"10","key":"74_CR14","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1016\/j.patcog.2013.03.004","volume":"46","author":"N Verbiest","year":"2013","unstructured":"Verbiest, N., Cornelis, C., Herrera, F.: FRPS : a fuzzy rough prototype selection method. Pattern Recogn. 46(10), 2770\u20132782 (2013)","journal-title":"Pattern Recogn."},{"key":"74_CR15","doi-asserted-by":"crossref","unstructured":"Li, J., Wang, Y.: A nearest prototype selection algorithm using multi-objective optimization and partition. In: 9th International Conference on Computational Intelligence and Security, pp. 264\u2013268, December 2013","DOI":"10.1109\/CIS.2013.62"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26532-2_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T16:57:51Z","timestamp":1559321871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26532-2_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319265315","9783319265322"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26532-2_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}