Cargando…
Starling: Introducing a mesoscopic scale with Confluence for Graph Clustering
Given a Graph G = (V, E) and two vertices i, j ∈ V, we introduce Confluence(G, i, j), a vertex mesoscopic closeness measure based on short Random walks, which brings together vertices from a same overconnected region of the Graph G, and separates vertices coming from two distinct overconnected regio...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10449208/ https://www.ncbi.nlm.nih.gov/pubmed/37619240 http://dx.doi.org/10.1371/journal.pone.0290090 |