390 likes | 408 Views
Recommender Systems. Jia-Bin Huang Virginia Tech. ECE-5424G / CS-5824. Spring 2019. Administrative. HW 4 due April 10. Unsupervised Learning. Clustering, K-Mean Expectation maximization Dimensionality reduction Anomaly detection Recommendation system.
E N D
Recommender Systems Jia-Bin Huang Virginia Tech ECE-5424G / CS-5824 Spring 2019
Administrative • HW 4 due April 10
Unsupervised Learning • Clustering, K-Mean • Expectation maximization • Dimensionality reduction • Anomaly detection • Recommendation system
Motivating example: Monitoring machines in a data center (Memory use) (CPU load) (Memory use) (CPU load)
Multivariate Gaussian (normal) distribution • . Don’t model separately • Model all in one go. • Parameters: (covariance matrix)
Anomaly detection using the multivariate Gaussian distribution • Fit model by setting 2 Give a new example , compute Flag an anomaly if
Original model Automatically captures correlations between features Computationally more expensive Must have or else is non-invertible Original model Manually create features to capture anomalies where take unusual combinations of values Computationally cheaper (alternatively, scales better) OK even if training set size is small
Recommender Systems • Motivation • Problem formulation • Content-based recommendations • Collaborative filtering • Mean normalization
Recommender Systems • Motivation • Problem formulation • Content-based recommendations • Collaborative filtering • Mean normalization
Recommender Systems • Motivation • Problem formulation • Content-based recommendations • Collaborative filtering • Mean normalization
Example: Predicting movie ratings • User rates movies using zero to five stars • no. users • no. movies • if user has rated movie • rating given by user to movie
Recommender Systems • Motivation • Problem formulation • Content-based recommendations • Collaborative filtering • Mean normalization
Content-based recommender systems For each user , learn a parameter . Predict user as rating movie with stars.
Content-based recommender systems For each user , learn a parameter . Predict user as rating movie with stars.
Problem formulation • if user has rated movie • rating given by user to movie • parameter vector for user • feature vector for user • For each user predicted rating: • no. of movies rated by user j Goal: learn :
Optimization objective • Learn (parameter for user ): Learn
Optimization algorithm Gradient descent update: (for ) (for )
Recommender Systems • Motivation • Problem formulation • Content-based recommendations • Collaborative filtering • Mean normalization
Optimization algorithm • Given , to learn : • Given , to learn :
Collaborative filtering • Given (and movie ratings), Can estimate • Given Can estimate
Collaborative filtering optimization objective • Given , estimate • Given , estimate
Collaborative filtering optimization objective • Given , estimate • Given , estimate • Minimize and simultaneously
Collaborative filtering algorithm • Initialize to small random values • Minimize using gradient descent (or an advanced optimization algorithm). For every • For a user with parameter and movie with (learned) feature , predict a star rating of
Collaborative filtering • Predicted ratings: Low-rank matrix factorization
Finding related movies/products • For each product , we learn a feature vector : romance, : action, : comedy, … • How to find movie relate to movie ? Small movie j and I are “similar”
Recommender Systems • Motivation • Problem formulation • Content-based recommendations • Collaborative filtering • Mean normalization
Mean normalization For user , on movie predict: User 5 (Eve): Learn
Recommender Systems • Motivation • Problem formulation • Content-based recommendations • Collaborative filtering • Mean normalization