Ever wondered why some movie recommendations just don't hit the mark?
Ever wondered why some movie recommendations just don't hit the mark?
Imagine you're planning a movie night with friends, but the streaming service keeps suggesting films you've already watched or don't like.
Collaborative filtering tries to guess your next favorite movie by looking at what similar friends liked, but if you don't have many ratings, it's like guessing without enough clues.
Example
You liked 'Inception' and 'Interstellar', but the service only knows your preferences for 'Inception' because you rated it highly, and it suggests 'Interstellar' again, even though you haven't rated it yet.
Remember this
Data sparsity in collaborative filtering can lead to inaccurate recommendations because there's not enough information to make a good guess.
Text adapted from Wikipedia, licensed under CC BY-SA 4.0.
the curse of dimensionality makes nearest neighbor search unreliable
Why can't we find our friends easily as we move to a city with more and more neighborhoods?
Matrix (mathematics)
Ever wondered how computers can predict your favorite songs?
NDCG measures: ranking quality with graded relevance scores
Ever wonder why some search results feel more helpful than others?
K-means clustering
Ever wondered how your favorite streaming service recommends shows?
score matching does: learns the gradient of the log-density without normalizing
Ever wonder how we can compare apples and oranges fairly in studies?
Overfitting
Why does fitting too much detail to data ruin predictions?
Swipe through more Machine Learning concepts
Open Pocket Polymath