| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Density-based entropy centrality for community detection in complex networks
Authors:ID Rizman Žalik, Krista (Author)
ID Žalik, Mitja (Author)
Files:.pdf Zalik-2023-Density-Based_Entropy_Centrality_fo.pdf (707,65 KB)
MD5: 185CB0686E379FF05F6E5E267A67C14A
 
URL https://www.mdpi.com/1099-4300/25/8/1196
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:One of the most important problems in complex networks is the location of nodes that are essential or play a main role in the network. Nodes with main local roles are the centers of real communities. Communities are sets of nodes of complex networks and are densely connected internally. Choosing the right nodes as seeds of the communities is crucial in determining real communities. We propose a new centrality measure named density-based entropy centrality for the local identification of the most important nodes. It measures the entropy of the sum of the sizes of the maximal cliques to which each node and its neighbor nodes belong. The proposed centrality is a local measure for explaining the local influence of each node, which provides an efficient way to locally identify the most important nodes and for community detection because communities are local structures. It can be computed independently for individual vertices, for large networks, and for not well-specified networks. The use of the proposed density-based entropy centrality for community seed selection and community detection outperforms other centrality measures.
Keywords:networks, undirected graphs, community detection, node centrality, label propagation
Publication status:Published
Publication version:Version of Record
Submitted for review:08.06.2023
Article acceptance date:02.08.2023
Publication date:11.08.2023
Publisher:MDPI
Year of publishing:2023
Number of pages:Str. 17
Numbering:Letn. 25, Št. 8, št. članka 1196
PID:20.500.12556/DKUM-87009-fa25f5ad-6451-8c91-95cd-ad7a80a9e9bc New window
UDC:004
ISSN on article:1099-4300
COBISS.SI-ID:162692099 New window
DOI:10.3390/e25081196 New window
Publication date in DKUM:06.02.2024
Views:580
Downloads:52
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Entropy
Shortened title:Entropy
Publisher:MDPI
ISSN:1099-4300
COBISS.SI-ID:515806233 New window

Document is financed by a project

Funder:ARRS - Slovenian Research Agency
Project number:P2-0041
Name:Računalniški sistemi, metodologije in inteligentne storitve

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Licensing start date:11.08.2023

Secondary language

Language:Slovenian
Keywords:omrežja, neusmerjeni grafi, zaznavanje skupnosti, centralnost vozlišč, širjenje oznak


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica