Post on 18-Jan-2018
description
User Modeling and Recommender Systems: recommendation
algorithmsAdolfo Ruiz Calleja
04/10/2014
Index
2
• Introduction• Non-personalized recommender algorithms• Content-based recommender algorithms• Collaborative recommendation algorithms
Index
3
• Introduction• Non-personalized recommender algorithms• Content-based recommender algorithms• Collaborative recommendation algorithms
Introduction: Added value of the Recommender Systems
4
• Provision of personalized recommendations
• Allows to persuade each customer with personalized information
• Serendipitous discovery
• Enables to deal with the long tail
Introduction: Recommender system schema
5
USER ITEM
Algorithm
rating
Set of user attributes
Set of user attributesSet of user
attributesSet of user attributesSet of user
attributesSet of user attributes
Set of user attributesSet of user
attributesSet of user attributesSet of item
attributes
Introduction: Predictions and recommendations
• Outputs of recommender systems
• Prediction ≈ how much a user would like an item– Numeric scored related to the predicted opinion of
the user about a specific item
• Recommendations ≈ suggestion of things you may like– It is typically a list of items– Internally has to make some predictions
Introduction: Proceed with caution
7
Index
8
• Introduction• Non-personalized recommender algorithms– Simple mean– Probabilistic method
• Content-based recommender algorithms• Collaborative recommendation algorithms
9
USER ITEM
Algorithm
rating
Set of user attributes
Set of user attributesSet of user
attributesSet of user attributesSet of user
attributesSet of user attributes
Set of user attributesSet of user
attributesSet of user attributesSet of item
attributes
Not personalized recommender algorithms
Not personalized recommender algorithms
10
• Based on External Community Data• Can know ephemeral information from the user
• Example: Tripadvisor or Booking
11
Simple mean
12
Probability method
Not personalized recommender algorithms
13
• Very simple algorithms• They forget about the long tail
• When there are lot of raters predictions tend to median score– Self-selection bias– Diversity of raters
• Pretty bad accuracy
Index
14
• Introduction• Non-personalized recommender algorithms• Content-based recommender algorithms– Explicit decision model– The vector space model
• Collaborative recommendation algorithms
Content-based recommendation
15
USER ITEM
Algorithm
rating
Set of user attributes
Set of user attributesSet of user
attributesSet of user attributesSet of user
attributesSet of user attributes
Set of user attributesSet of user
attributesSet of user attributesSet of item
attributes
Content-based recommendation
16
• User model is built analyzing user preferences and item attributes
• Hard to found massively used examples– Personalized news feeds
Explicit decision model
17
Explicit decision model
18
• Very well known method in many domains
• The decision tree can be automatically built– No need to formalize domain knowledge
• Can be used with small numbers of features– But recommender systems typically need very many
• They are almost never used
The vector space model
19
The vector space model
20
• Which factors to consider in the item description?
• Possibility to use keyword vector– It can be automatically extracted from text
• But not only for textual items!!– We can aggregate keywords
• But how?
• How to normalize the vector space?– Hard if it is not automatically done– Term Frequency-Inverse Document Frequency
• Do we trust on it?
The vector space model
21
• How to build the user profile?
• If I like it, it is important for me– Sometimes something I do not like may be relevant or
viceversa
• Problem of how to update user profiles– Are new items more important than previous ones?• Short term vs. Long term
The vector space model
22
• We do not need lot of users• Easy to compute and simple to implement• Flexible– Easy to integrate with other approaches– Quickly adapt to changes
• :S Hard to find out the factors and their weights• Cannot deal with subjective aspects of the items• Competitor items are frequently retrieved• Too simplified model– Results are not accurate as with other approaches
Index
23
• Introduction• Non-personalized recommender algorithms• Content-based recommender algorithms• Collaborative recommendation algorithms– User-based nearest neighbor recommendation– Item-based nearest neighbor recommendation
Collaborative recommendation algorithms
24
USER ITEM
Algorithm
rating
Set of user attributes
Set of user attributesSet of user
attributesSet of user attributesSet of user
attributesSet of user attributes
Set of user attributesSet of user
attributesSet of user attributesSet of item
attributes
Collaborative recommendation algorithms
25
• Item model is a set of ratings• User model is a set of ratings
• Predominant paradigm
User-based nearest neighbor recommendation
26
27
• Pearson correlation coefficient• There are other algorithms– But commonly provide less accurate results– Cosine correlation is becoming on fashion
• Pearson correlation has some deficiencies– What if two users have few items in common?– What if the ratings are unary data?– What if something is loved or hated by the whole
community?
User-based nearest neighbor recommendation
28
• Processing time = O(N^2*M)– But not in real life
• Neighborhood selection– 20 to 50 neighbors (sometimes up to 100)– Define number of neighbors or a threshold– Better processing time O(N*M)– Less noise– Reduce coverage
User-based nearest neighbor recommendation
29
• Precomputed neighborhood– Better response time– Need to be frequently update (it is not a good idea to
define clusters)
User-based nearest neighbor recommendation
30
• Very popular• Based on subjective information• Very many variants and possible configurations
• What do we do with new items?• What do we do with new users?• Need of (similar) users• Data sparcity is a problem
User-based nearest neighbor recommendation
Item-based nearest neighbor recommendation
31
32
• Pearson correlation coefficient or cosine similarity– But now the neighborhood is formed by items!!
• A model should be built– Processing time = O (I^2)– It is always precomputed– Do not need to save all the model• Memory used vs. accuracy and coverage
– Items are much more stable that users• But they still need to be updated
Item-based nearest neighbor recommendation
33
• Efficient algorithm• Scales very well• Data sparcity is not a big problem• Creates nice recommendation lists
• We still need to deal with the cold-start• Memory use
Item-based nearest neighbor recommendation
User Modeling and Recommender Systems: recommendation
algorithmsAdolfo Ruiz Calleja
04/10/2014