A modified k-means clustering algorithm with Mahalanobis distance for clustering incomplete data sets
Cluster analysis is an art of finding grounds in data in such a way that objects in the same group are similar to each other, whereas objects in different groups are as dissimilar as possible. The most commonly used clustering algorithm is the K-means with Euclidean distance. However, such distance...
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Thesis |
| Γλώσσα: | English |
| Έκδοση: |
2009
|
| Θέματα: |