Data Mining and Knowledge Discovery

, Volume 21, Issue 2, pp 327–343

Predicting labels for dyadic data

Open Access
Article

DOI: 10.1007/s10618-010-0189-3

Cite this article as:
Menon, A.K. & Elkan, C. Data Min Knowl Disc (2010) 21: 327. doi:10.1007/s10618-010-0189-3

Abstract

In dyadic prediction, the input consists of a pair of items (a dyad), and the goal is to predict the value of an observation related to the dyad. Special cases of dyadic prediction include collaborative filtering, where the goal is to predict ratings associated with (user, movie) pairs, and link prediction, where the goal is to predict the presence or absence of an edge between two nodes in a graph. In this paper, we study the problem of predicting labels associated with dyad members. Special cases of this problem include predicting characteristics of users in a collaborative filtering scenario, and predicting the label of a node in a graph, which is a task sometimes called within-network classification or relational learning. This paper shows how to extend a recent dyadic prediction method to predict labels for nodes and labels for edges simultaneously. The new method learns latent features within a log-linear model in a supervised way, to maximize predictive accuracy for both dyad observations and item labels. We compare the new approach to existing methods for within-network classification, both experimentally and analytically. The experiments show, surprisingly, that learning latent features in an unsupervised way is superior for some applications to learning them in a supervised way.

Keywords

Dyadic prediction Collaborative filtering Link prediction Social networks Within-network classification Relational learning 

Copyright information

© The Author(s) 2010

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringUniversity of CaliforniaSan DiegoUSA

Personalised recommendations