Scalable temporal latent space inference for link prediction in dynamic social networks (extended abstract)

• Main Authors: Zhu, Linhong, Guo, Dong, Yin, Junming, Ver Steeg, Greg, Galstyan, Aram
• Other Authors: Department of Management Information Systems, University of Arizona
• Language: en
• Published: IEEE 2017
• Subjects: Inference algorithms; Prediction algorithms; Facebook; Heuristic algorithms
• Online Access: http://hdl.handle.net/10150/626028; http://arizona.openrepository.com/arizona/handle/10150/626028

Understanding and characterizing the processes driving social interactions is one of the fundamental problems in social network research. A particular instance of this problem, known as link prediction, has recently attracted considerable attention in various research communities. Link prediction has many important commercial applications, e.g., recommending friends in an online social network such as Facebook and suggesting interesting pins in a collection sharing network such as Pinterest. This work is focused on the temporal link prediction problem: Given a sequence of graph snapshots G1, · ··, Gt from time 1 to t, how do we predict links in future time t + 1? To perform link prediction in a network, one needs to construct models for link probabilities between pairs of nodes. A temporal latent space model is proposed that is built upon latent homophily assumption and temporal smoothness assumption. First, the proposed modeling allows to naturally incorporate the well-known homophily effect (birds of a feather flock together). Namely, each dimension of the latent space characterizes an unobservable homogeneous attribute, and shared attributes tend to create a link in a network.