Clustering datasets with missing values using modified K-medoids algorithm
A modification was done to the Euclidean distance to compute distance for incomplete data points, at the same time flagging them so that the algorithm will avoid choosing them as cluster medoids. This resulted to the Modified K-medoids clustering algorithm applied with pre-processing methods, namely...
| Auteur principal: | |
|---|---|
| Format: | Thèse |
| Langue: | anglais |
| Publié: |
2008
|
| Sujets: |