Social Network Analysis and Mining

, Volume 2, Issue 4, pp 373–385

Context-aware tensor decomposition for relation prediction in social networks

  • Achim Rettinger
  • Hendrik Wermser
  • Yi Huang
  • Volker Tresp
Original Article

DOI: 10.1007/s13278-012-0069-5

Cite this article as:
Rettinger, A., Wermser, H., Huang, Y. et al. Soc. Netw. Anal. Min. (2012) 2: 373. doi:10.1007/s13278-012-0069-5

Abstract

An important task in network modeling is the prediction of relationships between classes of objects, such as friendship between persons, preferences of users for items, or the influence of genes on diseases. Factorizing approaches have proven effective in the modeling of these types of relations. If only a single binary relation is of interest, matrix factorization is typically applied. For ternary relations, tensor factorization has become popular. A typical application of tensor factorization concerns the temporal development of the relationships between objects. There are applications, where models with n-ary relations with n > 3 need to be considered, which is the topic of this paper. These models permit the inclusion of context information that is relevant for relation prediction. Unfortunately, the straightforward application of higher-order tensor models becomes problematic, due to the sparsity of the data and due to the complexity of the computations. In this paper, we discuss two different approaches that both simplify the higher-order tensors using coupled low-order factorization models. While the first approach, the context-aware recommendation tensor decomposition (CARTD), proposes an efficient optimization criterion and decomposition method, the second approach, the context-aware regularized singular value decomposition (CRSVD), introduces a generative probabilistic model and aims at reducing the dimensionality using independence assumptions in graphical models. In this article, we discuss both approaches and compare their ability to model contextual information. We test both models on a social network setting, where the task is to predict preferences based on existing preference patterns, based on the last item selected and based on attributes describing items and users. The experiments are performed using data from the GetGlue social network and the approach is evaluated on the ranking quality of predicted relations. The results indicate that the CARTD is superior in predicting overall rankings for relations, whereas the CRSVD is superior when one is only interested in predicting the top-ranked relations.

Keywords

Relation prediction Tensor matrix decomposition Graphical model Recommendation Social media analysis 

Copyright information

© Springer-Verlag 2012

Authors and Affiliations

  • Achim Rettinger
    • 1
  • Hendrik Wermser
    • 2
  • Yi Huang
    • 3
  • Volker Tresp
    • 3
  1. 1.Karlsruhe Institute of TechnologyKarlsruheGermany
  2. 2.Technische Universität MünchenMunichGermany
  3. 3.Siemens AG, Corporate TechnologyMunichGermany

Personalised recommendations