2020
DOI: 10.1016/j.knosys.2020.105598
|View full text |Cite
|
Sign up to set email alerts
|

Interlayer link prediction in multiplex social networks: An iterative degree penalty algorithm

Abstract: structure-based methods when the multiplex network average degree and node overlapping rate are low.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
12
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
3
2

Relationship

3
5

Authors

Journals

citations
Cited by 45 publications
(13 citation statements)
references
References 59 publications
(92 reference statements)
1
12
0
Order By: Relevance
“…Zhou et al [28] proposed a friend-relationship-based user identification (FRUI) algorithm that counts the number of shared friends to calculate the degree of match for all candidate-matched node pairs and chooses pairs that have the maximum value as the final set of matched pairs. Tang et al [15] further investigated the importance of the scale-free property of real-world SMNs for accomplishing interlayer link prediction and proposed a degree penalty principle to calculate the degree of match of all unmatched node pairs. Ren et al [55] defined a set of meta-diagrams for feature extraction and used greedy link selection for the interlayer link prediction.…”
Section: Non-embedding-based Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Zhou et al [28] proposed a friend-relationship-based user identification (FRUI) algorithm that counts the number of shared friends to calculate the degree of match for all candidate-matched node pairs and chooses pairs that have the maximum value as the final set of matched pairs. Tang et al [15] further investigated the importance of the scale-free property of real-world SMNs for accomplishing interlayer link prediction and proposed a degree penalty principle to calculate the degree of match of all unmatched node pairs. Ren et al [55] defined a set of meta-diagrams for feature extraction and used greedy link selection for the interlayer link prediction.…”
Section: Non-embedding-based Methodsmentioning
confidence: 99%
“…The goal of interlayer link prediction is to leverage feature or structure information to determine whether accounts across different SMNs belong to the same user [15]; this is a challenging task in multiplex network analysis. It is also known as anchor link prediction [16,17], network alignment [18,19,20,21,22], user identification [23], and user identity linkage [21].…”
Section: Introductionmentioning
confidence: 99%
“…Different evaluation criteria such as Precision, Recall and F-measure are used to confirm the performance of the proposed method [29]. Precision is defined as the ratio of the number of correct users suggested (𝑇𝑜𝑝𝐾) to the total number of users suggested.…”
Section: Evaluation Criteriamentioning
confidence: 99%
“…The online social network is characterized by a complex network in which users are represented as nodes and the follower-followee information as edges [45,46,47]. We construct a directed social graph.…”
Section: Social Graph Buildingmentioning
confidence: 99%