On the parallel complexity of minimum sum of diameters clustering

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 clusters is min...

Celý popis

Podrobná bibliografia

Vydané v:	2015 International Computer Science and Engineering Conference (ICSEC) s. 1 - 6
Hlavní autori:	Juneam, Nopadon, Kantabutra, Sanpawat
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.11.2015
Predmet:	application in social networking clustering Clustering algorithms Complexity theory Computational modeling minimum sum of diameters Parallel algorithms parallel complexity Phase change random access memory PRAM algorithm Program processors Social network services
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!