2019
DOI: 10.1016/j.future.2018.11.023
|View full text |Cite
|
Sign up to set email alerts
|

Influential node ranking in social networks based on neighborhood diversity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
39
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 73 publications
(39 citation statements)
references
References 30 publications
0
39
0
Order By: Relevance
“…These studies of influence maximization aim to discover nodes that can activate as many nodes as possible, which indicates that the influence of nodes can be propagated as extensively as possible. For example, Zareie et al [11] introduce two influential node ranking algorithms that use the diversity of the neighbors of each node to obtain its ranking value. Kumar & Panda [12] propose a coreness-based method to find influential nodes by voting.…”
Section: Structural Methodsmentioning
confidence: 99%
“…These studies of influence maximization aim to discover nodes that can activate as many nodes as possible, which indicates that the influence of nodes can be propagated as extensively as possible. For example, Zareie et al [11] introduce two influential node ranking algorithms that use the diversity of the neighbors of each node to obtain its ranking value. Kumar & Panda [12] propose a coreness-based method to find influential nodes by voting.…”
Section: Structural Methodsmentioning
confidence: 99%
“…These centralities have many classical measures such as the degree centrality (DC) [16], betweenness centrality (BC) [16], closeness centrality (CC) [5], and eigenvector centrality (EC) [5]. In addition to new measures such as the H-index centrality [44], those in optimal percolation theory [3] and evidence theory [15], the technique for order preference by similarity to the ideal solution (TOPSIS) [48], and other measures [47,31,46]. These centrality measures have been applied in various fields such as game theory [32], human cooperation [19], evolutionary games [20], relevant website ranking [49], and node synchronization [4,38].…”
Section: Introductionmentioning
confidence: 99%
“…Currently, many algorithms have been proposed for identifying influential nodes. Most of the identification algorithms are designed for online social networks [17][18][19]. In these identifications, some influence measures, such as degree centrality [11], betweenness centrality [20], closeness centrality [21], and Katz centrality [22], are highly dependent on the topological structure of the network.…”
Section: Introductionmentioning
confidence: 99%