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

K Medoid Based Clustering #147

Closed
prathimacode-hub opened this issue Oct 31, 2021 · 2 comments · Fixed by #148
Closed

K Medoid Based Clustering #147

prathimacode-hub opened this issue Oct 31, 2021 · 2 comments · Fixed by #148
Assignees
Labels
Assigned Issue is assigned Hacktoberfest

Comments

@prathimacode-hub
Copy link
Owner

Hey hacktoberfest participants, good to see you here

This issue will helps readers in giving all the guidance that one needs to learn about K Medoid Based Clustering. Tutorial to K Medoid Based Clustering and how it's applied using sample code.

"Project Title" should be the "Issue Title" mentioned here.

If you like to work on this issue, follow the given guidelines for code as well as for the README. You have to be as elaborative as possible. Make sure you also maintain the project structure provided. Just comment and get it assigned. Issues are allotted on FCFS basis.

The main intention of this repo is to educate beginners with all the concepts related to data science so that they could feel confident to apply these things learnt in practical exposure.

Enjoy your open source journey ahead. 😎

@photon149
Copy link
Contributor

Hello , I would like to work on the issue , will explain k medoid algorithm , alongside a proper neat impementation of the code plus a comparison of how the kmedoid algorithm performs in comparison to other algorithms as well.

@prathimacode-hub
Copy link
Owner Author

Issue assigned. @photon149

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

Successfully merging a pull request may close this issue.

2 participants