sort the rows of a matrix based on their distance from the mean

Hello,

Consider a 20x10 matrix.

I am interested in sorting its rows based on their euclidean distance from the mean (average).

The closest row to the mean will have the shortest distance from it.

Any help please?

Thank you.

Best,

Pavlos

Answer 1

[Sean de Wolski]

1. calculate the distances as Walter did in your other thread
2. sort this and keep the second output (ind) [~, ind] = sort(...)
3. reorder your matrix rowwise by ind Msorted = M(ind,:)

[pavlos]

Thank you very much.

Best,

Pavlos

Answer 2

[Rod]

Heres a full bit of code to do this Hope this will help someone out.

      scaleX = X - repmat(mean(X),length(X),1);

      XD  = sqrt(sum(abs(scaleX).^2,2));

      [~,idxs] = sort(XD);

      XRSorted = X(idxs,:);

Note: This assumes X is a matrix with each column as a different dimension.