Distance and clustering.

조회 수: 7 (최근 30일)
hello_world
hello_world 2016년 8월 13일
댓글: John D'Errico 2016년 8월 13일
In k-means clustering code which uses Euclidean distance. I want to replace Euclidean distance by Mahalanobis distance.

답변 (1개)

Image Analyst
Image Analyst 2016년 8월 13일
Can you program in the formula from here: https://en.wikipedia.org/wiki/Mahalanobis_distance
Or just use the mahal() function if you have the Statistics and Machine Learning Toolbox:
Description d = mahal(Y,X) computes the Mahalanobis distance (in squared units) of each observation in Y from the reference sample in matrix X. If Y is n-by-m, where n is the number of observations and m is the dimension of the data, d is n-by-1. X and Y must have the same number of columns, but can have different numbers of rows. X must have more rows than columns.
  댓글 수: 1
John D'Errico
John D'Errico 2016년 8월 13일
hello_world has been asking the same question repeatedly. This is the 4th question I've seen from them on the exact same topic.

댓글을 달려면 로그인하십시오.

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by