Using Temporal Data for Making Recommendations

01/10/2013
by   Andrew Zimdars, et al.
0

We treat collaborative filtering as a univariate time series estimation problem: given a user's previous votes, predict the next vote. We describe two families of methods for transforming data to encode time order in ways amenable to off-the-shelf classification and density estimation tools, and examine the results of using these approaches on several real-world data sets. The improvements in predictive accuracy we realize recommend the use of other predictive algorithms that exploit the temporal order of data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/05/2019

Predictive density estimation under the Wasserstein loss

We investigate predictive density estimation under the L^2 Wasserstein l...
research
11/08/2022

TimeKit: A Time-series Forecasting-based Upgrade Kit for Collaborative Filtering

Recommender systems are a long-standing research problem in data mining ...
research
03/30/2020

Empirical Comparison of Graph Embeddings for Trust-Based Collaborative Filtering

In this work, we study the utility of graph embeddings to generate laten...
research
03/28/2017

Discovering Explainable Latent Covariance Structure for Multiple Time Series

Analyzing time series data is important to predict future events and cha...
research
05/08/2018

Fused Density Estimation: Theory and Methods

In this paper we introduce a method for nonparametric density estimation...
research
08/20/2018

Neighborhood Troubles: On the Value of User Pre-Filtering To Speed Up and Enhance Recommendations

In this paper, we present work-in-progress on applying user pre-filterin...
research
12/27/2022

Fast and fully-automated histograms for large-scale data sets

G-Enum histograms are a new fast and fully automated method for irregula...

Please sign up or login with your details

Forgot password? Click here to reset