Parallel median consensus clustering in complex networks

We develop an algorithm that finds the consensus among many different clustering solutions of a graph. We formulate the problem as a median set partitioning problem and propose a greedy optimization technique. Unlike other approaches that find median set partitions, our algorithm takes graph structu...

Celý popis

Podrobná bibliografia

Vydané v:	Scientific reports Ročník 15; číslo 1; s. 3788 - 15
Hlavní autori:	Hussain, Md Taufique, Halappanavar, Mahantesh, Chatterjee, Samrat, Radicchi, Filippo, Fortunato, Santo, Azad, Ariful
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Nature Publishing Group UK 30.01.2025 Nature Publishing Group Nature Portfolio
Predmet:	639/705/1046 639/705/117 Algorithms Clustering Community structure Graphs Humanities and Social Sciences Methods multidisciplinary Optimization techniques Science Science (multidisciplinary)
ISSN:	2045-2322, 2045-2322
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!