A new centrality metric called Node Pack Fuzzy Information Centrality (NPFIC), which suggests that crucial information about a node's significance can be derived from the internal structure of its pack and is compared with four established centrality measures.
Comparing the ISM centrality measures to commonly used weighted variants of out-degree, in-degree, closeness, shortest-path betweenness, and Katz centrality in directed, weighted networks shows strong correlations between the ISM out-centrality and weighted out-degree and outward Katz centrality, particularly for low e...
This study introduces a new ranking framework that integrates a quasi-Laplacian structural measure with a gravity-inspired aggregation process and demonstrates that the proposed framework consistently outperforms existing techniques in terms of accuracy, resolution, and computational simplicity.
Shima Esfandiari, S. M. Fakhrahmad· arXiv.org· 0 citations
Experimental results on both synthetic and real-world HoMLN datasets demonstrate that the heuristics achieve accuracy comparable to the ground truth while significantly improving computational efficiency, thereby establishing the scalability and effectiveness of the HoMLN algorithms developed using the decoupling appro...
A. Ayowole-Obi, Abhishek Santra, Sharma Chakravarthy· 0 citations
A GPS-BC module that has the capability to formulate accurate solutions for Betweenness Centrality problems using tailored algorithms using validated algorithms is proposed.
Terry Chang, Chung-Hsien Chou· International Journal of Sem...· 0 citations
Experimental results in seven complex networks of the real world show that the proposed hybrid centrality called k-core neighborhood density (KND) remarkably balances rank distribution and accuracy, and the identified influential nodes have a superior ability to spread their influence over a wide area of a network.
WKDH fuses local structural attributes with global structural attributes via a multiplicative weighted synergy model, simultaneously capturing local connection “quantity,” local connection “quality,” and global core-layer position, and achieves linear computational complexity of O(m).
Na Zhao, Chaozhou Dai, Guo-Lin Yang et al.· Entropy· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
