×
Home Discussions Write at Opengenus IQ
×
  • Track your progress
  • Deep Learning Projects
  • Python Projects
  • Join our Internship 🎓
  • RANDOM
  • 100+ Graph Algorithms
  • 100+ DP Problems
  • 50+ Linked List Problems
  • 50+ Array Problems
  • One Liner
  • 50+ Binary Tree problems
  • Home
  • Rust Projects

euclidean distance

A collection of 3 posts

similarity measurement

Minkowski distance [Explained]

Minkowski distance is a distance/ similarity measurement between two points in the normed vector space (N dimensional real space) and is a generalization of the Euclidean distance and the Manhattan distance. See the applications of Minkowshi distance and its visualization using an unit circle.

OpenGenus Foundation OpenGenus Foundation
similarity measurement

Euclidean vs Manhattan vs Chebyshev Distance

Euclidean distance, Manhattan distance and Chebyshev distance are all distance metrics which compute a number based on two data points. All the three metrics are useful in various use cases and differ in some important aspects such as computation and real life usage.

OpenGenus Foundation OpenGenus Foundation
similarity measurement

Euclidean distance (L2 norm)

Euclidean distance is the shortest distance between two points in an N dimensional space also known as Euclidean space. It is used as a common metric to measure the similarity between two data points and used in various fields such as geometry, data mining, deep learning and others.

OpenGenus Foundation OpenGenus Foundation
OpenGenus IQ © 2023 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter