Entropy-based graph clustering - a simulated annealing approach

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Oggier, Frédérique, Phetsouvanh, Silivanxay, Datta, Anwitaman
Other Authors: School of Computer Science and Engineering
Format: Conference or Workshop Item
Language:English
Published: 2019
Subjects:
Clustering Algorithms
DRNTU::Science::Mathematics
Entropy
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
Description
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.

Similar Items