Dyadic Prediction Using a Latent Feature Log-Linear Model

Computer Science – Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In dyadic prediction, labels must be predicted for pairs (dyads) whose members possess unique identifiers and, sometimes, additional features called side-information. Special cases of this problem include collaborative filtering and link prediction. We present the first model for dyadic prediction that satisfies several important desiderata: (i) labels may be ordinal or nominal, (ii) side-information can be easily exploited if present, (iii) with or without side-information, latent features are inferred for dyad members, (iv) it is resistant to sample-selection bias, (v) it can learn well-calibrated probabilities, and (vi) it can scale to very large datasets. To our knowledge, no existing method satisfies all the above criteria. In particular, many methods assume that the labels are ordinal and ignore side-information when it is present. Experimental results show that the new method is competitive with state-of-the-art methods for the special cases of collaborative filtering and link prediction, and that it makes accurate predictions on nominal data.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Dyadic Prediction Using a Latent Feature Log-Linear Model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dyadic Prediction Using a Latent Feature Log-Linear Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dyadic Prediction Using a Latent Feature Log-Linear Model will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-76560

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.