2021
DOI: 10.1016/j.joi.2021.101202
|View full text |Cite
|
Sign up to set email alerts
|

Bi-layer network analytics: A methodology for characterizing emerging general-purpose technologies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 20 publications
(8 citation statements)
references
References 62 publications
0
8
0
Order By: Relevance
“…Betweenness centrality measures the importance of a node in determining the flow of a network [ 22 ], and thus, in this study a high value of betweenness centrality indicates a crucial role in leading international collaborations. We particularly exploit a weighted betweenness centrality [ 23 ] to highlight the weight of edges (i.e., the frequency of collaboration) when calculating the shortest distance between two nodes. The equation for calculating betweenness centrality bc ( v i ) for node v i is given as follows: where V denotes the total number of nodes in a network, v m and v n are two different nodes in this network, then, represents the number of weighted shortest paths between the two nodes, and particularly measures the number of the weighted shortest paths between the two nodes and crossing node v i .…”
Section: Introductionmentioning
confidence: 99%
“…Betweenness centrality measures the importance of a node in determining the flow of a network [ 22 ], and thus, in this study a high value of betweenness centrality indicates a crucial role in leading international collaborations. We particularly exploit a weighted betweenness centrality [ 23 ] to highlight the weight of edges (i.e., the frequency of collaboration) when calculating the shortest distance between two nodes. The equation for calculating betweenness centrality bc ( v i ) for node v i is given as follows: where V denotes the total number of nodes in a network, v m and v n are two different nodes in this network, then, represents the number of weighted shortest paths between the two nodes, and particularly measures the number of the weighted shortest paths between the two nodes and crossing node v i .…”
Section: Introductionmentioning
confidence: 99%
“…Resource Allocation (RA): A CN‐based algorithm that allocates resources according to the degree of their CNs (Zhou et al, 2009). Weighted Resource Allocation (WRA): A refined RA algorithm that uses a weighted index to involve edge weights (Zhang, Wu, Miao, et al, 2021b). Semantic Diffusion (SD): To examine whether the drawback of embedding in local text data (Shang et al, 2020) exists in our local bibliometric dataset, we followed the general process of the proposed method but constructed a semantic layer to replace the co‐topic layer.…”
Section: Methodology: Diffusion‐based Network Analyticsmentioning
confidence: 99%
“…By integrating sights, sounds, and smells into the natural world as it is, Augmented Reality aids in the physical world. People can interact with both virtual and augmented reality because AR is too similar to the real world [27]. Augmented reality combines the physical and virtual worlds.…”
Section: Augmented Reality (Ar)mentioning
confidence: 99%