Temporal Link Prediction Using Matrix and Tensor Factorizations
ACM Transactions on Knowledge Discovery from Data (TKDD)
Bridging link and query intent to enhance web search
Proceedings of the 22nd ACM conference on Hypertext and hypermedia
Temporal link prediction by integrating content and structure information
Proceedings of the 20th ACM international conference on Information and knowledge management
Pattern recognition in multivariate time series: dissertation proposal
Proceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management
Link prediction on evolving data using tensor factorization
PAKDD'11 Proceedings of the 15th international conference on New Frontiers in Applied Data Mining
Supervised rank aggregation approach for link prediction in complex networks
Proceedings of the 21st international conference companion on World Wide Web
Reciprocal and heterogeneous link prediction in social networks
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Group and link analysis of multi-relational scientific social networks
Journal of Systems and Software
ASCOS: an asymmetric network structure COntext similarity measure
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Data Mining and Knowledge Discovery
Discovering descriptive rules in relational dynamic graphs
Intelligent Data Analysis - Dynamic Networks and Knowledge Discovery
| Hi-index | 0.00 |
The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In this paper, we consider the problem of temporal link prediction: Given link data for time periods 1 through T, can we predict the links in time period T +1? Specifically, we look at bipartite graphs changing over time and consider matrix- and tensor-based methods for predicting links. We present a weight-based method for collapsing multi-year data into a single matrix. We show how the well-known Katz method for link prediction can be extended to bipartite graphs and, moreover, approximated in a scalable way using a truncated singular value decomposition. Using a CANDECOMP/PARAFAC tensor decomposition of the data, we illustrate the usefulness of exploiting the natural three-dimensional structure of temporal link data. Through several numerical experiments, we demonstrate that both matrix and tensor-based techniques are effective for temporal link prediction despite the inherent difficulty of the problem.