The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Temporal Link Prediction Using Matrix and Tensor Factorizations
Open accessAbstract
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 article, we consider the problem of temporal link prediction: Given link data for times 1 through T , can we predict the links at time T + 1? If our data has underlying periodic structure, can we predict out even further in time, i.e., links at time T + 2, T + 3, etc.? In this article, we consider bipartite graphs that evolve over time and consider matrix- and tensor-based methods for predicting future links. We present a weight-based method for collapsing multiyear 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. Additionally, we show that tensor-based techniques are particularly effective for temporal data with varying periodic patterns.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Self-citationCarroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
A New Status Index Derived from Sociometric Analysis
Katz, L. (1953) · Psychometrika · doi:10.1007/bf02289026 · Cited by 3,866
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
Hierarchical structure and the prediction of missing links in networks
Clauset, A., Moore, C., & Newman, M. E. J. (2008) · Nature · doi:10.1038/nature06830 · Cited by 2,171 · cited 2×
“The temporal link prediction problem is different from missing link prediction, which has no temporal aspect and where the goal is to predict missing connections in order to describe a more complete picture of the overall link structure in the data [Clauset et al. 2008].”
BackgroundThe M3-Competition: results, conclusions and implications
Makridakis, S., & Hibon, M. (2000) · International Journal of Forecasting · doi:10.1016/s0169-2070(00)00057-1 · Cited by 1,695
Collaborative filtering with temporal dynamics
Koren, Y. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557072 · Cited by 1,203
Getoor, L., & Diehl, C. P. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117456 · Cited by 973
Exponential smoothing: The state of the art—Part II
Gardner, E. S. (2006) · International Journal of Forecasting · doi:10.1016/j.ijforecast.2006.03.005 · Cited by 948
Kernels and Regularization on Graphs
Smola, A. J., & Kondor, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_12 · Cited by 841
Lessons from the Netflix prize challenge
Bell, R. M., & Koren, Y. (2007) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1345448.1345465 · Cited by 727
Using latent semantic analysis to improve access to textual information
Dumais, S. T., Furnas, G. W., Landauer, T. K., Deerwester, S., & Harshman, R. (1988) · Proceedings of the SIGCHI conference on Human factors in computing systems - CHI '88 · doi:10.1145/57167.57214 · Cited by 616
Unsupervised Multiway Data Analysis: A Literature Survey
Acar, E., & Yener, B. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.112 · Cited by 434
Self-citationHolt-Winters Forecasting: Some Practical Issues
Chatfield, C., & Yar, M. (1988) · The Statistician · doi:10.2307/2348687 · Cited by 330
Local Probabilistic Models for Link Prediction
Wang, C., Satuluri, V., & Parthasarathy, S. (2007) · Seventh IEEE International Conference on Data Mining (ICDM 2007) · doi:10.1109/icdm.2007.108 · Cited by 314
Rank, decomposition, and uniqueness for 3-way and n -way arrays
Kruskal, J. B. (1989) · Medical Entomology and Zoology · Cited by 253
Higher-Order Web Link Analysis Using Multilinear Algebra
Kolda, T. G., Bader, B. W., & Kenny, J. P. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.77 · Cited by 252
Self-citationThe Time-Series Link Prediction Problem with Applications in Communication Surveillance
Huang, Z., & Lin, D. K. J. (2009) · INFORMS Journal on Computing · doi:10.1287/ijoc.1080.0292 · Cited by 220
Link Prediction on Evolving Data Using Matrix and Tensor Factorizations
Acar, E., Dunlavy, D., & Kolda, T. G. (2009) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2009.54 · Cited by 184
Self-citationThe case for anomalous link discovery
Rattigan, M. J., & Jensen, D. D. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117460 · Cited by 128
Temporal-Relational Classifiers for Prediction in Evolving Domains
Sharan, U., & Neville, J. (2008) · Proceedings · doi:10.1109/icdm.2008.125 · Cited by 115
Collective Sampling and Analysis of High Order Tensors for Chatroom Communications
Acar, E., Camtepe, S. A., & Yener, B. (2006) · Lecture notes in computer science · doi:10.1007/11760146_19 · Cited by 75
Self-citationDealing with Class Skew in Context Recognition
Stäger, M., Lukowicz, P., & Tröster, G. (2006) · IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW) · doi:10.1109/icdcsw.2006.36 · Cited by 23
Cited by
Chen, M., Mao, S., & Liu, Y. (2014) · Mobile Networks and Applications · doi:10.1007/s11036-013-0489-0 · Cited by 2,913
Toward Scalable Systems for Big Data Analytics: A Technology Tutorial
Hu, H., Wen, Y., Chua, T.-S., & Li, X. (2014) · IEEE Access · doi:10.1109/access.2014.2332453 · Cited by 1,099
Modern temporal network theory: a colloquium
Holme, P. (2015) · The European Physical Journal B · doi:10.1140/epjb/e2015-60657-4 · Cited by 734
Link prediction in social networks: the state-of-the-art
Wang, P., Xu, B., Wu, Y., & Zhou, X. (2015) · Science China Information Sciences · doi:10.1007/s11432-014-5237-y · Cited by 548
Paranjape, A., Benson, A. R., & Leskovec, J. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018731 · Cited by 540
Metadata
- Authors
- Dunlavy, D. M., Kolda, T. G., & Acar, E.
- Venue
- ACM Transactions on Knowledge Discovery from Data
- Published
- 2011-02
- Volume
- 5
- Issue
- 2
- Pages
- 1-27
- ISSN
- 1556-4681 (ISSN-L)
- 1556-472X
- OpenAlex
- W1864134408
- Cited by
- 375
- References
- 24
- FWCI
- 7.02
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.