{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T08:40:05Z","timestamp":1751704805098,"version":"3.41.0"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031976346"},{"type":"electronic","value":"9783031976353"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-97635-3_17","type":"book-chapter","created":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T07:41:54Z","timestamp":1751701314000},"page":"138-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Instance Selection by\u00a0Fast Local Set Border Selector"],"prefix":"10.1007","author":[{"given":"Norbert","family":"Jankowski","sequence":"first","affiliation":[]},{"given":"Mateusz","family":"Skarupski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,6]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/A:1014043630878","volume":"6","author":"H Brighton","year":"2002","unstructured":"Brighton, H., Mellish, C.: Advances in instance selection for instance-based learning algorithms. Data Min. Knowl. Disc. 6(2), 153\u2013172 (2002)","journal-title":"Data Min. Knowl. Disc."},{"issue":"1","key":"17_CR2","first-page":"21","volume":"13","author":"TM Cover","year":"1967","unstructured":"Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. Inst. Electr. Electron. Eng. Trans. Inf. Theory 13(1), 21\u201327 (1967)","journal-title":"Inst. Electr. Electron. Eng. Trans. Inf. Theory"},{"issue":"3","key":"17_CR3","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., Cano, J., Herrera, F.: 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."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Jankowski, N., Grochowski, M.: Comparison of instances selection algorithms: II. Algorithms survey. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds.) Artificial Intelligence and Soft Computing, Lecture Notes in Computer Science, vol.\u00a03070, pp. 598\u2013603. Springer, Poland, Zakopane (2004). http:\/\/www.is.umk.pl\/~norbert\/publications\/04-zakopane-NJMG.pdf","DOI":"10.1007\/978-3-540-24844-6_90"},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Jankowski, N.: A fast and efficient algorithm for filtering the training dataset. In: Neural Information Processing, vol. 13623, pp. 504\u2013512. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-30105-6_42","DOI":"10.1007\/978-3-031-30105-6_42"},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1016\/j.patcog.2014.10.001","volume":"48","author":"E Leyva","year":"2015","unstructured":"Leyva, E., Gonz\u00e1lez, A., P\u00e9rez, R.: Three new instance selection methods based on local sets: a comparative study with several approaches from a bi-objective perspective. Pattern Recogn. 48(4), 1523\u20131537 (2015). https:\/\/doi.org\/10.1016\/j.patcog.2014.10.001","journal-title":"Pattern Recogn."},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2020","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2020). https:\/\/doi.org\/10.1109\/TPAMI.2018.2889473","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"17_CR8","unstructured":"Merz, C.J., Murphy, P.M.: UCI repository of machine learning databases (1998). http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"DR Wilson","year":"2000","unstructured":"Wilson, D.R., Martinez, T.R.: Reduction techniques for instance-based learning algorithms. Mach. Learn. 38(3), 257\u2013286 (2000)","journal-title":"Mach. Learn."},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","volume":"2","author":"D Wilson","year":"1972","unstructured":"Wilson, D.: Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans. Syst. Man Cybern. 2(3), 408\u2013421 (1972)","journal-title":"IEEE Trans. Syst. Man Cybern."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97635-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T08:03:39Z","timestamp":1751702619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97635-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031976346","9783031976353"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97635-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"6 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}