Entropy-based graph clustering - a simulated annealing approach
We revisit a Renyi entropy based measure introduced originally for image clustering [1], and study its application to graph clustering. To effectuate Renyi entropy based graph clustering, we propose a simulated annealing algorithm. We explore our algorithm’s efficacy and limitations with the Karate...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/88099 http://hdl.handle.net/10220/47989 https://doi.org/10.21979/N9/TJMQ8L |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Be the first to leave a comment!