{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T08:47:17Z","timestamp":1746089237903,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031408519"},{"type":"electronic","value":"9783031408526"}],"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-40852-6_17","type":"book-chapter","created":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T23:03:46Z","timestamp":1693523026000},"page":"315-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved Euclidean Distance in\u00a0the\u00a0K Nearest Neighbors Method"],"prefix":"10.1007","author":[{"given":"Ch\u00e9rifa","family":"Boucetta","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Hussenet","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Herbin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,1]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Afzal, S., Ganesh, K.: Load balancing in cloud computing - a hierarchical taxonomical classification. J. Cloud Comput. 8 (2019)","DOI":"10.1186\/s13677-019-0146-7"},{"key":"17_CR2","unstructured":"Aquino, L.D.G., Eckstein, S.: Minmax methods for optimal transport and beyond: regularization, approximation and numerics (2020)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Arora, A., Sinha, S., Kumar, P., Bhattacharya, A.: HD-index: pushing the scalability-accuracy boundary for approximate KNN search in high-dimensional spaces. Proc. VLDB Endow. 11(8), 906\u2013919 (2018)","DOI":"10.14778\/3204028.3204034"},{"issue":"10","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1016\/0031-3203(92)90028-H","volume":"25","author":"S Belkasim","year":"1992","unstructured":"Belkasim, S., Shridhar, M., Ahmadi, M.: Pattern classification using an efficient KNNR. Pattern Recogn. 25(10), 1269\u20131274 (1992)","journal-title":"Pattern Recogn."},{"key":"17_CR5","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-031-06668-9_19","volume-title":"Innovations for Community Services","author":"C Boucetta","year":"2022","unstructured":"Boucetta, C., Hussenet, L., Herbin, M.: Practical method for multidimensional data ranking. In: Phillipson, F., Eichler, G., Erfurth, C., Fahrnberger, G. (eds.) I4CS 2022. CCIS, vol. 1585, pp. 267\u2013277. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06668-9_19"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Farahnakian, F., Pahikkala, T., Liljeberg, P., Plosila, J.: Energy aware consolidation algorithm based on k-nearest neighbor regression for cloud data centers. In: 2013 IEEE\/ACM 6th International Conference on Utility and Cloud Computing, pp. 256\u2013259 (2013)","DOI":"10.1109\/UCC.2013.51"},{"key":"17_CR7","unstructured":"He, X., Cai, D., Niyogi, P.: Laplacian score for feature selection. In: Weiss, Y., Sch\u00f6lkopf, B., Platt, J. (eds.) Advances in Neural Information Processing Systems, vol. 18. MIT Press, Cambridge (2005)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Hussenet, L., Boucetta, C.: A green-aware optimization strategy for virtual machine migration in cloud data centers. In: 2022 International Wireless Communications and Mobile Computing (IWCMC), pp. 1082\u20131087 (2022)","DOI":"10.1109\/IWCMC55113.2022.9825284"},{"key":"17_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107020","volume":"222","author":"B Liang","year":"2021","unstructured":"Liang, B., Wu, D., Wu, P., Su, Y.: An energy-aware resource deployment algorithm for cloud data centers based on dynamic hybrid machine learning. Knowl.-Based Syst. 222, 107020 (2021)","journal-title":"Knowl.-Based Syst."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Mazidi, A., Golsorkhtabar, M., Tabari, M.: Autonomic resource provisioning for multilayer cloud applications with k-nearest neighbor resource scaling and priority-based resource allocation. Software: Practice and Experience 50 (04 2020)","DOI":"10.1002\/spe.2837"},{"issue":"11","key":"17_CR11","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2014.2321376","volume":"36","author":"M Muja","year":"2014","unstructured":"Muja, M., Lowe, D.G.: Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans. Pattern Anal. Mach. Intell. 36(11), 2227\u20132240 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"11503","DOI":"10.1109\/ACCESS.2019.2962875","volume":"8","author":"X Ou","year":"2020","unstructured":"Ou, X., et al.: Hyperspectral image target detection via weighted joint k-nearest neighbor and multitask learning sparse representation. IEEE Access 8, 11503\u201311511 (2020)","journal-title":"IEEE Access"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Su, J., Nair, S., Popokh, L.: EdgeGYM: a reinforcement learning environment for constraint-aware NFV resource allocation. In: 2023 IEEE 2nd International Conference on AI in Cybersecurity (ICAIC), pp. 1\u20137 (2023)","DOI":"10.1109\/ICAIC57335.2023.10044182"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Taunk, K., De, S., Verma, S., Swetapadma, A.: A brief review of nearest neighbor algorithm for learning and classification. In: 2019 International Conference on Intelligent Computing and Control Systems (ICCS), pp. 1255\u20131260 (2019)","DOI":"10.1109\/ICCS45141.2019.9065747"},{"issue":"8","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1109\/TPDS.2012.261","volume":"24","author":"M Xie","year":"2013","unstructured":"Xie, M., Hu, J., Han, S., Chen, H.H.: Scalable hypergrid K-NN-based online anomaly detection in wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 24(8), 1661\u20131670 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"17_CR16","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.infsof.2006.05.006","volume":"49","author":"C Yu","year":"2007","unstructured":"Yu, C., Cui, B., Wang, S., Su, J.: Efficient index-based KNN join processing for high-dimensional data. Inf. Softw. Technol. 49(4), 332\u2013344 (2007)","journal-title":"Inf. Softw. Technol."}],"container-title":["Communications in Computer and Information Science","Innovations for Community Services"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-40852-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T23:26:54Z","timestamp":1693524414000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40852-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031408519","9783031408526"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40852-6_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"I4CS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Innovations for Community Services","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bamberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"i4cs2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.i4cs-conference.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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","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":"15","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":"4","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":"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 (provided by the conference organizers)"}},{"value":"3.63","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":"5.52","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}