TY - JOUR
T1 - From Leiden to Tel-Aviv University (TAU)
T2 - exploring clustering solutions via a genetic algorithm
AU - Gilad, Gal
AU - Sharan, Roded
N1 - Publisher Copyright:
© The Author(s) 2023. Published by Oxford University Press on behalf of National Academy of Sciences. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited.
PY - 2023/6/1
Y1 - 2023/6/1
N2 - Graph clustering is a fundamental problem in machine learning with numerous applications in data science. State-of-the-art approaches to the problem, Louvain and Leiden, aim at optimizing the modularity function. However, their greedy nature leads to fast convergence to sub-optimal solutions. Here, we design a new approach to graph clustering, Tel-Aviv University (TAU), that efficiently explores the solution space using a genetic algorithm. We benchmark TAU on synthetic and real data sets and show its superiority over previous methods both in terms of the modularity of the computed solution and its similarity to a ground-truth partition when such exists. TAU is available at https://github.com/GalGilad/TAU.
AB - Graph clustering is a fundamental problem in machine learning with numerous applications in data science. State-of-the-art approaches to the problem, Louvain and Leiden, aim at optimizing the modularity function. However, their greedy nature leads to fast convergence to sub-optimal solutions. Here, we design a new approach to graph clustering, Tel-Aviv University (TAU), that efficiently explores the solution space using a genetic algorithm. We benchmark TAU on synthetic and real data sets and show its superiority over previous methods both in terms of the modularity of the computed solution and its similarity to a ground-truth partition when such exists. TAU is available at https://github.com/GalGilad/TAU.
KW - community detection
KW - graph clustering
KW - modularity optimization
UR - http://www.scopus.com/inward/record.url?scp=85177558622&partnerID=8YFLogxK
U2 - 10.1093/pnasnexus/pgad180
DO - 10.1093/pnasnexus/pgad180
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
C2 - 37287709
AN - SCOPUS:85177558622
SN - 2752-6542
VL - 2
JO - PNAS Nexus
JF - PNAS Nexus
IS - 6
M1 - pgad180
ER -