-
Notifications
You must be signed in to change notification settings - Fork 43
New issue
Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? # to your account
Add example where KMedoids is better than existing scikit-learn clustering algorithms #22
Comments
The current code implements an inferior algorithm, so I'd rather suggest to compare the results of non-Python implementations (R, ELKI, |
kmedoid can be better than kmeans for example for robust purposes. For example, see this figure where kmedoid gives a really good result while kmeans detect any outlier as belonging to a class of its own (the data consist in 3 gaussian blobs and an "outlier" group situated far away from these blobs, and I don't know a lot of clustering algorithm that would exhibit this kind of robustness (in fact kmedoid is a little more stable on this example than the algorithm I did specifically to be robust, the second figure). This example could be added to the doc I think. |
That would be great! Do you already have the code for that example @TimotheeMathieu ? |
Yes, in fact it is an example I came up for the PR #42, you can find it here, I just added k-medoid with default parameters and I got the result displayed. Maybe it would be interesting to change the doc page I made to include k-medoid because in fact k-medoid is robust. I will try making a PR for this if it's alright for you. |
That would be great thank you ! |
In general if you see other things to improve in this repo don't hesitate to submit PRs, we are actively looking for maintainers :) |
From @rth in #12:
The text was updated successfully, but these errors were encountered: