NC algorithms for minimum sum of diameters clustering
Given a set of n entities to be classified, and a matric of dissimilarities between pairs of them. This article considers the problem called Minimum Sum of Diameters Clustering Problem, where a partition of the set of entities into κ clusters such that the sum of the diameters of these clusters is m...
Saved in:
Main Authors: | Juneam N., Kantabutra S. |
---|---|
格式: | 雜誌 |
出版: |
2017
|
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85028464135&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/40906 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Chiang Mai University |
相似書籍
-
NC algorithms for minimum sum of diameters clustering
由: Nopadon Juneam, et al.
出版: (2018) -
NC algorithms for minimum sum of diameters clustering
由: Nopadon Juneam, et al.
出版: (2018) -
On the parallel complexity of minimum sum of diameters clustering
由: Juneam N., et al.
出版: (2017) -
On the parallel complexity of minimum sum of diameters clustering
由: Nopadon Juneam, et al.
出版: (2018) -
CPF minimum sum : adequate and achievable?
由: Li, Yun Fan., et al.
出版: (2013)