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 ${{\mathbb{R}}^{n}}$Rn relying on Renyi entropy, which involves computing the usual Euclidean distance between these points. Two view points are adopted: (1) the graph to be c...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
PeerJ Inc.
2021-02-01
|
| Series: | PeerJ Computer Science |
| Subjects: | |
| Online Access: | https://peerj.com/articles/cs-366.pdf |