Some Properties of E-Quality Function for Network Clustering
Yugoslav journal of operations research, Tome 31 (2021) no. 1, p. 65
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
One of the most important properties of graphs that represents real complex
systems is community structure, or clustering, i.e., organizing vertices in cohesive groups
with high concentration of edges within individual groups and low concentration of edges
between vertices in different groups. In this paper, we analyze Exponential Quality
function for network clustering. We consider different classes of artificial networks from
literature and analyze whether the maximization of Exponential Quality function tends
to merge or split clusters in optimal partition even if they are unambiguously defined.
Our theoretical results show that Exponential Quality function detects the expected and
reasonable clusters in all classes of instances and the Modularity function does not.
Classification :
90B85, 90C26
Keywords: Clustering, Equality Function, Complex Networks
Keywords: Clustering, Equality Function, Complex Networks
@article{YJOR_2021_31_1_a3,
author = {Du\v{s}san D\v{z}ami\'c},
title = {Some {Properties} of {E-Quality} {Function} for {Network} {Clustering}},
journal = {Yugoslav journal of operations research},
pages = {65 },
year = {2021},
volume = {31},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2021_31_1_a3/}
}
Dušsan Džamić. Some Properties of E-Quality Function for Network Clustering. Yugoslav journal of operations research, Tome 31 (2021) no. 1, p. 65 . http://geodesic.mathdoc.fr/item/YJOR_2021_31_1_a3/