On the parallel complexity of minimum sum of diameters clustering
© 2015 IEEE. Given a set of n entities to be classified, and a matric of dissimilarities between pairs of them. This paper considers the problem called Minimum Sum of Diameters Clustering Problem, where a partition of the set of entities into k clusters such that the sum of the diameters of these cl...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference Proceeding |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84964330317&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/55534 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
Be the first to leave a comment!