kopia lustrzana https://github.com/animator/learn-python
Update K-Means_Clustering.md
rodzic
5542f6ba9d
commit
7259dc7047
|
@ -67,11 +67,12 @@ The K-means algorithm follows an iterative approach to optimize cluster formatio
|
|||
print("Predicted cluster for new data:", predicted_cluster)
|
||||
|
||||
### Output:
|
||||
Before Implementing K-Means Clustering :
|
||||
Before Implementing K-Means Clustering
|
||||

|
||||
|
||||
|
||||
After Implementing K-Means Clustering:
|
||||
After Implementing K-Means Clustering
|
||||

|
||||
## Conclusion
|
||||
**K-Means** can be applied to data that has a smaller number of dimensions, is numeric, and is continuous or can be used to find groups that have not been explicitly labeled in the data. As an example, it can be used for Document Classification, Delivery Store Optimization, or Customer Segmentation.
|
||||
|
||||
|
|
Ładowanie…
Reference in New Issue