Improving detection of influential nodes in complex networks
Amir Sheikhahmadi, Mohammad A. Nematbakhsh, and Arman Shokrollahi

TL;DR
This paper introduces an improved method called DegreeDistance and its two enhanced phases, FIDD and SIDD, for identifying influential nodes in complex networks, significantly outperforming existing measures in accuracy and efficiency.
Contribution
The paper proposes a novel measure, DegreeDistance, and two enhancement phases, FIDD and SIDD, to improve the accuracy of influential node detection in large-scale networks.
Findings
SIDD dramatically outperforms other measures in accuracy
DegreeDistance improves seed node identification
Enhanced phases reduce common neighbor issues
Abstract
Recently an increasing amount of research is devoted to the question of how the most influential nodes (seeds) can be found effectively in a complex network. There are a number of measures proposed for this purpose, for instance, high-degree centrality measure reflects the importance of the network topology and has a reasonable runtime performance to find a set of nodes with highest degree, but they do not have a satisfactory dissemination potentiality in the network due to having many common neighbors () and common neighbors of neighbors (). This flaw holds in other measures as well. In this paper, we compare high-degree centrality measure with other well-known measures using ten datasets in order to find a proportion for the common seeds in the seed sets obtained by them. We, thereof, propose an improved high-degree centrality measure (named…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
