DocumentCode :
3126603
Title :
Cross-Temporal Link Prediction
Author :
Oyama, Satoshi ; Hayashi, Kohei ; Kashima, Hisashi
Author_Institution :
Grad. Sch. of Inf. Sci. & Technol., Hokkaido Univ., Sapporo, Japan
fYear :
2011
fDate :
11-14 Dec. 2011
Firstpage :
1188
Lastpage :
1193
Abstract :
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.
Keywords :
data mining; feature extraction; learning (artificial intelligence); matrix algebra; social networking (online); asynchronous communications; cross-temporal entity resolution; cross-temporal link prediction; data mining; dimension reduction approach; feature projection matrices; generalized eigenvalue problem; low-dimensional feature projections; low-dimensional latent feature space; machine learning; social networks; time-dependent feature projections; Accuracy; Databases; Eigenvalues and eigenfunctions; Optimization; Social network services; Training; Training data; dimension reduction; entity resolution; link prediction; social network analysis; temporal data;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Mining (ICDM), 2011 IEEE 11th International Conference on
Conference_Location :
Vancouver,BC
ISSN :
1550-4786
Print_ISBN :
978-1-4577-2075-8
Type :
conf
DOI :
10.1109/ICDM.2011.45
Filename :
6137336
Link To Document :
بازگشت