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

id	sg-ntu-dr.10356-88099
record_format	dspace
spelling	sg-ntu-dr.10356-880992023-02-28T19:18:00Z Entropy-based graph clustering - a simulated annealing approach Oggier, Frédérique Phetsouvanh, Silivanxay Datta, Anwitaman School of Computer Science and Engineering School of Physical and Mathematical Sciences 2018 International Symposium on Information Theory and Its Applications (ISITA) Clustering Algorithms DRNTU::Science::Mathematics Entropy 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. Published version 2019-04-05T03:33:49Z 2019-12-06T16:55:57Z 2019-04-05T03:33:49Z 2019-12-06T16:55:57Z 2018-10-01 2018 Conference Paper Oggier, F., Phetsouvanh, S., & Datta, A. (2018). Entropy-based graph clustering - a simulated annealing approach. 2018 International Symposium on Information Theory and Its Applications (ISITA). doi:10.23919/ISITA.2018.8664249 https://hdl.handle.net/10356/88099 http://hdl.handle.net/10220/47989 10.23919/ISITA.2018.8664249 208636 en https://doi.org/10.21979/N9/TJMQ8L © 2018 Institute of Electronics, Information and Communication Engineers (IEICE). All rights reserved. This paper was published in 2018 International Symposium on Information Theory and Its Applications (ISITA) and is made available with permission of Institute of Electronics, Information and Communication Engineers (IEICE). 5 p. application/pdf
institution	Nanyang Technological University
building	NTU Library
continent	Asia
country	Singapore Singapore
content_provider	NTU Library
collection	DR-NTU
language	English
topic	Clustering Algorithms DRNTU::Science::Mathematics Entropy
spellingShingle	Clustering Algorithms DRNTU::Science::Mathematics Entropy Oggier, Frédérique Phetsouvanh, Silivanxay Datta, Anwitaman Entropy-based graph clustering - a simulated annealing approach
description	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.
author2	School of Computer Science and Engineering
author_facet	School of Computer Science and Engineering Oggier, Frédérique Phetsouvanh, Silivanxay Datta, Anwitaman
format	Conference or Workshop Item
author	Oggier, Frédérique Phetsouvanh, Silivanxay Datta, Anwitaman
author_sort	Oggier, Frédérique
title	Entropy-based graph clustering - a simulated annealing approach
title_short	Entropy-based graph clustering - a simulated annealing approach
title_full	Entropy-based graph clustering - a simulated annealing approach
title_fullStr	Entropy-based graph clustering - a simulated annealing approach
title_full_unstemmed	Entropy-based graph clustering - a simulated annealing approach
title_sort	entropy-based graph clustering - a simulated annealing approach
publishDate	2019
url	https://hdl.handle.net/10356/88099 http://hdl.handle.net/10220/47989 https://doi.org/10.21979/N9/TJMQ8L
_version_	1759858010151190528

Entropy-based graph clustering - a simulated annealing approach

Similar Items