BIROn - Birkbeck Institutional Research Online

Composite recommendations: from items to packages

Xie, M. and Lakshmanan, L.V.S. and Wood, Peter T. (2012) Composite recommendations: from items to packages. Frontiers of Computer Science 6 (3), pp. 264-277. ISSN 2095-2228.

[img] Text (Rerereed)
ptw-fcs.pdf - Accepted Version
Restricted to Repository staff only

Download (378Kb)
Official URL: http://dx.doi.org/10.1007/s11704-012-2014-1

Abstract

Classical recommender systems provide users with a list of recommendations where each recommendation consists of a single item, e.g., a book or DVD. However, several applications can benefit from a system capable of recommending packages of items, in the formof sets. Sample applications include travel planning with a limited budget (price or time) and twitter users wanting to select worthwhile tweeters to follow, given that they can deal with only a bounded number of tweets. In these contexts, there is a need for a system that can recommend the top-k packages for the user to choose from. Motivated by these applications, we consider composite recommendations, where each recommendation comprises a set of items. Each item has both a value (rating) and a cost associated with it, and the user specifies a maximum total cost (budget) for any recommended set of items. Our composite recommender system has access to one or more component recommender systems focusing on different domains, as well as to information sources which can provide the cost associated with each item. Because the problem of deciding whether there is a recommendation (package) whose cost is under a given budget and whose value exceeds some threshold is NP-complete, we devise several approximation algorithms for generating the top-k packages as recommendations. We analyze the efficiency as well as approximation quality of these algorithms. Finally, using two real and two synthetic datasets, we subject our algorithms to thorough experimentation and empirical analysis. Our findings attest to the efficiency and quality of our approximation algorithms for the top-k packages compared to exact algorithms.

Item Type: Article
Keyword(s) / Subject(s): recommendation algorithms, optimization, top-k query processing
School or Research Centre: Birkbeck Schools and Research Centres > School of Business, Economics & Informatics > Computer Science and Information Systems
Depositing User: Dr Peter Wood
Date Deposited: 07 Dec 2012 14:16
Last Modified: 17 Apr 2013 12:33
URI: http://eprints.bbk.ac.uk/id/eprint/5799

Archive Staff Only (login required)

Edit/View Item Edit/View Item