distance metrics in machine learning distance metrics in machine learning distance metrics in machine learning
nehaprernatigga
23 views
7 slides
Dec 15, 2024
Slide 1 of 7
1
2
3
4
5
6
7
About This Presentation
Distance metrics in Machine Learnjng
Size: 226.08 KB
Language: en
Added: Dec 15, 2024
Slides: 7 pages
Slide Content
1 Amity Institute of Information Technology Ist Semester Machine Learning with Python Dr Neha Prerna Tigga
Minkowski Distance 2 Minkowski Distance is a generalization of several distance metrics in a geometric space. It is a metric used to measure the distance between two points in a normed vector space. The Minkowski distance between two points š=( , ,ā¦, ) and š=( , ,ā¦, ) in an n-dimensional space is defined as: Where: and are the coordinates of points š and š, š is a parameter that defines the type of distance. Ā
Types of Minkowski Distance Based on š When š=1 : This becomes the Manhattan Distance (or L1-Norm), also known as Taxicab Distance. It measures the distance between points along the grid lines (like a taxi driving along city blocks). 3
When š=2 : This becomes the Euclidean Distance (or L2-Norm), the most common form of distance. It measures the straight-line distance between two points in Euclidean space. 4
When pāā: This becomes the Chebyshev Distance (or Lā-Norm ). It measures the greatest difference between any single coordinate dimension of the two points. 5
6
EXAMPLES Consider two points in a 2D space: Point P: (3, 5) Point Q: (1, 1) Calculate the Manhattan Distance , Euclidean Distance , and Chebyshev Distance between these two points. Points in 5D Space Point P: (2, 3, 7, 1, 5) Point Q: (4, 1, 6, 3, 2) 7