{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:35:37Z","timestamp":1755801337738,"version":"3.44.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030014179"},{"type":"electronic","value":"9783030014186"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-01418-6_64","type":"book-chapter","created":{"date-parts":[[2018,9,26]],"date-time":"2018-09-26T10:57:36Z","timestamp":1537959456000},"page":"648-658","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Associative Graph Data Structures Used for Acceleration of K Nearest Neighbor Classifiers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9001-4198","authenticated-orcid":false,"given":"Adrian","family":"Horzyk","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4540-1812","authenticated-orcid":false,"given":"Krzysztof","family":"Go\u0142don","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,27]]},"reference":[{"key":"64_CR1","doi-asserted-by":"crossref","unstructured":"Abidin, T., Perrizo, W.: A fast and scalable nearest neighbor based classifier for data mining. In: Proceedings of ACM SAC 2006, Dijon, France, pp. 536\u2013540. ACM Press, New York (2006)","DOI":"10.1145\/1141277.1141403"},{"issue":"1","key":"64_CR2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.19026\/rjaset.13.2886","volume":"13","author":"R Agrawal","year":"2016","unstructured":"Agrawal, R.: Extensions of k-nearest neighbor algorithm. Res. J. Appl. Sci. Eng. Technol. 13(1), 24\u201329 (2016)","journal-title":"Res. J. Appl. Sci. Eng. Technol."},{"key":"64_CR3","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2009","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"64_CR4","volume-title":"Deep Learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press, Cambridge (2016)"},{"key":"64_CR5","volume-title":"Advances in Knowledge-Based and Intelligent Information and Engineering Systems","author":"M Grana","year":"2012","unstructured":"Grana, M.: Advances in Knowledge-Based and Intelligent Information and Engineering Systems. IOS Press, Amsterdam (2012)"},{"key":"64_CR6","volume-title":"Artificial Associative Systems and Associative Artificial Intelligence","author":"A Horzyk","year":"2013","unstructured":"Horzyk, A.: Artificial Associative Systems and Associative Artificial Intelligence. EXIT, Warsaw (2013)"},{"key":"64_CR7","doi-asserted-by":"crossref","unstructured":"Horzyk, A.: Associative graph data structures with an efficient access via AVB+trees. In: 11th Conference on Human System Interaction (HSI 2018). IEEE Xplore (2018, in print)","DOI":"10.1109\/HSI.2018.8430973"},{"key":"64_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-319-59063-9_6","volume-title":"Artificial Intelligence and Soft Computing","author":"A Horzyk","year":"2017","unstructured":"Horzyk, A.: Neurons can sort data efficiently. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2017. LNCS (LNAI), vol. 10245, pp. 64\u201374. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59063-9_6"},{"key":"64_CR9","doi-asserted-by":"crossref","unstructured":"Horzyk, A.: Deep associative semantic neural graphs for knowledge representation and fast data exploration. In: Proceedings of KEOD 2017, pp. 67\u201379. Scitepress Digital Library (2017)","DOI":"10.5220\/0006504100670079"},{"key":"64_CR10","doi-asserted-by":"crossref","unstructured":"Horzyk, A., Starzyk, J.A.: Multi-class and multi-label classification using associative pulsing neural networks. In: 2018 IEEE WCCI IJCNN, pp. 427\u2013434. IEEE Xplore (2018)","DOI":"10.1109\/IJCNN.2018.8489176"},{"key":"64_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-540-88425-5_32","volume-title":"Rough Sets and Current Trends in Computing","author":"R Jensen","year":"2008","unstructured":"Jensen, R., Cornelis, C.: A new approach to fuzzy-rough nearest neighbour classification. In: Chan, C.-C., Grzymala-Busse, J.W., Ziarko, W.P. (eds.) RSCTC 2008. LNCS (LNAI), vol. 5306, pp. 310\u2013319. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88425-5_32"},{"key":"64_CR12","volume-title":"Biological Grounds of Psychology","author":"JW Kalat","year":"2008","unstructured":"Kalat, J.W.: Biological Grounds of Psychology, 10th edn. Wadsworth Publishing, Belmont (2008)","edition":"10"},{"key":"64_CR13","first-page":"1","volume":"10","author":"R Tadeusiewicz","year":"2010","unstructured":"Tadeusiewicz, R.: New trends in neurocybernetics. Comput. Methods Mater. Sci. 10, 1\u20137 (2010)","journal-title":"Comput. Methods Mater. Sci."},{"key":"64_CR14","unstructured":"Tadeusiewicz, R.: Introduction to intelligent systems. In: Fault Diagnosis. Models, Artificial Intelligence, Applications, CRC Press, Boca Raton (2011)"},{"key":"64_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge university Press, Cambridge (2014)"},{"key":"64_CR16","doi-asserted-by":"crossref","unstructured":"Vivencio, D.P., et al.: Feature-weighted k-nearest neighbor classifier. In: Proceedings of FOCI, pp. 481\u2013486 (2007)","DOI":"10.1109\/FOCI.2007.371516"},{"key":"64_CR17","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques","author":"IH Witten","year":"2005","unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann Publishers, Morgan Kaufmann Publishers (2005)","edition":"2"},{"issue":"1","key":"64_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/TKDE.2013.109","volume":"26","author":"X Wu","year":"2014","unstructured":"Wu, X., Zhu, X., Wu, G.Q., Ding, W.: Data mining with big data. Trans. Knowl. Data Eng. 26(1), 97\u2013107 (2014)","journal-title":"Trans. Knowl. Data Eng."},{"key":"64_CR19","unstructured":"UCI ML Repository. https:\/\/archive.ics.uci.edu\/ml\/index.php . Accessed 25 May 2018"},{"key":"64_CR20","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/TSMC.1976.5408784","volume":"6","author":"SA Dudani","year":"1976","unstructured":"Dudani, S.A.: The distance-weighted k-nearest neighbor rule. IEEE Trans. Syst. Man Cybern. 6, 325\u2013327 (1976)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"6","key":"64_CR21","first-page":"1429","volume":"9","author":"J Gou","year":"2012","unstructured":"Gou, J., Lan, D., Zhang, Y., Xiong, T.: A new distance-weighted k-nearest neighbor classifier. J. Inf. Comput. Sci. 9(6), 1429\u20131436 (2012)","journal-title":"J. Inf. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks and Machine Learning \u2013 ICANN 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01418-6_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T14:28:34Z","timestamp":1755700114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01418-6_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030014179","9783030014186"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01418-6_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICANN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Neural Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rhodes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icann2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/e-nns.org\/icann2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"easyacademia.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"360","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"139","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"28","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"39% - 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":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"In addition there are 41 full poster papers and 11 short poster papers included in the proceedings","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}