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...

Full description

Bibliographic Details

Published in:	Scientific reports Vol. 15; no. 1; pp. 3788 - 15
Main Authors:	Hussain, Md Taufique, Halappanavar, Mahantesh, Chatterjee, Samrat, Radicchi, Filippo, Fortunato, Santo, Azad, Ariful
Format:	Journal Article
Language:	English
Published:	London Nature Publishing Group UK 30.01.2025 Nature Publishing Group Nature Portfolio
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!