Cargando…
Renyi entropy driven hierarchical graph clustering
This article explores a graph clustering method that is derived from an information theoretic method that clusters points in [Image: see text] relying on Renyi entropy, which involves computing the usual Euclidean distance between these points. Two view points are adopted: (1) the graph to be cluste...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
PeerJ Inc.
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7959621/ https://www.ncbi.nlm.nih.gov/pubmed/33817016 http://dx.doi.org/10.7717/peerj-cs.366 |