Smooth neighborhood recommender systems

Ben Dai, Junhui Wang, Xiaotong Shen, Annie Qu

Research output: Contribution to journalArticle

Abstract

Recommender systems predict users' preferences over a large number of items by pooling similar information from other users and/or items in the presence of sparse observations. One major challenge is how to utilize user-item specific covariates and networks describing user-item interactions in a high-dimensional situation, for accurate personalized prediction. In this article, we propose a smooth neighborhood recommender in the framework of the latent factor models. A similarity kernel is utilized to borrow neighborhood information from continuous covariates over a user-item specific network, such as a user's social network, where the grouping information defined by discrete covariates is also integrated through the network. Consequently, user-item specific information is built into the recommender to battle the 'cold-start" issue in the absence of observations in collaborative and contentbased filtering. Moreover, we utilize a\divide-and-conquer" version of the alternating least squares algorithm to achieve scalable computation, and establish asymptotic results for the proposed method, demonstrating that it achieves superior prediction accuracy. Finally, we illustrate that the proposed method improves substantially over its competitors in simulated examples and real benchmark data{Last.fm music data.

Original languageEnglish (US)
JournalJournal of Machine Learning Research
Volume20
StatePublished - Feb 1 2019

Fingerprint

Recommender Systems
Recommender systems
Covariates
Alternating Least Squares
Pooling
Prediction
Divide and conquer
Factor Models
Least Square Algorithm
User Preferences
Music
Grouping
Social Networks
High-dimensional
Filtering
Benchmark
kernel
Predict
Interaction

Keywords

  • Blockwise coordinate decent
  • Cold-start
  • Kernel smoothing
  • Neighborhood
  • Personalized prediction
  • Singular value decomposition
  • Social networks

Cite this

Smooth neighborhood recommender systems. / Dai, Ben; Wang, Junhui; Shen, Xiaotong; Qu, Annie.

In: Journal of Machine Learning Research, Vol. 20, 01.02.2019.

Research output: Contribution to journalArticle

Dai, Ben ; Wang, Junhui ; Shen, Xiaotong ; Qu, Annie. / Smooth neighborhood recommender systems. In: Journal of Machine Learning Research. 2019 ; Vol. 20.
@article{e1324be0dfd94fb29991d913ee54915d,
title = "Smooth neighborhood recommender systems",
abstract = "Recommender systems predict users' preferences over a large number of items by pooling similar information from other users and/or items in the presence of sparse observations. One major challenge is how to utilize user-item specific covariates and networks describing user-item interactions in a high-dimensional situation, for accurate personalized prediction. In this article, we propose a smooth neighborhood recommender in the framework of the latent factor models. A similarity kernel is utilized to borrow neighborhood information from continuous covariates over a user-item specific network, such as a user's social network, where the grouping information defined by discrete covariates is also integrated through the network. Consequently, user-item specific information is built into the recommender to battle the 'cold-start{"} issue in the absence of observations in collaborative and contentbased filtering. Moreover, we utilize a\divide-and-conquer{"} version of the alternating least squares algorithm to achieve scalable computation, and establish asymptotic results for the proposed method, demonstrating that it achieves superior prediction accuracy. Finally, we illustrate that the proposed method improves substantially over its competitors in simulated examples and real benchmark data{Last.fm music data.",
keywords = "Blockwise coordinate decent, Cold-start, Kernel smoothing, Neighborhood, Personalized prediction, Singular value decomposition, Social networks",
author = "Ben Dai and Junhui Wang and Xiaotong Shen and Annie Qu",
year = "2019",
month = "2",
day = "1",
language = "English (US)",
volume = "20",
journal = "Journal of Machine Learning Research",
issn = "1532-4435",
publisher = "Microtome Publishing",

}

TY - JOUR

T1 - Smooth neighborhood recommender systems

AU - Dai, Ben

AU - Wang, Junhui

AU - Shen, Xiaotong

AU - Qu, Annie

PY - 2019/2/1

Y1 - 2019/2/1

N2 - Recommender systems predict users' preferences over a large number of items by pooling similar information from other users and/or items in the presence of sparse observations. One major challenge is how to utilize user-item specific covariates and networks describing user-item interactions in a high-dimensional situation, for accurate personalized prediction. In this article, we propose a smooth neighborhood recommender in the framework of the latent factor models. A similarity kernel is utilized to borrow neighborhood information from continuous covariates over a user-item specific network, such as a user's social network, where the grouping information defined by discrete covariates is also integrated through the network. Consequently, user-item specific information is built into the recommender to battle the 'cold-start" issue in the absence of observations in collaborative and contentbased filtering. Moreover, we utilize a\divide-and-conquer" version of the alternating least squares algorithm to achieve scalable computation, and establish asymptotic results for the proposed method, demonstrating that it achieves superior prediction accuracy. Finally, we illustrate that the proposed method improves substantially over its competitors in simulated examples and real benchmark data{Last.fm music data.

AB - Recommender systems predict users' preferences over a large number of items by pooling similar information from other users and/or items in the presence of sparse observations. One major challenge is how to utilize user-item specific covariates and networks describing user-item interactions in a high-dimensional situation, for accurate personalized prediction. In this article, we propose a smooth neighborhood recommender in the framework of the latent factor models. A similarity kernel is utilized to borrow neighborhood information from continuous covariates over a user-item specific network, such as a user's social network, where the grouping information defined by discrete covariates is also integrated through the network. Consequently, user-item specific information is built into the recommender to battle the 'cold-start" issue in the absence of observations in collaborative and contentbased filtering. Moreover, we utilize a\divide-and-conquer" version of the alternating least squares algorithm to achieve scalable computation, and establish asymptotic results for the proposed method, demonstrating that it achieves superior prediction accuracy. Finally, we illustrate that the proposed method improves substantially over its competitors in simulated examples and real benchmark data{Last.fm music data.

KW - Blockwise coordinate decent

KW - Cold-start

KW - Kernel smoothing

KW - Neighborhood

KW - Personalized prediction

KW - Singular value decomposition

KW - Social networks

UR - http://www.scopus.com/inward/record.url?scp=85072510651&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85072510651&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85072510651

VL - 20

JO - Journal of Machine Learning Research

JF - Journal of Machine Learning Research

SN - 1532-4435

ER -