Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/580
DC FieldValueLanguage
dc.contributor.authorDžamić, Dušanen_US
dc.contributor.authorPei, Junen_US
dc.contributor.authorMarić, Miroslaven_US
dc.contributor.authorMladenović, Nenaden_US
dc.contributor.authorPardalos, Panos M.en_US
dc.date.accessioned2022-08-13T14:52:04Z-
dc.date.available2022-08-13T14:52:04Z-
dc.date.issued2020-01-01-
dc.identifier.issn09696016en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/580-
dc.description.abstractOne of the most popular topics in analyzing complex networks is the detection of its community structure. In this paper, we introduce a new criterion for community detection, called the E-quality function. The quality of an individual community is defined as a difference between its benefit and its cost, where both are exponential functions of the number of internal edges and the number of external edges, respectively. The obtained optimization problem, maximization of the E-quality function over all possible partitions of a network, is solved by the variable neighborhood search (VNS)-based heuristic. Comparison of the new criterion and modularity is performed on the usual test instances from the literature. Experimental results obtained both on artificial and real networks show that the proposed E-quality function allows detection of the communities existing in the network.en_US
dc.language.isoenen_US
dc.publisherWileyen_US
dc.relation.ispartofInternational Transactions in Operational Researchen_US
dc.subjectcommunity detectionen_US
dc.subjectcomplex networken_US
dc.subjectexponential ratioen_US
dc.subjectquality functionen_US
dc.subjectvariable neighborhood searchen_US
dc.titleExponential quality function for community detection in complex networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1111/itor.12538-
dc.identifier.scopus2-s2.0-85044451824-
dc.identifier.isi000478733800011-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85044451824-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.issn0969-6016en_US
dc.description.rankM21en_US
dc.relation.firstpage245en_US
dc.relation.lastpage266en_US
dc.relation.volume27en_US
dc.relation.issue1en_US
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.languageiso639-1en-
item.cerifentitytypePublications-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0001-7446-0577-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

5
checked on Jun 12, 2025

Page view(s)

26
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.