{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:42:56Z","timestamp":1773751376897,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"24","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62071060"],"award-info":[{"award-number":["62071060"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/the","name":"the Beijing Key Laboratory of Work Safety and Intelligent Monitoring Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/the","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10489-023-05148-5","type":"journal-article","created":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T09:02:13Z","timestamp":1700038933000},"page":"30319-30328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hypersphere anchor loss for K-Nearest neighbors"],"prefix":"10.1007","volume":"53","author":[{"given":"Xiang","family":"Ye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zihang","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9685-2571","authenticated-orcid":false,"given":"Yong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,15]]},"reference":[{"issue":"1","key":"5148_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover T, Hart P (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13(1):21\u201327","journal-title":"IEEE Trans Inf Theory"},{"key":"5148_CR2","doi-asserted-by":"crossref","unstructured":"Zhou X, Ren Z , Zhou S,Yu T, Jiang Z (2023) Unsupervised saliency detection via knn mechanism and object-biased prior. Neural Process Lett 1\u201315","DOI":"10.21203\/rs.3.rs-2691682\/v1"},{"key":"5148_CR3","doi-asserted-by":"crossref","unstructured":"Maria A, Sunder R, Antony AM (2023) Stress prediction using enhanced feature selection and knn model. In: 2023 Advanced computing and communication technologies for high performance applications (ACCTHPA), pp 1\u20135","DOI":"10.1109\/ACCTHPA57160.2023.10083348"},{"issue":"10","key":"5148_CR4","first-page":"30","volume":"2","author":"W Lestari","year":"2022","unstructured":"Lestari W, Sumarlinda S (2022) Implementation of k-nearest neighbor (knn) and suport vector machine (svm) for clasification cardiovascular disease. Int J Multi Sci 2(10):30\u201336","journal-title":"Int J Multi Sci"},{"key":"5148_CR5","doi-asserted-by":"crossref","unstructured":"Sani S, Wiratunga N, Massie S (2017) Learning deep features for knn-based human activity recognition. CEUR Workshop Proceedings","DOI":"10.1007\/978-3-319-63558-3_40"},{"issue":"1","key":"5148_CR6","doi-asserted-by":"publisher","first-page":"6256","DOI":"10.1038\/s41598-022-10358-x","volume":"12","author":"S Uddin","year":"2022","unstructured":"Uddin S, Haque I, Lu H, Moni MA, Gide E (2022) Comparative performance analysis of k-nearest neighbour (knn) algorithm and its different variants for disease prediction. Sci Rep 12(1):6256","journal-title":"Sci Rep"},{"key":"5148_CR7","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.patcog.2017.09.038","volume":"74","author":"A-J Gallego","year":"2018","unstructured":"Gallego A-J, Calvo-Zaragoza J, Valero-Mas JJ, Rico-Juan JR (2018) Clustering-based k-nearest neighbor classification for large-scale data with neural codes representation. Pattern Recognition 74:531\u2013543","journal-title":"Pattern Recognition"},{"key":"5148_CR8","doi-asserted-by":"crossref","unstructured":"Ren W, Yu Y, Zhang J, Huang K (2014) Learning convolutional nonlinear features for k nearest neighbor image classification. In: 2014 22nd international conference on pattern recognition, IEEE pp 4358\u20134363","DOI":"10.1109\/ICPR.2014.746"},{"key":"5148_CR9","doi-asserted-by":"crossref","unstructured":"Le L, Xie Y, Raghavan VV (2018) Deep similarity-enhanced k nearest neighbors.In: 2018 IEEE international conference on big data (Big Data), IEEE pp 2643\u20132650","DOI":"10.1109\/BigData.2018.8621894"},{"key":"5148_CR10","doi-asserted-by":"crossref","unstructured":"Ghosh S, Singh A, Jhanjhi N, Masud M, Aljahdali S, et al.(2022) Svm and knn based cnn architectures for plant classification. Computers, Materials & Continua 71(3)","DOI":"10.32604\/cmc.2022.023414"},{"issue":"8","key":"5148_CR11","doi-asserted-by":"publisher","first-page":"12699","DOI":"10.1007\/s11042-022-13935-4","volume":"82","author":"MG Lanjewar","year":"2023","unstructured":"Lanjewar MG, Parab JS, Shaikh AY (2023) Development of framework by combining cnn with knn to detect alzheimer\u2019s disease using mri images. Multimedia Tools and Applications 82(8):12699\u201312717","journal-title":"Multimedia Tools and Applications"},{"issue":"11","key":"5148_CR12","doi-asserted-by":"publisher","first-page":"2086","DOI":"10.3390\/app8112086","volume":"8","author":"A-J Gallego","year":"2018","unstructured":"Gallego A-J, Pertusa A, Calvo-Zaragoza J (2018) Improving convolutional neural networks\u2019 accuracy in noisy environments using k-nearest neighbors. Appl Sci 8(11):2086","journal-title":"Appl Sci"},{"key":"5148_CR13","doi-asserted-by":"crossref","unstructured":"Zhang S, Li J, Li Y (2022) Reachable distance function for knn classification. IEEE Trans Knowl Data Eng","DOI":"10.1109\/TKDE.2022.3185149"},{"key":"5148_CR14","unstructured":"Goldberger J, Hinton GE, Roweis ST, Salakhutdinov RR (2005) Neighbourhood components analysis. In: Advances in neural information processing systems, pp 513\u2013520"},{"key":"5148_CR15","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.patcog.2017.09.038","volume":"74","author":"A-J Gallego","year":"2018","unstructured":"Gallego A-J, Calvo-Zaragoza J, Valero-Mas JJ, Rico-Juan JR (2018) Clustering-based k-nearest neighbor classification for large-scale data with neural codes representation. Pattern Recogn 74:531\u2013543","journal-title":"Pattern Recogn"},{"issue":"3","key":"5148_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1089\/big.2018.0064","volume":"6","author":"AB Hassanat","year":"2018","unstructured":"Hassanat AB (2018) Furthest-pair-based binary search tree for speeding big data classification using k-nearest neighbors. Big Data 6(3):225\u2013235","journal-title":"Big Data"},{"issue":"1","key":"5148_CR17","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/s13278-022-00904-w","volume":"12","author":"S Kobayashi","year":"2022","unstructured":"Kobayashi S, Matsugu S, Shiokawa H (2022) Indexing complex networks for fast attributed knn queries. Soc Netw Anal Min 12(1):82","journal-title":"Soc Netw Anal Min"},{"key":"5148_CR18","doi-asserted-by":"crossref","unstructured":"Hassanat A (2018) Norm-based binary search trees for speeding up knn big data classification. Computers 7(4):54","DOI":"10.3390\/computers7040054"},{"key":"5148_CR19","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.neucom.2018.06.095","volume":"354","author":"P Skryjomski","year":"2019","unstructured":"Skryjomski P, Krawczyk B, Cano A (2019) Speeding up k-nearest neighbors classifier for large-scale multi-label learning on gpus. Neurocomputing 354:10\u201319","journal-title":"Neurocomputing"},{"key":"5148_CR20","doi-asserted-by":"crossref","unstructured":"Barrientos RJ, Riquelme JA, Hern\u00e1ndez-Garc\u00eda R, Navarro CA, Soto-Silva W (2022) Fast knn query processing over a multi-node gpu environment. The J Supercomput 1\u201327","DOI":"10.1007\/s11227-021-03975-2"},{"key":"5148_CR21","first-page":"1060","volume":"2020","author":"R Guerraoui","year":"2020","unstructured":"Guerraoui R, Kermarrec A-M, Ruas O, Ta \u00efani F, (2020) Smaller, faster & lighter knn graph constructions. Proceedings of The Web Conference 2020:1060\u20131070","journal-title":"Proceedings of The Web Conference"},{"key":"5148_CR22","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.patrec.2018.05.001","volume":"134","author":"Z Abu-Aisheh","year":"2020","unstructured":"Abu-Aisheh Z, Raveaux R, Ramel J-Y (2020) Efficient k-nearest neighbors search in graph space. Pattern Recogn Lett 134:77\u201386","journal-title":"Pattern Recogn Lett"},{"key":"5148_CR23","unstructured":"Nielsen MA (2018) Neural networks and deep learning. Determination Press. http:\/\/neuralnetworksanddeeplearning.com\/"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05148-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-05148-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05148-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T06:18:09Z","timestamp":1703744289000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-05148-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":23,"journal-issue":{"issue":"24","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["5148"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-05148-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"1 November 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The data used in this paper are all publicly available database. The use of datasets was in compliance with the terms and conditions outlined by the datasets.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}},{"value":"The authors declare that they have no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}