TY - GEN
T1 - A deep learning approach to link prediction in dynamic networks
AU - Li, Xiaoyi
AU - Du, Nan
AU - Li, Hui
AU - Li, Kang
AU - Gao, Jing
AU - Zhang, Aidong
N1 - Publisher Copyright:
Copyright © SIAM.
PY - 2014
Y1 - 2014
N2 - Time varying problems usually have complex underlying structures represented as dynamic networks where entities and relationships appear and disappear over time. The problem of efficiently performing dynamic link inference is extremely challenging due to the dynamic nature in massive evolving networks especially when there exist sparse connectivities and nonlinear transitional patterns. In this paper, we propose a novel deep learning framework, i.e., Conditional Temporal Restricted Boltzmann Machine (ctRBM), which predicts links based on individual transition variance as well as influence introduced by local neighbors. The proposed model is robust to noise and have the exponential capability to capture nonlinear variance. We tackle the computational challenges by developing an efficient algorithm for learning and inference of the proposed model. To improve the efficiency of the approach, we give a faster approximated implementation based on a proposed Neighbor Influence Clustering algorithm. Extensive experiments on simulated as well as real-world dynamic networks show' that the proposed method outperforms existing algorithms in link inference on dynamic networks.
AB - Time varying problems usually have complex underlying structures represented as dynamic networks where entities and relationships appear and disappear over time. The problem of efficiently performing dynamic link inference is extremely challenging due to the dynamic nature in massive evolving networks especially when there exist sparse connectivities and nonlinear transitional patterns. In this paper, we propose a novel deep learning framework, i.e., Conditional Temporal Restricted Boltzmann Machine (ctRBM), which predicts links based on individual transition variance as well as influence introduced by local neighbors. The proposed model is robust to noise and have the exponential capability to capture nonlinear variance. We tackle the computational challenges by developing an efficient algorithm for learning and inference of the proposed model. To improve the efficiency of the approach, we give a faster approximated implementation based on a proposed Neighbor Influence Clustering algorithm. Extensive experiments on simulated as well as real-world dynamic networks show' that the proposed method outperforms existing algorithms in link inference on dynamic networks.
UR - https://www.scopus.com/pages/publications/84954101093
U2 - 10.1137/1.9781611973440.33
DO - 10.1137/1.9781611973440.33
M3 - Conference contribution
AN - SCOPUS:84954101093
T3 - SIAM International Conference on Data Mining 2014, SDM 2014
SP - 289
EP - 297
BT - SIAM International Conference on Data Mining 2014, SDM 2014
A2 - Zaki, Mohammed J.
A2 - Banerjee, Arindam
A2 - Parthasarathy, Srinivasan
A2 - Ning-Tan, Pang
A2 - Obradovic, Zoran
A2 - Kamath, Chandrika
PB - Society for Industrial and Applied Mathematics Publications
T2 - 14th SIAM International Conference on Data Mining, SDM 2014
Y2 - 24 April 2014 through 26 April 2014
ER -