Adaptive Sampling and Learning in Recommendation Systems

abstract: This thesis studies recommendation systems and considers joint sampling and learning. Sampling in recommendation systems is to obtain users' ratings on specific items chosen by the recommendation platform, and learning is to infer the unknown ratings of users to items given the existi...

Full description

Bibliographic Details
Other Authors: Zhu, Lingfang (Author)
Format: Dissertation
Language:English
Published: 2015
Subjects:
Online Access:http://hdl.handle.net/2286/R.I.36430
id ndltd-asu.edu-item-36430
record_format oai_dc
spelling ndltd-asu.edu-item-364302018-06-22T03:06:50Z Adaptive Sampling and Learning in Recommendation Systems abstract: This thesis studies recommendation systems and considers joint sampling and learning. Sampling in recommendation systems is to obtain users' ratings on specific items chosen by the recommendation platform, and learning is to infer the unknown ratings of users to items given the existing data. In this thesis, the problem is formulated as an adaptive matrix completion problem in which sampling is to reveal the unknown entries of a $U\times M$ matrix where $U$ is the number of users, $M$ is the number of items, and each entry of the $U\times M$ matrix represents the rating of a user to an item. In the literature, this matrix completion problem has been studied under a static setting, i.e., recovering the matrix based on a set of partial ratings. This thesis considers both sampling and learning, and proposes an adaptive algorithm. The algorithm adapts its sampling and learning based on the existing data. The idea is to sample items that reveal more information based on the previous sampling results and then learn based on clustering. Performance of the proposed algorithm has been evaluated using simulations. Dissertation/Thesis Zhu, Lingfang (Author) Xue, Guoliang (Advisor) He, Jingrui (Committee member) Tong, Hanghang (Committee member) Arizona State University (Publisher) Computer science eng 32 pages Masters Thesis Computer Science 2015 Masters Thesis http://hdl.handle.net/2286/R.I.36430 http://rightsstatements.org/vocab/InC/1.0/ All Rights Reserved 2015
collection NDLTD
language English
format Dissertation
sources NDLTD
topic Computer science
spellingShingle Computer science
Adaptive Sampling and Learning in Recommendation Systems
description abstract: This thesis studies recommendation systems and considers joint sampling and learning. Sampling in recommendation systems is to obtain users' ratings on specific items chosen by the recommendation platform, and learning is to infer the unknown ratings of users to items given the existing data. In this thesis, the problem is formulated as an adaptive matrix completion problem in which sampling is to reveal the unknown entries of a $U\times M$ matrix where $U$ is the number of users, $M$ is the number of items, and each entry of the $U\times M$ matrix represents the rating of a user to an item. In the literature, this matrix completion problem has been studied under a static setting, i.e., recovering the matrix based on a set of partial ratings. This thesis considers both sampling and learning, and proposes an adaptive algorithm. The algorithm adapts its sampling and learning based on the existing data. The idea is to sample items that reveal more information based on the previous sampling results and then learn based on clustering. Performance of the proposed algorithm has been evaluated using simulations. === Dissertation/Thesis === Masters Thesis Computer Science 2015
author2 Zhu, Lingfang (Author)
author_facet Zhu, Lingfang (Author)
title Adaptive Sampling and Learning in Recommendation Systems
title_short Adaptive Sampling and Learning in Recommendation Systems
title_full Adaptive Sampling and Learning in Recommendation Systems
title_fullStr Adaptive Sampling and Learning in Recommendation Systems
title_full_unstemmed Adaptive Sampling and Learning in Recommendation Systems
title_sort adaptive sampling and learning in recommendation systems
publishDate 2015
url http://hdl.handle.net/2286/R.I.36430
_version_ 1718700964716740608