Next Article in Journal
Pearle’s Hidden-Variable Model Revisited
Next Article in Special Issue
Analyzing Uncertainty in Complex Socio-Ecological Networks
Previous Article in Journal
Probabilistic Modeling with Matrix Product States
Previous Article in Special Issue
Predicting the Evolution of Physics Research from a Complex Network Perspective
Open AccessArticle

Multi-Type Node Detection in Network Communities

by 1,2, 1,*, 1, 1 and 1
Software College, Northeastern University, Shenyang 110000, China
Department of Computer Engineering, Michael Okpara University of Agriculture, Umudike 440109, Nigeria
Author to whom correspondence should be addressed.
Entropy 2019, 21(12), 1237;
Received: 31 October 2019 / Revised: 27 November 2019 / Accepted: 27 November 2019 / Published: 17 December 2019
(This article belongs to the Special Issue Computation in Complex Networks)
Patterns of connectivity among nodes on networks can be revealed by community detection algorithms. The great significance of communities in the study of clustering patterns of nodes in different systems has led to the development of various methods for identifying different node types on diverse complex systems. However, most of the existing methods identify only either disjoint nodes or overlapping nodes. Many of these methods rarely identify disjunct nodes, even though they could play significant roles on networks. In this paper, a new method, which distinctly identifies disjoint nodes (node clusters), disjunct nodes (single node partitions) and overlapping nodes (nodes binding overlapping communities), is proposed. The approach, which differs from existing methods, involves iterative computation of bridging centrality to determine nodes with the highest bridging centrality value. Additionally, node similarity is computed between the bridge-node and its neighbours, and the neighbours with the least node similarity values are disconnected. This process is sustained until a stoppage criterion condition is met. Bridging centrality metric and Jaccard similarity coefficient are employed to identify bridge-nodes (nodes at cut points) and the level of similarity between the bridge-nodes and their direct neighbours respectively. Properties that characterise disjunct nodes are equally highlighted. Extensive experiments are conducted with artificial networks and real-world datasets and the results obtained demonstrate efficiency of the proposed method in distinctly detecting and classifying multi-type nodes in network communities. This method can be applied to vast areas such as examination of cell interactions and drug designs, disease control in epidemics, dislodging organised crime gangs and drug courier networks, etc. View Full-Text
Keywords: bridging centrality; community detection; disjoint nodes; disjunct nodes; node similarity; overlapping nodes bridging centrality; community detection; disjoint nodes; disjunct nodes; node similarity; overlapping nodes
Show Figures

Figure 1

MDPI and ACS Style

Ezeh, C.; Tao, R.; Zhe, L.; Yiqun, W.; Ying, Q. Multi-Type Node Detection in Network Communities. Entropy 2019, 21, 1237.

AMA Style

Ezeh C, Tao R, Zhe L, Yiqun W, Ying Q. Multi-Type Node Detection in Network Communities. Entropy. 2019; 21(12):1237.

Chicago/Turabian Style

Ezeh, Chinenye; Tao, Ren; Zhe, Li; Yiqun, Wang; Ying, Qu. 2019. "Multi-Type Node Detection in Network Communities" Entropy 21, no. 12: 1237.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Search more from Scilit
Back to TopTop