In general, recommender systems attempt to estimate user preference based on historical data. A context-aware recommender system attempts to generate better recommendations using contextual information. However, generating recommendations for specific contexts has been challenging because of the difficulties in using contextual information to enhance the capabilities of recommender systems.
Several methods have been used to incorporate contextual information into traditional recommendation algorithms. These methods focus on incorporating contextual information to improve general recommendations for users rather than identifying the different context applicable to the user and providing recommendations geared towards those specific contexts.
In this thesis, we explore different context-aware recommendation techniques and present our context-aware coupled matrix factorization methods that use matrix factorization for estimating user preference and features in a specific contextual condition.
We develop two methods: the first method attaches user preference across multiple contextual conditions, making the assumption that user preference remains the same, but the suitability of items differs across different contextual conditions; i.e., an item might not be suitable for certain conditions. The second method assumes that item suitability remains the same across different contextual conditions but user preference changes. We perform a number of experiments on the last.fm dataset to evaluate our methods. We also compared our work to other context-aware recommendation approaches. Our results show that grouping ratings by context and jointly factorizing with common factors improves prediction accuracy.
| Identifer | oai:union.ndltd.org:uottawa.ca/oai:ruor.uottawa.ca:10393/37012 |
| Date | January 2017 |
| Creators | Agagu, Tosin |
| Contributors | Tran, Thomas |
| Publisher | Université d'Ottawa / University of Ottawa |
| Source Sets | Université d’Ottawa |
| Language | English |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.0027 seconds