Partial Euclidean Distance

partialEuclideandistance(PED)
In mathematics, the Euclidean distance or Euclidean metric is the "ordinary" (i.e

straight line) distance between two points in Euclidean space. With this distance,
Euclidean space becomes a metric space. The associated norm is called
the Euclidean norm. Older literature refers to the metric as Pythagorean metric.
Contents
1 Definition
o 1.1 One dimension
o 1.2 Two dimensions
o 1.3 Three dimensions
o 1.4 n dimensions
o 1.5 Squared Euclidean distance
2 See also
3 References
Definition[edit]
The Euclidean distance between points p and q is the length of the line
segment connecting them ( ).
In Cartesian coordinates, if p = (p1, p2,..., pn) and q = (q1, q2,..., qn) are two points
in Euclidean n-space, then the distance (d) from p to q, or from q to p is given by
the Pythagorean formula:
(
1
)
The position of a point in a Euclidean n-space is a Euclidean vector. So, p and q are
Euclidean vectors, starting from the origin of the space, and their tips indicate two
points. The Euclidean norm, orEuclidean length, or magnitude of a vector

measures the length of the vector:
where the last equation involves the dot product.

A vector can be described as a directed line segment from the origin of the
Euclidean space (vector tail), to a point in that space (vector tip). If we consider
that its length is actually the distance from its tail to its tip, it becomes clear that
the Euclidean norm of a vector is just a special case of Euclidean distance: the
Euclidean distance between its tail and its tip.
The distance between points p and q may have a direction (e.g. from p to q), so it
may be represented by another vector, given by
In a three-dimensional space (n=3), this is an arrow from p to q, which can be also

regarded as the position of q relative to p. It may be also called
a displacement vector if p and q represent two positions of the same point at two
successive instants of time.
The Euclidean distance between p and q is just the Euclidean length of this
distance (or displacement) vector:
(
2
)
which is equivalent to equation 1, and also to:
One dimension[edit]
In one dimension, the distance between two points on the real line is the absolute
value of their numerical difference. Thus if x and y are two points on the real line,
then the distance between them is given by:
In one dimension, there is a single homogeneous, translation-invariant metric (in

other words, a distance that is induced by a norm), up to a scale factor of length,
which is the Euclidean distance. In higher dimensions there are other possible
norms.
Two dimensions[edit]
In the Euclidean plane, if p = (p1, p2) and q = (q1, q2) then the distance is given by
This is equivalent to the Pythagorean theorem.

Alternatively, it follows from (2) that if the polar coordinates of the point p are
(r1, 1) and those of q are (r2, 2), then the distance between the points is
Three dimensions[edit]
In three-dimensional Euclidean space, the distance is
n dimensions[edit]
In general, for an n-dimensional space, the distance is
Squared Euclidean distance[edit]

The standard Euclidean distance can be squared in order to place progressively
greater weight on objects that are farther apart. In this case, the equation becomes
Squared Euclidean Distance is not a metric as it does not satisfy the triangle
inequality, however it is frequently used in optimization problems in which
distances only have to be compared.
It is also referred to as quadrance within the field of rational trigonometry.
See also[edit]
Chebyshev distance measures distance assuming only the most significant

dimension is relevant.
Euclidean distance matrix
Hamming distance identifies the difference bit by bit of two strings
Mahalanobis distance normalizes based on a covariance matrix to make the
distance metric scale-invariant.
Manhattan distance measures distance following only axis-aligned
directions.
Metric
Minkowski distance is a generalization that unifies Euclidean distance,
Manhattan distance, and Chebyshev distance.
Pythagorean addition
References[edit]
Deza, Elena; Deza, Michel Marie (2009). Encyclopedia of Distances.
Springer. p. 94.
"Cluster analysis". March 2, 2011.

Partial Euclidean Distance

Uploaded by

Copyright:

Available Formats

Partial Euclidean Distance

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Partial Euclidean Distance

Uploaded by

Copyright:

Available Formats

partialEuclideandistance(PED)

In mathematics, the Euclidean distance or Euclidean metric is the "ordinary" (i.e

points. The Euclidean norm, orEuclidean length, or magnitude of a vector

where the last equation involves the dot product.

In a three-dimensional space (n=3), this is an arrow from p to q, which can be also

which is equivalent to equation 1, and also to:

In one dimension, there is a single homogeneous, translation-invariant metric (in

This is equivalent to the Pythagorean theorem.

Squared Euclidean distance[edit]

Chebyshev distance measures distance assuming only the most significant

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.