Covariance Matrix - Pattern Recognition - Assignment, Exercises of Computer Science

These are the Assignment of Pattern Recognition which includes Squared Mahalanobis, Weighted Version, Squared Euclidean, Dimensional Binary Patterns, Euclidean Distance, Satisfy Symmetry etc.Key important points are: Covariance Matrix, Squared Mahalanobis, Weighted Version, Squared Euclidean, Dimensional Binary Patterns, Euclidean Distance, Satisfy Symmetry

Typology: Exercises

2012/2013

Uploaded on 03/28/2013

ekanath
ekanath 🇮🇳

3.8

(4)

76 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Assignment
1. Consider the covariance matrix in a two-dimensional case given by
Show that the squared Mahalanobis distance is a weighted version of
squared Euclidean distance in this case.
2. Consider d-dimensional binary patterns, where each pattern is a d-bit
binary string. Show that for two such patterns X and Y, the Manhattan
distance and squared Euclidean distance between X and Y are the same.
3. Show that the KL-distance does not satisfy symmetry.
4. Let S(A,B) be the cosine of the angle between vectors A and B. Let
D(A,B) = 1 - S(A,B) is the distance between A and B. Is D a metric?
5. Consider two binary strings X(x1, x2, ..., xd) and Y(y1, y2, ..., yd).
Hamming distance between X and Y is defined as
where mismatch(xi, yi) = 1, when xi = yi and 0 otherwise. Is
Hamming distance a metric?
6. Obtain the edit distance between strings ‘TRAIN’ and ‘CRANE’.
7. Show that the Mutual Neighbourhood Distance (MND) is not a metric.
8. Consider vectors X and Y where X = (50, 2, 29, 62, 140) and Y = (55,
15, 50, 70, 170). Obtain the k-Median distance where k = 3.
Docsity.com

Partial preview of the text

Download Covariance Matrix - Pattern Recognition - Assignment and more Exercises Computer Science in PDF only on Docsity!

Assignment

  1. Consider the covariance matrix in a two-dimensional case given by Show that the squared Mahalanobis distance is a weighted version of squared Euclidean distance in this case.
  2. Consider d-dimensional binary patterns, where each pattern is a d-bit binary string. Show that for two such patterns X and Y, the Manhattan distance and squared Euclidean distance between X and Y are the same.
  3. Show that the KL-distance does not satisfy symmetry.
  4. Let S(A,B) be the cosine of the angle between vectors A and B. Let D(A,B) = 1 - S(A,B) is the distance between A and B. Is D a metric?
  5. Consider two binary strings X( x 1 , x 2 , ..., x d) and Y( y 1 , y 2 , ..., y d). Hamming distance between X and Y is defined as

where mismatch(xi, yi) = 1 , when xi = yi and 0 otherwise. Is

Hamming distance a metric?

  1. Obtain the edit distance between strings ‘TRAIN’ and ‘CRANE’.
  2. Show that the Mutual Neighbourhood Distance (MND) is not a metric.
  3. Consider vectors X and Y where X = (50, 2, 29, 62, 140) and Y = (55, 15, 50, 70, 170). Obtain the k-Median distance where k = 3.

Docsity.com