Načítá se...
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...
Uloženo v:
| Vydáno v: | PeerJ Comput Sci |
|---|---|
| Hlavní autoři: | , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
PeerJ Inc.
2021
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7959621/ https://ncbi.nlm.nih.gov/pubmed/33817016 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.7717/peerj-cs.366 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|