{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T08:24:27Z","timestamp":1751703867458,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031301049"},{"type":"electronic","value":"9783031301056"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30105-6_42","type":"book-chapter","created":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T20:31:55Z","timestamp":1681331515000},"page":"504-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Fast and\u00a0Efficient Algorithm for\u00a0Filtering the\u00a0Training Dataset"],"prefix":"10.1007","author":[{"given":"Norbert","family":"Jankowski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,13]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Arnaiz-Gonz\u00e1lez, A., D\u00edez-Pastor, J.-F., Rodr\u00edguez, J.J., Garc\u00eda-Osorio, C.: Instance selection of linear complexity for big data: Knowl.-Based Syst. 107, 83\u201395 (2016)","DOI":"10.1016\/j.knosys.2016.05.056"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Bawa, M., Condie, T., Ganesan, P.: LSH forest: self-tuning indexes for similarity search. In: Proceedings of the 14th International Conference on World Wide Web, pp. 651\u2013660. Chiba, Japan (2005)","DOI":"10.1145\/1060745.1060840"},{"issue":"2","key":"42_CR3","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":"42_CR4","first-page":"21","volume":"13","author":"TM Cover","year":"1967","unstructured":"Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. Instit. Electr. Electron. Eng. Trans. Inf. Theory 13(1), 21\u201327 (1967)","journal-title":"Instit. Electr. Electron. Eng. Trans. Inf. Theory"},{"issue":"3","key":"42_CR5","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":"42_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.4086\/toc.2012.v008a014","volume":"8","author":"S Har-Peled","year":"2012","unstructured":"Har-Peled, S., Indyk, P., Motwani, R.: Approximate nearest neighbor: towards removing the curse of dimensionality. Theory Comput. 8, 321\u2013350 (2012)","journal-title":"Theory Comput."},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbor\u2014towards removing the curse of dimensionality. In: The Thirtieth Annual ACM Symposium on Theory of Computing, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/978-3-540-24844-6_87","volume-title":"Artificial Intelligence and Soft Computing - ICAISC 2004","author":"M Grochowski","year":"2004","unstructured":"Grochowski, M., Jankowski, N.: Comparison of instance selection algorithms II. results and comments. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol. 3070, pp. 580\u2013585. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24844-6_87"},{"key":"42_CR9","unstructured":"Jankowski, N., Orli\u0144ski, M.: Fast encoding length-based prototype selection algorithms. Australian J. Intell. Inf. Process. Syst. 16(3), 59\u201366 (2019). Special Issue: Neural Information Processing 26th International Conference on Neural Information Processing. http:\/\/ajiips.com.au\/iconip2019\/docs\/ajiips\/v16n3.pdf"},{"issue":"4","key":"42_CR10","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."},{"key":"42_CR11","unstructured":"Merz, C.J., Murphy, P.M.: UCI repository of machine learning databases (1998). http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"issue":"2","key":"42_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10044-008-0142-x","volume":"13","author":"JA Olvera-L\u00f3pez","year":"2009","unstructured":"Olvera-L\u00f3pez, J.A., Carrasco-Ochoa, J.A., Mart\u00ednez-Trinidad, J.F.: A new fast prototype selection method based on clustering. Pattern Anal. Appl. 13(2), 131\u2013141 (2009)","journal-title":"Pattern Anal. Appl."},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2020.106318","volume":"206","author":"M Orli\u0144ski","year":"2020","unstructured":"Orli\u0144ski, M., Jankowski, N.: Fast t-SNE algorithm with forest of balanced LSH trees and hybrid computation of repulsive forces. Knowl.-Based Syst. 206, 1\u201316 (2020). https:\/\/doi.org\/10.1016\/j.knosys.2020.106318","journal-title":"Knowl.-Based Syst."},{"key":"42_CR14","doi-asserted-by":"publisher","unstructured":"Orli\u0144ski, M., Jankowski, N.: $$O(m \\log m)$$ instance selection algorithms\u2013RR-DROPs. In: IEEE World Congress on Computational Intelligence, pp. 1\u20138. IEEE Press (2020). https:\/\/doi.org\/10.1109\/IJCNN48605.2020.9207158. http:\/\/www.is.umk.pl\/~norbert\/publications\/20-FastDROP.pdf","DOI":"10.1109\/IJCNN48605.2020.9207158"},{"issue":"3","key":"42_CR15","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","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30105-6_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T20:37:25Z","timestamp":1681331845000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30105-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031301049","9783031301056"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30105-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Delhi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iconip2022.apnns.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"810","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":"359","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":"44% - 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":"2.65","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","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":"ICONIP 2022 consists of a two-volume set, LNCS & CCIS, which includes 146 and 213 papers","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)"}}]}}