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

Create k_means_clustering.cpp #358

Open
wants to merge 1 commit into
base: main
Choose a base branch
from

Conversation

Moumita-08
Copy link

This pull request adds a C++ implementation of the K-Means Clustering algorithm, which uses Euclidean distance to group data points based on proximity to centroids. Users can specify the number of clusters, data points, and iterations. After processing, the final centroids and cluster assignments are displayed, providing a foundational tool for clustering analysis.

@panditakshay402 panditakshay402 self-requested a review October 16, 2024 03:28
Copy link
Owner

@panditakshay402 panditakshay402 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@Moumita-08 kindly follow all the rules from readme.md to get PR merged.

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

Successfully merging this pull request may close these issues.

2 participants