Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

KMeans Cluster Member Proximity to Center #82

Open
normanhh3 opened this issue Mar 10, 2018 · 0 comments
Open

KMeans Cluster Member Proximity to Center #82

normanhh3 opened this issue Mar 10, 2018 · 0 comments

Comments

@normanhh3
Copy link

I've been playing with K-Means the last few days and found some clusters with some data I'm interested in, which is great! I'd love to be able to rank the members of the clusters I am interested in by distance from the cluster center.

It doesn't look like the data available in the Cluster type offers the ability to do that. Is there something I'm missing? I see that there is a vector for the center of the cluster. I think the piece that I am missing are vectors for each member. I think if I had that, I could then do something like a Euclidian distance calculation to determine the ranking that I want. Does this sound like the right path?

Any thoughts are certainly appreciated!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant