Research Article
A Search History-Driven Offspring Generation Method for the Real-Coded Genetic Algorithm
| Input: number of clusters , | | Data points | | Output: cluster centroids | | (1) | cluster centroids are randomly initialized | | (2) | While termination criterion is not satisfied do | | (3) | For do | | (4) | assign the nearest cluster centroid ID to | | (5) | end | | (6) | For do | | (7) | update by calculating the mean of data points in the -th cluster | | (8) | end | | (9) | end | | (10) | Return |
|