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: | 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: | |
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 |
Similar Items
-
A modular framework for centrality and clustering in complex networks
by: Oggier, Frederique, et al.
Published: (2023) -
A split-and-transfer flow based entropic centrality
by: Oggier, Frédérique, et al.
Published: (2020) -
Entropy-based fuzzy clustering and fuzzy modeling
by: Yao, J., et al.
Published: (2013) -
On parsimony and clustering
by: Oggier, Frederique, et al.
Published: (2023) -
EGRET : extortion graph exploration techniques in the Bitcoin network
by: Phetsouvanh, Silivanxay, et al.
Published: (2019)