Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Cumulated gain-based evaluation of IR techniques
ACM Transactions on Information Systems (TOIS)
User Modeling for Adaptive News Access
User Modeling and User-Adapted Interaction
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Improving recommendation lists through topic diversification
WWW '05 Proceedings of the 14th international conference on World Wide Web
IEEE Transactions on Knowledge and Data Engineering
Being accurate is not enough: how accuracy metrics have hurt recommender systems
CHI '06 Extended Abstracts on Human Factors in Computing Systems
k-means++: the advantages of careful seeding
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Evaluating, combining and generalizing recommendations with prerequisites
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
What is a "Musical World"? An affinity propagation approach
MIRUM '11 Proceedings of the 1st international ACM workshop on Music information retrieval with user-centered and multimodal strategies
A modified random walk framework for handling negative ratings and generating explanations
ACM Transactions on Intelligent Systems and Technology (TIST) - Special section on twitter and microblogging services, social recommender systems, and CAMRa2010: Movie recommendation in context
Burst the filter bubble: using semantic web to enable serendipity
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part II
Proceedings of the 7th ACM international conference on Web search and data mining
Hi-index | 0.00 |
We examine the case of over-specialization in recommender systems, which results from returning items that are too similar to those previously rated by the user. We propose Outside-The-Box (otb) recommendation, which takes some risk to help users make fresh discoveries, while maintaining high relevance. The proposed formalization relies on item regions and attempts to identify regions that are under-exposed to the user. We develop a recommendation algorithm which achieves a compromise between relevance and risk to find otb items. We evaluate this approach on the MovieLens data set and compare our otb recommendations against conventional recommendation strategies.