Scalable temporal latent space inference for link prediction in dynamic social networks (extended abstract)
AffiliationDepartment of Management Information Systems, University of Arizona
MetadataShow full item record
CitationZhu, L., Guo, D., Yin, J., Steeg, G. V., & Galstyan, A. (2017). Scalable temporal latent space inference for link prediction in dynamic social networks (Extended abstract). In Proceedings - 2017 IEEE 33rd International Conference on Data Engineering, ICDE 2017 (pp. 57-58).  IEEE Computer Society. DOI: 10.1109/ICDE.2017.35
Rights© 2017 IEEE
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at email@example.com.
AbstractUnderstanding 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.
VersionFinal accepted manuscript