Budget-Constrained Item Cold-Start Handling in Collaborative Filtering Recommenders via Optimal Design

It is well known that collaborative filtering (CF) based recommender systems provide better modeling of users and items associated with considerable rating history. The lack of historical ratings results in the user and the item cold-start problems. The latter is the main focus of this work. Most of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Anava, Oren, Golan, Shahar, Golbandi, Nadav, Karnin, Zohar, Lempel, Ronny, Rokhlenko, Oleg, Somekh, Oren
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Anava, Oren
Golan, Shahar
Golbandi, Nadav
Karnin, Zohar
Lempel, Ronny
Rokhlenko, Oleg
Somekh, Oren
description It is well known that collaborative filtering (CF) based recommender systems provide better modeling of users and items associated with considerable rating history. The lack of historical ratings results in the user and the item cold-start problems. The latter is the main focus of this work. Most of the current literature addresses this problem by integrating content-based recommendation techniques to model the new item. However, in many cases such content is not available, and the question arises is whether this problem can be mitigated using CF techniques only. We formalize this problem as an optimization problem: given a new item, a pool of available users, and a budget constraint, select which users to assign with the task of rating the new item in order to minimize the prediction error of our model. We show that the objective function is monotone-supermodular, and propose efficient optimal design based algorithms that attain an approximation to its optimum. Our findings are verified by an empirical study using the Netflix dataset, where the proposed algorithms outperform several baselines for the problem at hand.
doi_str_mv 10.48550/arxiv.1406.2431
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1406_2431</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1406_2431</sourcerecordid><originalsourceid>FETCH-LOGICAL-a651-a518751814e87edb113964b61a3a77fd224e97a3a488406196953e1face197353</originalsourceid><addsrcrecordid>eNotj0FLxDAQhXPxIKt3T5I_0NppkqY9anXdhYWFde9lupmWQJouaSz6723Vw-Px3oNhPsYeIEtlqVT2hOHLzinIrEhzKeCWdS-fpqeY1KOfYkDryfB9pIHXozPJR8QQ-Q69cdb33Pq1dtiOAaOdiW-tixTW6USXcRjIGwoTny3y4zXaAR1_pcn2_o7ddOgmuv_3DTtv3871Ljkc3_f18yHBQkGCCkq9CCSVmkwLIKpCtgWgQK07k-eSKr0EWZYLAlRFpQRBhxeCSgslNuzx7-wvZ3MNywvhu1l5m5VX_AA-xFAs</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Budget-Constrained Item Cold-Start Handling in Collaborative Filtering Recommenders via Optimal Design</title><source>arXiv.org</source><creator>Anava, Oren ; Golan, Shahar ; Golbandi, Nadav ; Karnin, Zohar ; Lempel, Ronny ; Rokhlenko, Oleg ; Somekh, Oren</creator><creatorcontrib>Anava, Oren ; Golan, Shahar ; Golbandi, Nadav ; Karnin, Zohar ; Lempel, Ronny ; Rokhlenko, Oleg ; Somekh, Oren</creatorcontrib><description>It is well known that collaborative filtering (CF) based recommender systems provide better modeling of users and items associated with considerable rating history. The lack of historical ratings results in the user and the item cold-start problems. The latter is the main focus of this work. Most of the current literature addresses this problem by integrating content-based recommendation techniques to model the new item. However, in many cases such content is not available, and the question arises is whether this problem can be mitigated using CF techniques only. We formalize this problem as an optimization problem: given a new item, a pool of available users, and a budget constraint, select which users to assign with the task of rating the new item in order to minimize the prediction error of our model. We show that the objective function is monotone-supermodular, and propose efficient optimal design based algorithms that attain an approximation to its optimum. Our findings are verified by an empirical study using the Netflix dataset, where the proposed algorithms outperform several baselines for the problem at hand.</description><identifier>DOI: 10.48550/arxiv.1406.2431</identifier><language>eng</language><subject>Computer Science - Information Retrieval ; Computer Science - Learning</subject><creationdate>2014-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1406.2431$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1406.2431$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Anava, Oren</creatorcontrib><creatorcontrib>Golan, Shahar</creatorcontrib><creatorcontrib>Golbandi, Nadav</creatorcontrib><creatorcontrib>Karnin, Zohar</creatorcontrib><creatorcontrib>Lempel, Ronny</creatorcontrib><creatorcontrib>Rokhlenko, Oleg</creatorcontrib><creatorcontrib>Somekh, Oren</creatorcontrib><title>Budget-Constrained Item Cold-Start Handling in Collaborative Filtering Recommenders via Optimal Design</title><description>It is well known that collaborative filtering (CF) based recommender systems provide better modeling of users and items associated with considerable rating history. The lack of historical ratings results in the user and the item cold-start problems. The latter is the main focus of this work. Most of the current literature addresses this problem by integrating content-based recommendation techniques to model the new item. However, in many cases such content is not available, and the question arises is whether this problem can be mitigated using CF techniques only. We formalize this problem as an optimization problem: given a new item, a pool of available users, and a budget constraint, select which users to assign with the task of rating the new item in order to minimize the prediction error of our model. We show that the objective function is monotone-supermodular, and propose efficient optimal design based algorithms that attain an approximation to its optimum. Our findings are verified by an empirical study using the Netflix dataset, where the proposed algorithms outperform several baselines for the problem at hand.</description><subject>Computer Science - Information Retrieval</subject><subject>Computer Science - Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj0FLxDAQhXPxIKt3T5I_0NppkqY9anXdhYWFde9lupmWQJouaSz6723Vw-Px3oNhPsYeIEtlqVT2hOHLzinIrEhzKeCWdS-fpqeY1KOfYkDryfB9pIHXozPJR8QQ-Q69cdb33Pq1dtiOAaOdiW-tixTW6USXcRjIGwoTny3y4zXaAR1_pcn2_o7ddOgmuv_3DTtv3871Ljkc3_f18yHBQkGCCkq9CCSVmkwLIKpCtgWgQK07k-eSKr0EWZYLAlRFpQRBhxeCSgslNuzx7-wvZ3MNywvhu1l5m5VX_AA-xFAs</recordid><startdate>20140610</startdate><enddate>20140610</enddate><creator>Anava, Oren</creator><creator>Golan, Shahar</creator><creator>Golbandi, Nadav</creator><creator>Karnin, Zohar</creator><creator>Lempel, Ronny</creator><creator>Rokhlenko, Oleg</creator><creator>Somekh, Oren</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20140610</creationdate><title>Budget-Constrained Item Cold-Start Handling in Collaborative Filtering Recommenders via Optimal Design</title><author>Anava, Oren ; Golan, Shahar ; Golbandi, Nadav ; Karnin, Zohar ; Lempel, Ronny ; Rokhlenko, Oleg ; Somekh, Oren</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a651-a518751814e87edb113964b61a3a77fd224e97a3a488406196953e1face197353</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Computer Science - Information Retrieval</topic><topic>Computer Science - Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Anava, Oren</creatorcontrib><creatorcontrib>Golan, Shahar</creatorcontrib><creatorcontrib>Golbandi, Nadav</creatorcontrib><creatorcontrib>Karnin, Zohar</creatorcontrib><creatorcontrib>Lempel, Ronny</creatorcontrib><creatorcontrib>Rokhlenko, Oleg</creatorcontrib><creatorcontrib>Somekh, Oren</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Anava, Oren</au><au>Golan, Shahar</au><au>Golbandi, Nadav</au><au>Karnin, Zohar</au><au>Lempel, Ronny</au><au>Rokhlenko, Oleg</au><au>Somekh, Oren</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Budget-Constrained Item Cold-Start Handling in Collaborative Filtering Recommenders via Optimal Design</atitle><date>2014-06-10</date><risdate>2014</risdate><abstract>It is well known that collaborative filtering (CF) based recommender systems provide better modeling of users and items associated with considerable rating history. The lack of historical ratings results in the user and the item cold-start problems. The latter is the main focus of this work. Most of the current literature addresses this problem by integrating content-based recommendation techniques to model the new item. However, in many cases such content is not available, and the question arises is whether this problem can be mitigated using CF techniques only. We formalize this problem as an optimization problem: given a new item, a pool of available users, and a budget constraint, select which users to assign with the task of rating the new item in order to minimize the prediction error of our model. We show that the objective function is monotone-supermodular, and propose efficient optimal design based algorithms that attain an approximation to its optimum. Our findings are verified by an empirical study using the Netflix dataset, where the proposed algorithms outperform several baselines for the problem at hand.</abstract><doi>10.48550/arxiv.1406.2431</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1406.2431
ispartof
issn
language eng
recordid cdi_arxiv_primary_1406_2431
source arXiv.org
subjects Computer Science - Information Retrieval
Computer Science - Learning
title Budget-Constrained Item Cold-Start Handling in Collaborative Filtering Recommenders via Optimal Design
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T18%3A11%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Budget-Constrained%20Item%20Cold-Start%20Handling%20in%20Collaborative%20Filtering%20Recommenders%20via%20Optimal%20Design&rft.au=Anava,%20Oren&rft.date=2014-06-10&rft_id=info:doi/10.48550/arxiv.1406.2431&rft_dat=%3Carxiv_GOX%3E1406_2431%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true