Summary
The 2018 International Symposium on Information Theory and Its Applications (ISITA2018)
2018
Session Number:Mo-PM-2-3
Session:
Number:Mo-PM-2-3.3
Entropy-based Graph Clustering - A Simulated Annealing Approach
Frederique Oggier, Silivanxay Phetsouvanh, Anwitaman Datta,
pp.242-246
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.Mo-PM-2-3.3
PDF download
Summary:
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 club graph [2], as well as some other real world network.