Cargando…
From Leiden to Tel-Aviv University (TAU): exploring clustering solutions via a genetic algorithm
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,...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Oxford University Press
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10244004/ https://www.ncbi.nlm.nih.gov/pubmed/37287709 http://dx.doi.org/10.1093/pnasnexus/pgad180 |