The 2018 International Symposium on Information Theory and Its Applications (ISITA2018)
Entropy-based Graph Clustering - A Simulated Annealing Approach
Frederique Oggier, Silivanxay Phetsouvanh, Anwitaman Datta,
We revisit a Renyi entropy based measure introduced originally for image clustering , 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 , as well as some other real world network.