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

Efficient incremental dynamic link prediction algorithms in social network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 38 publications
(11 citation statements)
references
References 30 publications
0
11
0
Order By: Relevance
“…Nonetheless, because of the huge computational time of Probabilistic graph models, their application is not practicable in real-life applications. 54 The problem of link prediction is typically formulated as a binary classification task (supervised learning) or a sorting problem on the node pairs (unsupervised learning). Some studies in this area have shown that the latter is not able to deal with the dynamics, interdependencies, and other features in the networks.…”
Section: Related Workmentioning
confidence: 99%
“…Nonetheless, because of the huge computational time of Probabilistic graph models, their application is not practicable in real-life applications. 54 The problem of link prediction is typically formulated as a binary classification task (supervised learning) or a sorting problem on the node pairs (unsupervised learning). Some studies in this area have shown that the latter is not able to deal with the dynamics, interdependencies, and other features in the networks.…”
Section: Related Workmentioning
confidence: 99%
“…Traditional link prediction methods often select test dataset and training dataset randomly, and repeat experiments to evaluate the effect of link prediction. However, the real world is mostly a dynamic network, and the edges and nodes are constantly changing over time [43]. Therefore, the proposed DGATNE model takes snapshots of the dynamic network at equal intervals in time series.…”
Section: The Evaluation Index Of Link Prediction Modelmentioning
confidence: 99%
“…Z. Zhang et al [108] proposed the two efficient and dynamic increment algorithms based on the improved latent space and resource allocation to predict links dynamically according to the SN structure updates referred to dynamic link prediction algorithms based on improved latent space (DLP-ILS) and dynamic link prediction algorithms based on improved resource allocation (DLP-IRA). The advantage of DLP-IRA and DLP-ILS is that they only need to recalculate the graph when being updated partially.…”
Section: ) Latent-feature-based Modelsmentioning
confidence: 99%
“…The advantage of DLP-IRA and DLP-ILS is that they only need to recalculate the graph when being updated partially. Conversely, the disadvantage is associated with the node adjacency relationship that does not have the common neighbors processed serially, not parallel [108]. Furthermore, Y. Li et al [109] proposed the utility-based link prediction method based on considering that individual preferences are the main reason behind the decision to form links.…”
Section: ) Latent-feature-based Modelsmentioning
confidence: 99%