This repository provides examples and best practices for building recommendation systems, provided as Jupyter notebooks. The examples detail our learnings on five key tasks:
- Prepare Data: Preparing and loading data for each recommender algorithm
- Model: Building models using various classical and deep learning recommender algorithms such as Alternating Least Squares (ALS) or eXtreme Deep Factorization Machines (xDeepFM).
- Evaluate: Evaluating algorithms with offline metrics
- Model Select and Optimize: Tuning and optimizing hyperparameters for recommender models
- Operationalize: Operationalizing models in a production environment on Azure
Several utilities are provided in reco_utils to support common tasks such as loading datasets in the format expected by different algorithms, evaluating model outputs, and splitting training/test data. Implementations of several state-of-the-art algorithms are provided for self-study and customization in your own applications.
To setup on your local machine:
- Install Anaconda with Python >= 3.6. Miniconda is a quick way to get started.
- Clone the repository
git clone https://github.com/Microsoft/Recommenders
- Run the generate conda file script to create a conda environment:
(This is for a basic python environment, see SETUP.md for PySpark and GPU environment setup)
cd Recommenders python scripts/generate_conda_file.py conda env create -f reco_base.yaml
- Activate the conda environment and register it with Jupyter:
conda activate reco_base python -m ipykernel install --user --name reco_base --display-name "Python (reco)"
- Start the Jupyter notebook server
cd notebooks jupyter notebook
- Run the SAR Python CPU MovieLens notebook under the 00_quick_start folder. Make sure to change the kernel to "Python (reco)".
The table below lists recommender algorithms currently available in the repository. Notebooks are linked under the Environment column when different implementations are available.
|Alternating Least Squares (ALS)||PySpark||Collaborative Filtering||Matrix factorization algorithm for explicit or implicit feedback in large datasets, optimized by Spark MLLib for scalability and distributed computing capability|
|Deep Knowledge-Aware Network (DKN)*||Python CPU / Python GPU||Content-Based Filtering||Deep learning algorithm incorporating a knowledge graph and article embeddings to provide powerful news or article recommendations|
|Extreme Deep Factorization Machine (xDeepFM)*||Python CPU / Python GPU||Hybrid||Deep learning based algorithm for implicit and explicit feedback with user/item features|
|FastAI Embedding Dot Bias (FAST)||Python CPU / Python GPU||Collaborative Filtering||General purpose algorithm with embeddings and biases for users and items|
|LightGBM/Gradient Boosting Tree*||Python CPU / PySpark||Content-Based Filtering||Gradient Boosting Tree algorithm for fast training and low memory usage in content-based problems|
|Neural Collaborative Filtering (NCF)||Python CPU / Python GPU||Collaborative Filtering||Deep learning algorithm with enhanced performance for implicit feedback|
|Restricted Boltzmann Machines (RBM)||Python CPU / Python GPU||Collaborative Filtering||Neural network based algorithm for learning the underlying probability distribution for explicit or implicit feedback|
|Riemannian Low-rank Matrix Completion (RLRMC)*||Python CPU||Collaborative Filtering||Matrix factorization algorithm using Riemannian conjugate gradients optimization with small memory consumption.|
|Simple Algorithm for Recommendation (SAR)*||Python CPU||Collaborative Filtering||Similarity-based algorithm for implicit feedback dataset|
|Surprise/Singular Value Decomposition (SVD)||Python CPU||Collaborative Filtering||Matrix factorization algorithm for predicting explicit rating feedback in datasets that are not very large|
|Vowpal Wabbit Family (VW)*||Python CPU (online training)||Content-Based Filtering||Fast online learning algorithms, great for scenarios where user features / context are constantly changing|
|Wide and Deep||Python CPU / Python GPU||Hybrid||Deep learning algorithm that can memorize feature interactions and generalize user features|
NOTE: * indicates algorithms invented/contributed by Microsoft.
We provide a benchmark notebook to illustrate how different algorithms could be evaluated and compared. In this notebook, MovieLens dataset is splitted into training/test sets at a 75/25 ratio using a stratified split. A recommendation model is trained using each of the collaborative filtering algorithms below. We utilize empirical parameter values reported in literature here. For ranking metrics we use
k=10 (top 10 recommended items). We run the comparison on a Standard NC6s_v2 Azure DSVM (6 vCPUs, 112 GB memory and 1 P100 GPU). Spark ALS is run in local standalone mode. In this table we show the results on Movielens 100k, running the algorithms for 15 epochs.
This project welcomes contributions and suggestions. Before contributing, please see our contribution guidelines.
NOTE - these tests are the nightly builds, which compute the smoke and integration tests. Master is our main branch and staging is our development branch. We use
pytest for testing python utilities in reco_utils and
papermill for the notebooks. For more information about the testing pipelines, please see the test documentation.