{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T04:16:44Z","timestamp":1749010604377,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319393773"},{"type":"electronic","value":"9783319393780"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-39378-0_46","type":"book-chapter","created":{"date-parts":[[2016,5,28]],"date-time":"2016-05-28T07:40:51Z","timestamp":1464421251000},"page":"541-551","source":"Crossref","is-referenced-by-count":0,"title":["On the Relation Between kNN\u00a0Accuracy and Dataset Compression Level"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Blachnik","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,29]]},"reference":[{"key":"46_CR1","unstructured":"Asuncion, A., Newman, D.: UCI machine learning repository. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"issue":"9","key":"46_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Duch, W., Wieczorek, T., Biesiada, J., Blachnik, M.: Comparision of feature ranking methods based on information entropy. In: Proceedings of International Joint Conference on Neural Networks, pp. 1415\u20131420. IEEE Press, Budapest (2004)","DOI":"10.1109\/IJCNN.2004.1380157"},{"key":"46_CR4","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of the 25th Very Large Database (VLDB) Conference (1999)"},{"key":"46_CR5","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"16","author":"P Hart","year":"1968","unstructured":"Hart, P.: The condensed nearest neighbor rule. IEEE Trans. Inf. Theory 16, 515\u2013516 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"46_CR6","unstructured":"Herrera, F.: Keel, knowledge extraction based on evolutionary learning (2005). http:\/\/www.keel.es , spanish National Projects TIC2002-04036-C05, TIN2005-08386-C05 and TIN2008-06681-C06"},{"key":"46_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/978-3-642-13208-7_49","volume-title":"Artificial Intelligence and Soft Computing","author":"A Kachel","year":"2010","unstructured":"Kachel, A., Biesiada, J., Blachnik, M., Duch, W.: Infosel++: Information based feature Selection C++ library. In: Rutkowski, L., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2010, Part I. LNCS, vol. 6113, pp. 388\u2013396. Springer, Heidelberg (2010)"},{"key":"46_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5689-3","volume-title":"Feature Selection for Knowledge Discovery and Data Mining","author":"H Liu","year":"1998","unstructured":"Liu, H., Motoda, H.: Feature Selection for Knowledge Discovery and Data Mining. Springer, New York (1998)"},{"key":"46_CR9","unstructured":"Omohundro, S.M.: Five balltree construction algorithms. Technical report. TR-89-063, International Computer Science Institute, December 1989"},{"issue":"3","key":"46_CR10","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TPAMI.2011.142","volume":"34","author":"G Salvador","year":"2012","unstructured":"Salvador, G., Joaquin, D., Jose, R.C., Francisco, H.: Prototype selection for nearest neighbor classification: taxonomy and empirical study. IEEE Trans. Pattern Anal. Mach. Intell. 34(3), 417\u2013435 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"46_CR11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"JK Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/similarity queries with metric trees. Inf. Proc. Lett. 40(4), 175\u2013179 (1991)","journal-title":"Inf. Proc. Lett."},{"key":"46_CR12","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","volume":"2","author":"D Wilson","year":"1972","unstructured":"Wilson, D.: Assymptotic properties of nearest neighbour rules using edited data. IEEE Trans. Syst. Man Cybernetics SMC 2, 408\u2013421 (1972)","journal-title":"IEEE Trans. Syst. Man Cybernetics SMC"},{"key":"46_CR13","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-3-540-36212-8_6","volume-title":"Entropy Measures, Maximum Entropy Principle and Emerging Applications","author":"YY Yao","year":"2003","unstructured":"Yao, Y.Y.: Information-theoretic measures for knowledge discovery and data mining. In: Karmeshu, P. (ed.) Entropy Measures, Maximum Entropy Principle and Emerging Applications. STUDFUZZ, vol. 119, pp. 115\u2013136. Springer, Heidelberg (2003)"},{"key":"46_CR14","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/978-0-387-30164-8_452","volume-title":"Encyclopedia of Machine Learning","author":"C Perlich","year":"2011","unstructured":"Perlich, C.: Learning curves in machine learning. In: Sammut, C., Webb, G.I. (eds.) Encyclopedia of Machine Learning, pp. 577\u2013580. Springer, New York (2011)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39378-0_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T19:53:33Z","timestamp":1748980413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39378-0_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319393773","9783319393780"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39378-0_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}