 |

View our papers...

This is a short summary of this paper!
Already a member? Go here to log in and view the entire paper!
|
Distance metrics in pattern recognition
DISTANCE METRICS
A metric, , is a global function on a domain which indicates a human notion of distance. In our case, the domain is the set of all possible data instances. A metric function must conform to the following five axioms
1. non-negativity,
2. symmetry,
3. identity,
4. definiteness,
5. triangle inequality,
These constraints are not counter-intuitive. The first and second constraints define a metric as a scalar and not a directional vector quantity. The third property reflects the axiomatic belief that the distance between two objects must be zero when they are the identical. The fourth property strengthens the previous one by enforcing the constraint that the distance metric must only be zero when two objects are identical, and for no other pairs. The final constraint states that the minimal distance metric between two points must be that along the most direct path between them. The ubiquitous Euclidean distance over the multidimensional space of continuous real numbers, ,
Where the points take the form and , satisfies these constraints and is therefore a metric. A variant of the Euclidean, the Squared Euclidean , is also used in clustering algorithms as a greater weight is giv
Approximate Word count = 3729
Approximate Pages = 15 (250 words per page double spaced)
More Essays on Distance metrics in pattern recognition Student Papers: |
|
Want to view this paper along with 100,000 other term papers, essays, and book reports?
Instant access, single user memberships can be purchased online with a credit card or online check!
|
 |

Topics

Instant Access!
Acceptance Essays
Arts
Custom Papers
English
Foreign
History
Miscellaneous
Movies
Music
Novels
People
Politics
Religion
Science
Sports
Technology
Rad Essays
|