Proceedings of the 2014 SIAM International Conference on Data Mining 2014
DOI: 10.1137/1.9781611973440.33
|View full text |Cite
|
Sign up to set email alerts
|

A Deep Learning Approach to Link Prediction in Dynamic Networks

et al.
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
86
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 127 publications
(86 citation statements)
references
References 13 publications
0
86
0
Order By: Relevance
“…Finally, for both node and edge based prediction tasks, there is a body of recent work for supervised feature learning based on existing and novel graph-specific deep network architectures [15, 16, 17, 31, 39]. These architectures directly minimize the loss function for a downstream prediction task using several layers of non-linear transformations which results in high accuracy, but at the cost of scalability due to high training time requirements.…”
Section: Related Workmentioning
confidence: 99%
“…Finally, for both node and edge based prediction tasks, there is a body of recent work for supervised feature learning based on existing and novel graph-specific deep network architectures [15, 16, 17, 31, 39]. These architectures directly minimize the loss function for a downstream prediction task using several layers of non-linear transformations which results in high accuracy, but at the cost of scalability due to high training time requirements.…”
Section: Related Workmentioning
confidence: 99%
“…• To test the correctness, we compare our optimal setting (i.e., τ =1, α=0.5) of the explicit social influence function with its different forms such as: 1) without temporal smoothing component i.e., η u t = 1 |F u t | m∈F u t p s t ≤ s t (u, m) , and 2) replacing our function by the social influence function in the ctRBM [12], this becomes the aforementioned SctRBM. Figure 6b shows that either the SRBM without temporal smoothing or the SctRBM have significant lower prediction accuracies compared with the SRBM with optimal setting.…”
Section: Methodsmentioning
confidence: 99%
“…However, it cannot capture the social influences on individual behaviors in the multiple agent scenario. Li et al [12] proposed a ctRBM model for link prediction in dynamic networks. The ctRBM simulates the social influences by adding the prediction expectations of local neighbors on an individual into a dynamic bias.…”
Section: The Rbms and Related Workmentioning
confidence: 99%
“…The structural link prediction problem, which only considers a single network structure as the input, predicts the possible unobserved links within the same network [Liben-Nowell and Kleinberg, 2007;Lichtenwalter et al, 2010]. Temporal link prediction models, on the other hand, analyze the evolution pattern of a sequence of networks over time [Sarkar et al, 2012;Dunlavy et al, 2011;Li et al, 2014;Zhu et al, 2016;Rahman and Al Hasan, 2016]. The probabilistic nonparametric link prediction model can be used to predict the linkage possibility of two nodes only based on the similarity of their local neighborhoods [Sarkar et al, 2012].…”
Section: Related Workmentioning
confidence: 99%