K-Means is a clustering algorithm which is used for cluster analysis in data mining; it partitions the data set into k clusters. In this project, K-Means algorithm is optimized using PSO (Parm Swarm Optimization)in terms of time. PSO simulates the social behavior of birds and helps to improve candidate solution iteratively. This project is made in python and has been tested on some standard data sets.
-
Notifications
You must be signed in to change notification settings - Fork 2
K-Means is a clustering algorithm which is used for cluster analysis in data mining; it partitions the data set into k clusters. In this project, K-Means algorithm is optimized using PSO (Parm Swarm Optimization)in terms of time. PSO simulates the social behavior of birds and helps to improve candidate solution iteratively. This project is made …
jatin24/optimization-of-kmeans-algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
K-Means is a clustering algorithm which is used for cluster analysis in data mining; it partitions the data set into k clusters. In this project, K-Means algorithm is optimized using PSO (Parm Swarm Optimization)in terms of time. PSO simulates the social behavior of birds and helps to improve candidate solution iteratively. This project is made …
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published