Computational Experience On Four Algorithms For The Hard Clustering Problem
In this paper, we consider the problem of clustering m objects in c clusters. The objects are represented by points in n-dimensional Euclidean space, and the objective is to classify these m points into c clusters such that the distance between points within a cluster and its center is minimized. Th...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/2552/1/computational_experience_on_four_algorit_alsultan_isi_a1996uc27800009.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|