Temporal link prediction using matrix and tensor factorizations

ACM Transactions on Knowledge Discovery from Data

Volumn 5, Issue 2, 2011, Pages

  Dunlavy, Daniel M ^a   Kolda, Tamara G ^b   Acar, Evrim ^c  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

^c SCIENTIFIC AND TECHNOLOGICAL RESEARCH COUNCIL OF TURKEY   (Turkey)

Author keywords

CANDECOMP; Evolution; Link mining; Link prediction; PARAFAC; Tensor factorization

Indexed keywords

CANDECOMP; EVOLUTION; LINK MINING; LINK PREDICTION; PARAFAC; TENSOR FACTORIZATION;

FACTORIZATION; GRAPH THEORY; PERIODIC STRUCTURES; SINGULAR VALUE DECOMPOSITION; TENSORS;

FORECASTING;

EID: 79952552980     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1921632.1921636     Document Type: Article

References (40)

1. ACAR, E. AND YENER, B. 2009. Unsupervised multiway data analysis: A literature survey. IEEE Trans. Knowl. DataEngin. 21, 1, 6-20.
2. ACAR, E., CAMTEPE, S.A., AND YENER, B. 2006. Collective sampling and analysis of high order tensors for chatroom communications. In Proceedings of the IEEE International Conference on Intelligence and Security Informatics (IST 06). Lecture Notes in Computer Science, vol. 3975. Springer, 213-224. (Pubitemid 44045570)
3. ACAR, E., DUNLAVY, D.M., AND KOLDA, T. G. 2009. Link prediction on evolving data using matrix and tensor factorizations. In Proceedings of the Workshop on Large-Scale Data Mining: Theory and Applications (LDMTA09). 262-269.
4. ACAR, E., DUNLAVY, D.M., AND KOLDA, T. G. 2010. A scalable optimization approach for fitting canonical tensor decompositions. J. Chemometrics. To appear.
5. BADER, B.W. AND KOLDA, T. G. 2007. Efficient MATLAB computations with sparse and factored tensors. SIAM J. Scient. Comput. 30, 1, 205-231.
6. BADER, B.W., BERRY, M.W., AND BROWNE, M. 2007. Discussion tracking in Enron email using PARAFAC. In Survey of Text Mining: Clustering, Classification, and Retrieval 2nd Ed., M. W. Berry and M. Castellanos Eds. Springer, 147-162.
7. BAST, H. AND MAJUMDAR, D. 2005. Why spectral retrieval works. In Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'0-5). 11-18.
8. BELL, R.M. AND KOREN, Y. 2007. Lessons from the Netflix Prize Challenge. ACM SIGKDD Explor. Newslett. 9, 75-79.
9. CARROLL, J.D. AND CHANG, J. J. 1970. Analysis of individual differences in multidimensional scaling via an N-way generalization of "Eckart- Young" decomposition. Psychometrika 35, 283-319.
10. CHATFIELD, C. AND YAR, M. 1988. Holt-winters forecasting: Some practical issues. J. Royal Statist. Soc. Series D (The Statistician) 37, 2, 129-140.
11. CLAUSET, A., MOORE, C., AND NEWMAN, M. 2008. Hierarchical structure and the prediction of missing links in networks. Nature 453.
12. DUMAIS, S.T., FURNAS, G.W., LANDAUER, T.K., DEERWESTER, S., AND HARSHMAN, R. 1988. Using latent semantic analysis to improve access to textual information. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI88). ACM Press, 281-285.
13. GARDNER, E. S. 2006. Exponential smoothing: The state of the art - part ii. Int. J. Forecast. 22, 637-666.
14. GETOOR, L. AND DIEHL, C. P. 2005. Link mining: A survey. ACM SIGKDD Explor. Newslett. 7, 2, 3-12.
15. HARSHMAN, R. A. 1970. Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-modal factor analysis. UCLA Working Papers in Phonetics 16, 1-84. http://www.psychology.uwo.ca/faculty/ harshman/wpppfac0.pdf.
16. HASAN, M.A., CHAOJI, V., SALEM, S., AND ZAKI, M. 2006. Link prediction using supervised learning. In Proceedings of the SIAM of the Data Mining Workshop on Link Analysis, Counterterrorism, and Security.
17. HUANG, Z.AND LIN, D. K. J. 2009. The time-series link prediction problem with applications in communication surveillance. INFORMS J. Comput. 21, 286-303.
18. HUANG, Z., LI, X., AND CHEN, H. 2005. Link prediction approach to collaborative filtering. In Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL05). 141-142. (Pubitemid 41543540)
19. KATZ, L. 1953. A new status index derived from sociometric analysis. Psychometrika 18, 1, 39-43.
20. KOLDA, T.G. AND BADER, B. W. 2009. Tensor decompositions and applications. SIAM Rev. 51, 3, 455-500.
21. KOLDA, T.G., BADER, B.W., AND KENNY, J. P. 2005. Higher-order web link analysis using multilinear algebra. In Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 05). IEEE Computer Society, 242-249. (Pubitemid 47385699)
22. KOREN, Y. 2009. Collaborative filtering with temporal dynamics. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'09). ACM, New York, NY, 447-456.
23. KOREN, Y., BELL, R., AND VOLINSKY, C. 2009. Matrix factorization techniques for recommender systems. IEEE Comput. 42, 30-37.
24. KRUSKAL, J. B. 1989. Rank, decomposition, and uniqueness for 3-way and N-way arrays. In Multiway Data Analysis. R. Coppi and S. Bolasco Eds. North-Holland, Amsterdam, 7-18.
25. LIBEN-NOWELL, D. AND KLEINBERG, J. 2007. The link-prediction problem for social networks. J. Amer. Soc. Inform. Sci. Techn. 58, 7, 1019-1031. (Pubitemid 46830394)
26. LIU, Y. AND KOU, Z. 2007. Predicting who rated what in large-scale datasets. ACMSIGKDD Explor. Newslett. 9, 62-65.
27. MAKRIDAKIS, S.AND HIBON, M. 2000. The m3 competition: Results, conclusions and implications. Int. J. Forecast. 16, 451-476.
28. RATTIGAN, M.J.AND JENSEN, D. 2005. The case for anomalous link discovery. ACMSIGKDD Explor. Newslett. 7, 2, 41-47.
29. SAAD, Y. 1992. Numerical Methods for Large Eigenvalue Problems. Manchester University Press.
30. SARKAR, P., SIDDIQI, S.M., AND GORDON, G. J. 2007. A latent space approach to dynamic embedding of co-occurrence data. In Proceedings of the 11th International Conference on Artificial Intelligence and Statistics (AI-STATS'07).
31. SHARAN, U. AND NEVILLE, J. 2008. Temporal-relational classifiers for prediction in evolving domains. In Proceedings of the 8th IEEE International Conference on Data Mining (ICDM08). IEEE Computer Society, 540-549.
32. SMOLA, A. AND KONDOR, R. 2003. Kernels and regularization on graphs. In Proceedings of the Annual Conference on Computational Learning Theory and Kernel Workshop.B.Schölkopf and M. Warmuth Eds., Lecture Notes in Computer Science. Springer.
33. STAGER, M., LUKOWICZ, P., AND TROSTER, G. 2006. Dealing with class skew in context recognition. In Proceedings of the 26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06). 58.
34. SUN, J., PAPADIMITRIOU, S., LIN, C.-Y., CAO, N., LIU, S., AND QIAN, W. 2009. Multivis: Content-based social network exploration through multi-way visual analysis. In Proceedings of the 9th SIAM International Conference on Data Mining(SDM 09). 1064-1075.
35. TONG, H., PAPADIMITRIOU, S., YU, P.S., AND FALOUTSOS, C. 2008. Proximity tracking on time-evolving bipartite graphs. In Proceedings of the 8th SIAM International Conference on Data Mining (SDM'08). 704-715.
36. TUCKER, L. R. 1963. Implications of factor analysis of three-way matrices for measurement of change. In Problems in Measuring Change. C. W. Harris Ed., University of Wisconsin Press, 122-137.
37. TUCKER, L. R. 1966. Some mathematical notes on three-mode factor analysis. Psychometrika 31, 279-311.
38. WANG, C., SATULURI, V., AND PARTHASARATHY, S. 2007. Local probabilistic models for link prediction. In Proceedings of the 7th IEEE Conference on Data Mining (ICDM'07). 322-331.
39. XIONG, L., CHEN, X., HUANG, T.-K., SCHNEIDER, J., AND CARBONELL, J. G. 2010. Temporal collaborative filtering with Bayesian probabilistic tensor factorization. In Proceedings of the SIAM International Conference on Data Mining.
40. YAN, H., GROSKY, W.I., AND FOTOUHI, F. 2008. Augmenting the power of LSI in text retrieval: Singular value rescaling. Data Knowl. Engin. 65, 108-125. (Pubitemid 351295934)