Abstract
Over the past decade, recommendation algorithms for ratings prediction and item ranking have steadily matured. However, these state-of-the-art algorithms are typically applied in relatively straightforward and static scenarios: given information about a user's past item preferences in isolation, can we predict whether they will like a new item or rank all unseen items based on predicted interest? In reality, recommendation is often a more complex problem: the evaluation of a list of recommended items never takes place in a vacuum, and it is often a single step in the user's more complex background task or need. The goal of the ComplexRec 2019 workshop is to ofer an interactive venue for discussing approaches to recommendation in complex scenarios that have no simple one-size-fts-all solution.
Original language | English |
---|---|
Title of host publication | RecSys 2019 - 13th ACM Conference on Recommender Systems |
Number of pages | 2 |
Publisher | Association for Computing Machinery |
Publication date | 10 Sept 2019 |
Pages | 550-551 |
ISBN (Electronic) | 9781450362436 |
DOIs | |
Publication status | Published - 10 Sept 2019 |
Externally published | Yes |
Event | 13th ACM Conference on Recommender Systems, RecSys 2019 - Copenhagen, Denmark Duration: 16 Sept 2019 → 20 Sept 2019 |
Conference
Conference | 13th ACM Conference on Recommender Systems, RecSys 2019 |
---|---|
Country/Territory | Denmark |
City | Copenhagen |
Period | 16/09/2019 → 20/09/2019 |
Keywords
- Recommendation Algorithms
- Ratings Prediction
- Item Ranking
- Complex Scenarios
- User Preferences