What's New (April 1, 2022)
We have a new release Recommenders 1.1.0! We have introduced the SASRec and SSEPT algorithms that are based on transformers. In addition, we now have enabled Python 3.8 and 3.9. We have also made improvements on the SARPlus algorithm, including support for Azure Synapse and Spark 3.2. There are also bug fixes and improvements on NCF, RBM, LightGBM, LightFM, Scikit-Surprise, the stratified splitter, dockerfile and upgrade to Scikit-Learn 1.0.2.
Starting with release 0.6.0, Recommenders has been available on PyPI and can be installed using pip!
Here you can find the PyPi page: https://pypi.org/project/recommenders/
Here you can find the package documentation: https://microsoft-recommenders.readthedocs.io/en/latest/
This repository contains 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 recommenders 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 included for self-study and customization in your own applications. See the recommenders documentation.
For a more detailed overview of the repository, please see the documents on the wiki page.
The installation of the recommenders package has been tested with
To set up on your local machine:
To install core utilities, CPU-based algorithms, and dependencies:
Ensure software required for compilation and Python libraries is installed.
On Linux this can be supported by adding:
sudo apt-get install -y build-essential libpython<version>
<version>should be the Python version (e.g.
On Windows you will need Microsoft C++ Build Tools.
Create a conda or virtual environment. See the setup guide for more details.
Within the created environment, install the package from PyPI:
pip install --upgrade pip pip install --upgrade setuptools pip install recommenders[examples]
Register your (conda or virtual) environment with Jupyter:
python -m ipykernel install --user --name my_environment_name --display-name "Python (reco)"
Start the Jupyter notebook server
Run the SAR Python CPU MovieLens notebook under the
00_quick_startfolder. Make sure to change the kernel to "Python (reco)".
For additional options to install the package (support for GPU, Spark etc.) see this guide.
NOTE - The Alternating Least Squares (ALS) notebooks require a PySpark environment to run. Please follow the steps in the setup guide to run these notebooks in a PySpark environment. For the deep learning algorithms, it is recommended to use a GPU machine and to follow the steps in the setup guide to set up Nvidia libraries.
NOTE for DSVM Users - Please follow the steps in the Dependencies setup - Set PySpark environment variables on Linux or MacOS and Troubleshooting for the DSVM sections if you encounter any issue.
DOCKER - Another easy way to try the recommenders repository and get started quickly is to build docker images suitable for different environments.
The table below lists the recommender algorithms currently available in the repository. Notebooks are linked under the Example column as Quick start, showcasing an easy to run example of the algorithm, or as Deep dive, explaining in detail the math and implementation of the algorithm.
|Alternating Least Squares (ALS)||Collaborative Filtering||Matrix factorization algorithm for explicit or implicit feedback in large datasets, optimized for scalability and distributed computing capability. It works in the PySpark environment.||Quick start / Deep dive|
|Attentive Asynchronous Singular Value Decomposition (A2SVD)*||Collaborative Filtering||Sequential-based algorithm that aims to capture both long and short-term user preferences using attention mechanism. It works in the CPU/GPU environment.||Quick start|
|Cornac/Bayesian Personalized Ranking (BPR)||Collaborative Filtering||Matrix factorization algorithm for predicting item ranking with implicit feedback. It works in the CPU environment.||Deep dive|
|Cornac/Bilateral Variational Autoencoder (BiVAE)||Collaborative Filtering||Generative model for dyadic data (e.g., user-item interactions). It works in the CPU/GPU environment.||Deep dive|
|Convolutional Sequence Embedding Recommendation (Caser)||Collaborative Filtering||Algorithm based on convolutions that aim to capture both user’s general preferences and sequential patterns. It works in the CPU/GPU environment.||Quick start|
|Deep Knowledge-Aware Network (DKN)*||Content-Based Filtering||Deep learning algorithm incorporating a knowledge graph and article embeddings for providing news or article recommendations. It works in the CPU/GPU environment.||Quick start / Deep dive|
|Extreme Deep Factorization Machine (xDeepFM)*||Hybrid||Deep learning based algorithm for implicit and explicit feedback with user/item features. It works in the CPU/GPU environment.||Quick start|
|FastAI Embedding Dot Bias (FAST)||Collaborative Filtering||General purpose algorithm with embeddings and biases for users and items. It works in the CPU/GPU environment.||Quick start|
|LightFM/Hybrid Matrix Factorization||Hybrid||Hybrid matrix factorization algorithm for both implicit and explicit feedbacks. It works in the CPU environment.||Quick start|
|LightGBM/Gradient Boosting Tree*||Content-Based Filtering||Gradient Boosting Tree algorithm for fast training and low memory usage in content-based problems. It works in the CPU/GPU/PySpark environments.||Quick start in CPU / Deep dive in PySpark|
|LightGCN||Collaborative Filtering||Deep learning algorithm which simplifies the design of GCN for predicting implicit feedback. It works in the CPU/GPU environment.||Deep dive|
|GeoIMC*||Hybrid||Matrix completion algorithm that has into account user and item features using Riemannian conjugate gradients optimization and following a geometric approach. It works in the CPU environment.||Quick start|
|GRU4Rec||Collaborative Filtering||Sequential-based algorithm that aims to capture both long and short-term user preferences using recurrent neural networks. It works in the CPU/GPU environment.||Quick start|
|Multinomial VAE||Collaborative Filtering||Generative model for predicting user/item interactions. It works in the CPU/GPU environment.||Deep dive|
|Neural Recommendation with Long- and Short-term User Representations (LSTUR)*||Content-Based Filtering||Neural recommendation algorithm for recommending news articles with long- and short-term user interest modeling. It works in the CPU/GPU environment.||Quick start|
|Neural Recommendation with Attentive Multi-View Learning (NAML)*||Content-Based Filtering||Neural recommendation algorithm for recommending news articles with attentive multi-view learning. It works in the CPU/GPU environment.||Quick start|
|Neural Collaborative Filtering (NCF)||Collaborative Filtering||Deep learning algorithm with enhanced performance for user/item implicit feedback. It works in the CPU/GPU environment.||Quick start / Deep dive|
|Neural Recommendation with Personalized Attention (NPA)*||Content-Based Filtering||Neural recommendation algorithm for recommending news articles with personalized attention network. It works in the CPU/GPU environment.||Quick start|
|Neural Recommendation with Multi-Head Self-Attention (NRMS)*||Content-Based Filtering||Neural recommendation algorithm for recommending news articles with multi-head self-attention. It works in the CPU/GPU environment.||Quick start|
|Next Item Recommendation (NextItNet)||Collaborative Filtering||Algorithm based on dilated convolutions and residual network that aims to capture sequential patterns. It considers both user/item interactions and features. It works in the CPU/GPU environment.||Quick start|
|Restricted Boltzmann Machines (RBM)||Collaborative Filtering||Neural network based algorithm for learning the underlying probability distribution for explicit or implicit user/item feedback. It works in the CPU/GPU environment.||Quick start / Deep dive|
|Riemannian Low-rank Matrix Completion (RLRMC)*||Collaborative Filtering||Matrix factorization algorithm using Riemannian conjugate gradients optimization with small memory consumption to predict user/item interactions. It works in the CPU environment.||Quick start|
|Simple Algorithm for Recommendation (SAR)*||Collaborative Filtering||Similarity-based algorithm for implicit user/item feedback. It works in the CPU environment.||Quick start / Deep dive|
|Self-Attentive Sequential Recommendation (SASRec)||Collaborative Filtering||Transformer based algorithm for sequential recommendation. It works in the CPU/GPU environment.||Quick start|
|Short-term and Long-term Preference Integrated Recommender (SLi-Rec)*||Collaborative Filtering||Sequential-based algorithm that aims to capture both long and short-term user preferences using attention mechanism, a time-aware controller and a content-aware controller. It works in the CPU/GPU environment.||Quick start|
|Multi-Interest-Aware Sequential User Modeling (SUM)*||Collaborative Filtering||An enhanced memory network-based sequential user model which aims to capture users' multiple interests. It works in the CPU/GPU environment.||Quick start|
|Sequential Recommendation Via Personalized Transformer (SSEPT)||Collaborative Filtering||Transformer based algorithm for sequential recommendation with User embedding. It works in the CPU/GPU environment.||Quick start|
|Standard VAE||Collaborative Filtering||Generative Model for predicting user/item interactions. It works in the CPU/GPU environment.||Deep dive|
|Surprise/Singular Value Decomposition (SVD)||Collaborative Filtering||Matrix factorization algorithm for predicting explicit rating feedback in small datasets. It works in the CPU/GPU environment.||Deep dive|
|Term Frequency - Inverse Document Frequency (TF-IDF)||Content-Based Filtering||Simple similarity-based algorithm for content-based recommendations with text datasets. It works in the CPU environment.||Quick start|
|Vowpal Wabbit (VW)*||Content-Based Filtering||Fast online learning algorithms, great for scenarios where user features / context are constantly changing. It uses the CPU for online learning.||Deep dive|
|Wide and Deep||Hybrid||Deep learning algorithm that can memorize feature interactions and generalize user features. It works in the CPU/GPU environment.||Quick start|
|xLearn/Factorization Machine (FM) & Field-Aware FM (FFM)||Hybrid||Quick and memory efficient algorithm to predict labels with user/item features. It works in the CPU/GPU environment.||Deep dive|
NOTE: * indicates algorithms invented/contributed by Microsoft.
Independent or incubating algorithms and utilities are candidates for the contrib folder. This will house contributions which may not easily fit into the core repository or need time to refactor or mature the code and add necessary tests.
|SARplus *||Collaborative Filtering||Optimized implementation of SAR for Spark||Quick start|
We provide a benchmark notebook to illustrate how different algorithms could be evaluated and compared. In this notebook, the MovieLens dataset is split 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.
Code of Conduct
This project adheres to Microsoft's Open Source Code of Conduct in order to foster a welcoming and inspiring community for all.
This project welcomes contributions and suggestions. Before contributing, please see our contribution guidelines.
These tests are the nightly builds, which compute the smoke and integration tests.
main is our principal branch and
staging is our development branch. We use
pytest for testing python utilities in recommenders and
papermill for the notebooks. For more information about the testing pipelines, please see the test documentation.
DSVM Build Status
The following tests run on a Linux DSVM daily.
- Microsoft AI Github: Find other Best Practice projects, and Azure AI design patterns in our central repository.
- NLP best practices: Best practices and examples on NLP.
- Computer vision best practices: Best practices and examples on computer vision.
- Forecasting best practices: Best practices and examples on time series forecasting.
- A. Argyriou, M. González-Fierro, and L. Zhang, "Microsoft Recommenders: Best Practices for Production-Ready Recommendation Systems", WWW 2020: International World Wide Web Conference Taipei, 2020. Available online: https://dl.acm.org/doi/abs/10.1145/3366424.3382692
- L. Zhang, T. Wu, X. Xie, A. Argyriou, M. González-Fierro and J. Lian, "Building Production-Ready Recommendation System at Scale", ACM SIGKDD Conference on Knowledge Discovery and Data Mining 2019 (KDD 2019), 2019.
- S. Graham, J.K. Min, T. Wu, "Microsoft recommenders: tools to accelerate developing recommender systems", RecSys '19: Proceedings of the 13th ACM Conference on Recommender Systems, 2019. Available online: https://dl.acm.org/doi/10.1145/3298689.3346967