{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T04:46:06Z","timestamp":1726029966847},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030209117"},{"type":"electronic","value":"9783030209124"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-20912-4_53","type":"book-chapter","created":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:02:29Z","timestamp":1558911749000},"page":"583-594","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast Algorithm for Prototypes Selection\u2014Trust-Margin Prototypes"],"prefix":"10.1007","author":[{"given":"Norbert","family":"Jankowski","sequence":"first","affiliation":[]},{"given":"Marek","family":"Orli\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,24]]},"reference":[{"issue":"1","key":"53_CR1","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":"53_CR2","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."},{"issue":"3","key":"53_CR3","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","volume":"18","author":"G Gates","year":"1972","unstructured":"Gates, G.: The reduced nearest neighbor rule. IEEE Trans. Inf. Theory 18(3), 431\u2013433 (1972)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"53_CR4","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"},{"issue":"3","key":"53_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."},{"issue":"3","key":"53_CR6","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."},{"key":"53_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-540-24844-6_90","volume-title":"Artificial Intelligence and Soft Computing - ICAISC 2004","author":"N Jankowski","year":"2004","unstructured":"Jankowski, N., Grochowski, M.: Comparison of instances seletion algorithms I. Algorithms survey. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol. 3070, pp. 598\u2013603. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24844-6_90"},{"key":"53_CR8","unstructured":"Blachnik, M.: Metody bazuj\u0105ce na prototypach w zastosowaniu do eksploracji danych. Silesian Technical University (2019)"},{"key":"53_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-319-59063-9_32","volume-title":"Artificial Intelligence and Soft Computing","author":"M Kordos","year":"2017","unstructured":"Kordos, M.: Optimization of evolutionary instance selection. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2017. LNCS (LNAI), vol. 10245, pp. 359\u2013369. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59063-9_32"},{"key":"53_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.knosys.2016.05.056","volume":"107","author":"\u00c1 Arnaiz-Gonz\u00e1lez","year":"2016","unstructured":"Arnaiz-Gonz\u00e1lez, \u00c1., 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)","journal-title":"Knowl.-Based Syst."},{"issue":"6","key":"53_CR11","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/S0167-8655(97)00035-4","volume":"18","author":"J Sanchez","year":"1997","unstructured":"Sanchez, J., Pla, F., Ferri, F.: Prototype selection for the nearest neighbor rule through proximity graphs. Pattern Recognit. Lett. 18(6), 507\u2013513 (1997)","journal-title":"Pattern Recognit. Lett."},{"issue":"8","key":"53_CR12","doi-asserted-by":"publisher","first-page":"2693","DOI":"10.1016\/j.patcog.2008.02.006","volume":"41","author":"S Garcia","year":"2008","unstructured":"Garcia, S., Cano, J., Herrera, F.: A memetic algorithm for evolutionary prototype selection: a scaling up approach. Pattern Recognit. 41(8), 2693\u20132709 (2008)","journal-title":"Pattern Recognit."},{"key":"53_CR13","doi-asserted-by":"crossref","unstructured":"Skalak, D.B.: Prototype and feature selection by sampling and random mutation hill climbing algorithms. In: International Conference on Machine Learning, New Brunswick, NJ, USA, pp. 293\u2013301 (1994)","DOI":"10.1016\/B978-1-55860-335-6.50043-X"},{"key":"53_CR14","first-page":"997","volume":"9","author":"E Marchiori","year":"2008","unstructured":"Marchiori, E.: Hit miss networks with applications to instance selection. J. Mach. Learn. Res. 9, 997\u20131017 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"53_CR15","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1109\/TPAMI.2009.164","volume":"32","author":"E Marchiori","year":"2010","unstructured":"Marchiori, E.: Class conditional nearest neighbor for large margin instance selection. IEEE Trans. Pattern Anal. Mach. Intell. 32(2), 364\u2013370 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"53_CR16","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1109\/TKDE.2007.190645","volume":"19","author":"F Angiulli","year":"2007","unstructured":"Angiulli, F.: Fast nearest neighbor condensation for large data sets classification. IEEE Trans. Knowl. Data Eng. 19(11), 1450\u20131464 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1\/2","key":"53_CR17","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1022686102325","volume":"20","author":"C Brodley","year":"1995","unstructured":"Brodley, C.: Recursive automatic bias selection for classifier construction. Mach. Learn. 20(1\/2), 63\u201394 (1995)","journal-title":"Mach. Learn."},{"issue":"6","key":"53_CR18","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1109\/TEVC.2003.819265","volume":"7","author":"JR Cano","year":"2003","unstructured":"Cano, J.R., Herrera, F., Lozano, M.: Using evolutionary algorithms as instance selection for data reduction in KDD: an experimental study. IEEE Trans. Evol. Comput. 7(6), 561\u2013575 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"8","key":"53_CR19","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/0167-8655(95)00047-K","volume":"16","author":"L Kuncheva","year":"1995","unstructured":"Kuncheva, L.: Editing for the k-nearest neighbors rule by a genetic algorithm. Pattern Recognit. Lett. 16(8), 809\u2013814 (1995)","journal-title":"Pattern Recognit. Lett."},{"issue":"1","key":"53_CR20","first-page":"37","volume":"6","author":"DW Aha","year":"1991","unstructured":"Aha, D.W., Kibler, D., Albert, M.K.: Instance-based learning algorithms. Mach. Learn. 6(1), 37\u201366 (1991)","journal-title":"Mach. Learn."},{"issue":"4","key":"53_CR21","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1016\/S0031-3203(02)00119-X","volume":"36","author":"J Riquelme","year":"2003","unstructured":"Riquelme, J., Aguilar-Ruiz, J., Toro, M.: Finding representative patterns with ordered projections. Pattern Recognit. 36(4), 1009\u20131018 (2003)","journal-title":"Pattern Recognit."},{"issue":"6","key":"53_CR22","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1142\/S0218001405004332","volume":"19","author":"R Barandela","year":"2005","unstructured":"Barandela, R., Ferri, F., Sanchez, J.: Decision boundary preserving prototype selection for nearest neighbor classification. Int. J. Pattern Recognit. Artif. Intell. 19(6), 787\u2013806 (2005)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"issue":"3","key":"53_CR23","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. Theory 14(3), 515\u2013516 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"53_CR24","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0031-3203(99)00068-0","volume":"33","author":"K Hattori","year":"2000","unstructured":"Hattori, K., Takahashi, M.: A new edited k-nearest neighbor rule in the pattern classification problem. Pattern Recognit. 33(3), 521\u2013528 (2000)","journal-title":"Pattern Recognit."},{"key":"53_CR25","unstructured":"Zhao, K., Zhou, S., Guan, J., Zhou, A.: C-pruner: an improved instance pruning algorithm. In: Proceedings of Second International Conference on Machine Learning and Cybernetics, Xi\u2019an, China, pp. 94\u201399 (2003)"},{"key":"53_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-540-25945-9_61","volume-title":"Current Topics in Artificial Intelligence","author":"MT Lozano","year":"2003","unstructured":"Lozano, M.T., S\u00e1nchez, J.S., Pla, F.: Using the geometrical distribution of prototypes for training set condensing. In: Conejo, R., Urretavizcaya, M., P\u00e9rez-de-la-Cruz, J.L. (eds.) TTIA 2003. LNCS, vol. 3040, pp. 618\u2013627. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-25945-9_61"},{"issue":"2","key":"53_CR27","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/S0031-3203(00)00184-9","volume":"35","author":"V Devi","year":"2002","unstructured":"Devi, V., Murty, M.: An incremental prototype set building technique. Pattern Recognit. 35(2), 505\u2013513 (2002)","journal-title":"Pattern Recognit."},{"issue":"2","key":"53_CR28","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."},{"key":"53_CR29","unstructured":"Yianilos, P.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 311\u2013321 (1993)"},{"key":"53_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-293-5","volume-title":"R-Trees: Theory and Applications","author":"Y Manolopoulos","year":"2006","unstructured":"Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-Trees: Theory and Applications. Springer, London (2006). https:\/\/doi.org\/10.1007\/978-1-84628-293-5"},{"issue":"1","key":"53_CR31","first-page":"50","volume":"4","author":"R Brown","year":"2015","unstructured":"Brown, R.: Building a balanced k-d tree in $$O(kn \\log n$$ ) time. J. Comput. Graph. Tech. 4(1), 50\u201368 (2015)","journal-title":"J. Comput. Graph. Tech."},{"key":"53_CR32","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":"53_CR33","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, Chiba, Japan, pp. 651\u2013660 (2005)","DOI":"10.1145\/1060745.1060840"},{"key":"53_CR34","unstructured":"Merz, C.J., Murphy, P.M.: UCI repository of machine learning databases (1998). http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"53_CR35","unstructured":"Cameron-Jones, R.M.: Instance selection by encoding length heuristic with random mutation hill climbing. In: Proceedings of the Eighth Australian Joint Conference on Artificial Intelligence, Australia, pp. 99\u2013106 (1995)"},{"key":"53_CR36","doi-asserted-by":"crossref","first-page":"301","DOI":"10.7551\/mitpress\/7496.003.0015","volume-title":"Large-Scale Kernel Machines","author":"G Loosli","year":"2007","unstructured":"Loosli, G., Canu, S., Bottou, L.: Training invariant support vector machines using selective sampling. In: Bottou, L., Chapelle, O., DeCoste, D., Weston, J. (eds.) Large-Scale Kernel Machines, pp. 301\u2013320. MIT Press, Cambridge (2007)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20912-4_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T22:35:54Z","timestamp":1694903754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20912-4_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030209117","9783030209124"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20912-4_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Soft Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zakopane","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/icaisc.eu\/About","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Own online software","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"333","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"122","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"37% - 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"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"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"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}