{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:19:49Z","timestamp":1759335589707,"version":"3.41.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T00:00:00Z","timestamp":1659139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001823","name":"Czech Ministry of Education, Youth and Sports","doi-asserted-by":"crossref","award":["LM2018113"],"award-info":[{"award-number":["LM2018113"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2022,12,31]]},"abstract":"<jats:p>Based on the analysis of conditions for a good distance function we found four rules that should be fulfilled. Then, we introduce two new distance functions, a metric and a pseudometric one. We have tested how they fit for distance-based classifiers, especially for the IINC classifier. We rank distance functions according to several criteria and tests. Rankings depend not only on criteria or nature of the statistical test, but also whether it takes into account different difficulties of tasks or whether it considers all tasks as equally difficult. We have found that the new distance functions introduced belong among the four or five best out of 23 distance functions. We have tested them on 24 different tasks, using the mean, the median, the Friedman aligned test, and the Quade test. Our results show that a suitable distance function can improve behavior of distance-based classification rules.<\/jats:p>","DOI":"10.1145\/3434769","type":"journal-article","created":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T18:31:17Z","timestamp":1645727477000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["The Distance Function Optimization for the Near Neighbors-Based Classifiers"],"prefix":"10.1145","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6686-1511","authenticated-orcid":false,"given":"Marcel","family":"Ji\u0159ina","sequence":"first","affiliation":[{"name":"Institute of Computer Science of the Czech Academy of Sciences, Prague, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Said","family":"Krayem","sequence":"additional","affiliation":[{"name":"Faculty of Applied Informatics, Tomas Bata University, Nad Stranemi, Zlin, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,30]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"M. Alkasassbeh G. A. Altarawnwh and A. B. Hassanat. 2015. On enhancing the performance of nearest neighbor classifiers using hassanat distance metric. Canadian Journal of Pure and Applied Science 9 1 (2015) 6."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2435209.2435210"},{"key":"e_1_3_1_4_2","unstructured":"M. Ashraf K. Le and X. Huang. 2011. Iterative weighted k-NN for constructing missing feature values in wisconsin breast cancer dataset. In Proceedings of the 3rd International Conference on Data Mining and Intelligent Information Technology Applications Macao 24\u201326 Oct. 2011 23\u201327 ISBN: 978-1-4673-0231-9 (IEEE)"},{"key":"e_1_3_1_5_2","doi-asserted-by":"crossref","unstructured":"M. Benzi J. K. Cullum and M. Tu\u0307ma. 2000. Robust approximate inverse preconditioning for the conjugate gradient method. SIAM Journal on Scientific Computing 22 1318\u20131332.","DOI":"10.1137\/S1064827599356900"},{"key":"e_1_3_1_6_2","doi-asserted-by":"crossref","unstructured":"T. M. Cover and P. E. Hart. 1967. Nearest neighbor pattern classification. IEEE Transactions on Information Theory 13 1 (1967) 21\u201327.","DOI":"10.1109\/TIT.1967.1053964"},{"key":"e_1_3_1_7_2","doi-asserted-by":"crossref","unstructured":"J. Derrac S. Garcia D. Molina and F. Herrera. 2011. A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation 1 1 (2011) 3\u201318.","DOI":"10.1016\/j.swevo.2011.02.002"},{"key":"e_1_3_1_8_2","unstructured":"E. Deza and M. M. Deza. 2006. Dictionary of Distances. Elsevier Amsterdam 391."},{"key":"e_1_3_1_9_2","doi-asserted-by":"crossref","unstructured":"M. M. Deza and E. Deza. 2009. Encyklopedia of Distances. Springer Heildelberg 590.","DOI":"10.1007\/978-3-642-00234-2"},{"key":"e_1_3_1_10_2","doi-asserted-by":"crossref","unstructured":"C. Domeniconi J. Peng and D. Gunopulos. 2002. Locally adaptive metric nearest neighbor classification. IEEE Transactions on Pattern Analysis and Machine Intelligence 24 9 (2002) 1281\u20131285.","DOI":"10.1109\/TPAMI.2002.1033219"},{"key":"e_1_3_1_11_2","unstructured":"D. Dua and E. Karra Taniskidou. 2017. UCI machine learning repository. Irvine CA: University of California School of Information and Computer Science. Retrieved 13 March 2008 from http:\/\/archive.ics.uci.edu\/ml."},{"key":"e_1_3_1_12_2","unstructured":"R. Duda P. Hart and D. G. Stork. 2000. Pattern Classification. John Wiley and Sons 2000."},{"key":"e_1_3_1_13_2","doi-asserted-by":"crossref","unstructured":"P. Grassberger and I. Procaccia. 1983. Measuring the strangeness of strange attractors. Physica 9D 1\u20132 (1983) 189\u2013208.","DOI":"10.1016\/0167-2789(83)90298-1"},{"key":"e_1_3_1_14_2","unstructured":"A. B. Hassanat. 2014. Dimensionality invariant similarity measure. Journal of American Science 10 8 (2014) 221\u2013226."},{"key":"e_1_3_1_15_2","unstructured":"A. B. Hassanat M. A. Abbadi G. A. Altarawneh A. A. Alhasanat. 2014. Solving problem of K parameter in the KNN classifier using an ensemble learning approach. International Journal of Computer Science and Information Security 12 8 (2014) 33\u201339."},{"key":"e_1_3_1_16_2","doi-asserted-by":"crossref","unstructured":"M. Ji\u0159ina and M. Ji\u0159ina Jr. 2013. Utilization of singularity exponent in nearest neighbor based classifier. Journal of Classification 30 1 (2013) 3\u201329. ISSN 0176\u20134268.","DOI":"10.1007\/s00357-013-9121-z"},{"key":"e_1_3_1_17_2","doi-asserted-by":"crossref","unstructured":"M. Ji\u0159ina and M. Ji\u0159ina Jr. 2014. Correlation dimension based classifier. IEEE Transactions on Cybernetics 44 12 (2014) 2253\u20132263. ISSN 2168\u20132267.","DOI":"10.1109\/TCYB.2014.2305697"},{"key":"e_1_3_1_18_2","doi-asserted-by":"crossref","unstructured":"M. Ji\u0159ina and M. Ji\u0159ina Jr. 2015. Classification using zipfian kernel. Journal of Classification (Springer) 32 2 (2015) 305\u2013326. ISSN 0176\u20134268.","DOI":"10.1007\/s00357-015-9174-2"},{"key":"e_1_3_1_19_2","unstructured":"T. Joachims. 1999. Making large-scale SVM learning practical. In Proceedings of the Advances in Kernel Methods - Support Vector Learning (Eds). B. Scholkopf C. Burges and A. Smola MIT-Press."},{"key":"e_1_3_1_20_2","unstructured":"T. Joachims. 2008. Program codes for SVM-light and SVM-multiclass. Retrieved 30 Jan. 2014 from http:\/\/svmlight.joachims.org\/."},{"key":"e_1_3_1_21_2","unstructured":"A. Kontorovich and R. Weiss. 2015. A bayes consistent 1-NN classifier. In Proceedings of the 18th International Conference on Artifficial Intelligence and Statistics 2015 San Diego JMLR: W&CP 38 480\u2013488."},{"key":"e_1_3_1_22_2","doi-asserted-by":"crossref","unstructured":"B. Li Y. W. Chen and Y. Q. Chen. 2008. The nearest neighbor algorithm of local probability centers. IEEE Transactions on Systems Man and Cybernetics\/Part B: Cybernetics 38 1 (2008) 141\u2013154.","DOI":"10.1109\/TSMCB.2007.908363"},{"key":"e_1_3_1_23_2","unstructured":"A. Luschow and C. Wartena. 2017. Classifying medical literature using k-nearest-neighbours algorithm. In Proceedings of the 17th European Networked Knowledge Organization Systems Workshop Co-located with the 21st International Conference on Theory and Practice of Digital Libraries 2017 Mayr P. Tudhope D. Golub K. Wartena C. Luca E. W. D. (Eds.) CEUR-WS.org CEUR Workshop Proceedings Vol. 1937 pp. 26\u201338. Retrieved from http:\/\/ceur-ws.org\/Vol-1937\/paper3.pdf."},{"key":"e_1_3_1_24_2","unstructured":"B. B. Mandelbrot. 1982. The Fractal Geometry of Nature . W. H. Freeman and Co. ISBN 0-7167-1186-9."},{"key":"e_1_3_1_25_2","unstructured":"A. Mishra. 2020. k-nearest neighbor (k-NN) for machine learning. Data Science Foundation May 2020 4 pp. Retrieved from https:\/\/datascience.foundation\/datatalk\/k-nearest-neighbor-k-nn-for-machine-learning."},{"key":"e_1_3_1_26_2","doi-asserted-by":"crossref","unstructured":"M. Muja and D. G. Lowe. 2014. Scalable nearest neighbor algorithms for high dimensional data. IEEE Transactions on Pattern Analysis and Machine Intelligence 36 11 (2014) 2227\u20132240.","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"e_1_3_1_27_2","doi-asserted-by":"crossref","unstructured":"Y. -K. Noh B. T. Zhang and D. D. Lee. 2018. Generative local metric learning for nearest neighbor classification. IEEE Transactions on Pattern Analysis and Machine Intelligence 40 1 (2018) 106\u2013118.","DOI":"10.1109\/TPAMI.2017.2666151"},{"key":"e_1_3_1_28_2","unstructured":"R. Paredes. 2008. CPW: Class and prototype weights learning. Retrieved 11 Dec. 2007 from http:\/\/www.dsic.upv.es\/rparedes\/research\/CPW\/index.html."},{"key":"e_1_3_1_29_2","unstructured":"R. Paredes. 2010. Data sets corpora. Retrieved 11 Dec. 2007 from Available http:\/\/algoval.essex.ac.uk\/data\/vector\/UCI\/ in fact the primary source is S. M. Lucas Algoval: Algorithm Evaluation over the Web."},{"key":"e_1_3_1_30_2","doi-asserted-by":"crossref","unstructured":"R. Paredes and E. Vidal. 2006. Learning weighted metrics to minimize nearest neighbor classification error. IEEE Transactions on Pattern Analysis and Machine Intelligence 20 7 (2006) 1100\u20131110.","DOI":"10.1109\/TPAMI.2006.145"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1061\/JPEODX.0000175"},{"key":"e_1_3_1_32_2","doi-asserted-by":"crossref","unstructured":"S. Garcia M. Wozniak and B. Krawczyk. 2017. Nearest neighbor classification for high-speed big data streams using spark. IEEE Transactions on Systems Man and Cybernetics Systems 47 10 (2017) 2727\u20132739.","DOI":"10.1109\/TSMC.2017.2700889"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1049"},{"key":"e_1_3_1_34_2","unstructured":"B. W. Silverman. 1986. Density Estimation for Statistics and Data Analysis. Chapman and Hall London."},{"key":"e_1_3_1_35_2","unstructured":"K. Q. Weinberger and L. K. Saul. 2009. Distance metric learning for large margin nearest neighbor classification. Journal of Machine Learning Research 10 2 (2009) 207\u2013244."},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/2789212"},{"key":"e_1_3_1_37_2","doi-asserted-by":"crossref","unstructured":"D. Yu X. Yu and A. Wu. 2011. Making the nearest neighbor meaningful for time series classification. In Proceedings of the 4th International Congress on Image and Signal Processing. 2481\u20132485.","DOI":"10.1109\/CISP.2011.6100672"},{"key":"e_1_3_1_38_2","doi-asserted-by":"crossref","unstructured":"B. Zhang and S. N. Srihari. 2004. Fast k-nearest neighbor classification using cluster-based trees. IEEE Transactions on Pattern Analysis and Machine Intelligence 26 4 (2004) 525\u2013528.","DOI":"10.1109\/TPAMI.2004.1265868"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1139\/cjfr-2017-0346"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3434769","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3434769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:58Z","timestamp":1750195918000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3434769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,30]]},"references-count":38,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12,31]]}},"alternative-id":["10.1145\/3434769"],"URL":"https:\/\/doi.org\/10.1145\/3434769","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2022,7,30]]},"assertion":[{"value":"2019-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}