I have 2,000 people with 60 features, the feature are highly correlated. I can't remove the correlated features in my case: I need all the data. I want to group similar people using a clustering algorithm.
I have tried:
k-means
using Euclidean distance on "max-min" normalized data: the distribution between the group was somewhat even.h-clust
using mahalanobis distance on Moore-Penrose generalized Inverse matrix of the data: the distribution between the group was not good (more then half was in one group and all the other had very little people in it (1 or 2 people in some).
From what I have read for correlated data, it is best to compute distance using mahalanobis distance, but the result was very odd.
Did I compute it right?
Do you have other suggestion to cluster the people when the data is correlated?
prcomp
implements it. But without reading up, you'll have no idea how to interpret the output. $\endgroup$