A new fast entropy‐based method to generate composite centrality measures in complex networks
Yazarlar (2)
Dr. Öğr. Üyesi Levent Sabah Düzce Üniversitesi, Türkiye
Prof. Dr. Mehmet ŞİMŞEK Milli Savunma Üniversitesi, Türkiye
| Makale Türü | Özgün Makale (SSCI, AHCI, SCI, SCI-Exp dergilerinde yayınlanan tam makale) | ||
| Dergi Adı | Concurrency and Computation Practice and Experience (Q3) | ||
| Dergi ISSN | 1532-0626 Dergi Bilgileri (2023) | ||
| Dergi Tarandığı Indeksler | SCI | ||
| Makale Dili | Türkçe | Basım Tarihi | 02-2023 |
| Cilt / Sayı / Sayfa | 35 / 10 / – | DOI | 10.1002/cpe.7657 |
| Makale Linki | https://doi.org/10.1002/cpe.7657 | ||
| UAK Araştırma Alanları |
Algoritmalar ve Hesaplama Kuramı
|
||
| Özet |
| Determining the centrality of nodes in complex networks provides practical benefits in many areas such as detecting influencer nodes, viral marketing, and preventing the spread of rumors. On the other hand, there is no consensus for the definition of centrality. Therefore, different centrality measures such as degree, closeness, and betweenness have been developed to measure the centrality of a node. However, each centrality measure highlights the various characteristics of the nodes in the network from its own point of view. This causes each centrality measure to rank the nodes in a different order. In recent years, researchers have focused on approaches that combine multiple centrality measures. Thus, the perspectives of different centrality measures can be considered simultaneously. In this study, we have proposed a fast and efficient method using the analytic hierarchy process and entropy weighting to … |
| Anahtar Kelimeler |
| analytic hierarchy process | centrality measures | complex networks | entropy weighting |
| Atıf Sayıları | |
| Web of Science | 3 |
| Scopus | 4 |
| Google Scholar | 10 |