Distance Metrics for Machine Learning and it's Relation with Other Distances

Page Numbers: 15-23
Published
2023-10-27
Digital Object Identifier: 10.58578/mjms.v1i1.1990
Save this to:
Article Metrics:
Viewed : 135 times
Downloaded : 112 times
Article can trace at:

Author Fee:
Free Publication Fees for Foreign Researchers (0.00)

Please do not hesitate to contact us if you would like to obtain more information about the submission process or if you have further questions.




  • Dipendra Prasad Yadav Thakur Ram Campus, Birgunj, Nepal
  • Nand Kishor Kumar Trichandra Campus, Tribhuvan University, Nepal
  • Suresh Kumar Sahani M.I.T. Campus, T.U, Janakpur, Nepal

Abstract

In machine learning, distance metrics play a crucial role in measuring the degree of dissimilarity among data points. When creating and optimizing machine learning models, data scientists and machine learning practitioners can make more informed choices by understanding the features of popular distance metrics and their relationships. The effectiveness and interpretability of the model's output can be greatly influenced by selecting the appropriate distance metric. We explain distance metrics and their relevance in machine learning with various examples of metrics, including Minkowski distance, Manhattan distance, Max Metric for R^n, Taxicab distance, Relative distance, and Hamming distance.

Keywords: Distance Metrics; Minkowski Distance; Manhattan Distance; Max Metric for Rn; Taxicab Distance; Relative Distance; Hamming Distance

Citation Metrics:






Downloads

Download data is not yet available.
How to Cite
Yadav, D. P., Kumar, N. K., & Sahani, S. (2023). Distance Metrics for Machine Learning and it’s Relation with Other Distances. Mikailalsys Journal of Mathematics and Statistics, 1(1), 15-23. https://doi.org/10.58578/mjms.v1i1.1990