Distance and clustering.
3 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
In k-means clustering code which uses Euclidean distance. I want to replace Euclidean distance by Mahalanobis distance.
0 commentaires
Réponses (1)
Image Analyst
le 13 Août 2016
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 commentaire
John D'Errico
le 13 Août 2016
hello_world has been asking the same question repeatedly. This is the 4th question I've seen from them on the exact same topic.
Voir également
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!