Effects of Extended Stochastic Gradient Descent Algorithms on Improving Latent Factor-Based Recommender Systems

Document Type

Article

Publication Date

4-1-2019

Abstract

High-dimensional and sparse (HiDS) matrices from recommender systems contain various useful patterns. A latent factor (LF) analysis is highly efficient in grasping these patterns. Stochastic gradient descent (SGD) is a widely adopted algorithm to train an LF model. Can its extensions be capable of further improving an LF models' convergence rate and prediction accuracy for missing data? To answer this question, this work selects two of representative extended SGD algorithms to propose two novel LF models. Experimental results from two HiDS matrices generated by real recommender systems show that compared standard SGD, extended SGD algorithms enable an LF model to achieve a higher prediction accuracy for missing data of an HiDS matrix, a faster convergence rate, and a larger model diversity.

Identifier

85063311107 (Scopus)

Publication Title

IEEE Robotics and Automation Letters

External Full Text Location

https://doi.org/10.1109/LRA.2019.2891986

e-ISSN

23773766

First Page

618

Last Page

624

Issue

2

Volume

4

This document is currently not available here.

Share

COinS