Markov distance is an effective method to compute the similarity between the two samples (data covariance distance), compared with the Euclidean distance, which takes into account the link between different characteristics. This experiment aimed at through the given sample data, design a minimum Mahalanobis distance classifier and classify the test points, and then compare it with the minimum Euclidean distance classifier. Experimental results showed that when the covariance matrix is a unit matrix, minimum Mahalanobis distance classifier with the minimum Euclidean distance classifier equivalent.

Mahalanobis.m

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．