Cross-Temporal Link Prediction

The increasing interest in dynamically changing networks has led to growing interest in a more general link prediction problem called temporal link prediction in the data mining and machine learning communities. However, only links in identical time frames are considered in temporal link prediction. We propose a new link prediction problem called cross-temporal link prediction in which the links among nodes in different time frames are inferred. A typical example of cross-temporal link prediction is cross-temporal entity resolution to determine the identity of real entities represented by data objects observed in different time periods. In dynamic environments, the features of data change over time, making it difficult to identify cross-temporal links by directly comparing observed data. Other examples of cross-temporal links are asynchronous communications in social networks such as Face book and Twitter, where a message is posted in reply to a previous message. We adopt a dimension reduction approach to cross-temporal link prediction, that is, data objects in different time frames are mapped into a common low-dimensional latent feature space, and the links are identified on the basis of the distance between the data objects. The proposed method uses different low-dimensional feature projections in different time frames, enabling it to adapt to changes in the latent features over time. Using multi-task learning, it jointly learns a set of feature projection matrices from the training data, given the assumption of temporal smoothness of the projections. The optimal solutions are obtained by solving a single generalized eigenvalue problem. Experiments using a real-world set of bibliographic data for cross-temporal entity resolution showed that introducing time-dependent feature projections improves the accuracy of link prediction.

[1]  Padhraic Smyth,et al.  Prediction and ranking algorithms for event-based network data , 2005, SKDD.

[2]  Rich Caruana,et al.  Multitask Learning , 1998, Encyclopedia of Machine Learning and Data Mining.

[3]  Shin Ishii,et al.  Dynamic Exponential Family Matrix Factorization , 2009, PAKDD.

[4]  Eytan Adar,et al.  Implicit Structure and the Dynamics of Blogspace , 2004 .

[5]  Lise Getoor,et al.  Link mining: a survey , 2005, SKDD.

[6]  William Nick Street,et al.  Collaborative filtering via euclidean embedding , 2010, RecSys '10.

[7]  Yoshihiro Yamanishi,et al.  Supervised Bipartite Graph Inference , 2008, NIPS.

[8]  Mohammad Al Hasan,et al.  Link prediction using supervised learning , 2006 .

[9]  Charles A. Micchelli,et al.  Kernels for Multi--task Learning , 2004, NIPS.

[10]  Yoshihiro Yamanishi,et al.  Supervised Graph Inference , 2004, NIPS.

[11]  Christopher D. Manning,et al.  Using Feature Conjunctions Across Examples for Learning Pairwise Classifiers , 2004, ECML.

[12]  Xiaofei He,et al.  Locality Preserving Projections , 2003, NIPS.

[13]  Hisashi Kashima,et al.  Fast and Scalable Algorithms for Semi-supervised Link Prediction on Static and Dynamic Graphs , 2010, ECML/PKDD.

[14]  Thomas Hofmann,et al.  Unifying collaborative and content-based filtering , 2004, ICML.

[15]  Tamara G. Kolda,et al.  Temporal Link Prediction Using Matrix and Tensor Factorizations , 2010, TKDD.

[16]  Katsumi Tanaka,et al.  Identification of time-varying objects on the web , 2008, JCDL '08.

[17]  A. Moore,et al.  Dynamic social network analysis using latent space models , 2005, SKDD.

[18]  Pradeep Ravikumar,et al.  Adaptive Name Matching in Information Integration , 2003, IEEE Intell. Syst..

[19]  Stephen J. Green,et al.  Building Hypertext Links By Computing Semantic Similarity , 1999, IEEE Trans. Knowl. Data Eng..

[20]  Zan Huang,et al.  The Time-Series Link Prediction Problem with Applications in Communication Surveillance , 2009, INFORMS J. Comput..

[21]  Ben Taskar,et al.  Link Prediction in Relational Data , 2003, NIPS.