Open-source alternatives to GRU4Rec

A framework for large scale recommendation algorithms.

This is a PyTorch recommendation framework and deep learning recommendation model designed to generate personalized content predictions. It functions as a distributed embedding trainer that processes dense and sparse features through a neural network architecture to predict user preferences. The project implements a CUDA-optimized machine learning system using specialized GPU kernels to accelerate embedding lookup and aggregation. It employs a distributed approach to shard massive sparse feature tables across multiple GPUs, enabling the training of large-scale models. The system utilizes a t

Gorse is a personalized recommendation engine server and machine learning pipeline designed to suggest items to users based on their behavior and preferences. It operates as a distributed system that separates training, candidate generation, and serving nodes to support high-throughput workloads. The system utilizes a multi-stage recommendation pipeline to refine results through retrieval, scoring, and reranking. It generates personalized suggestions using collaborative filtering, matrix factorization, and item-to-item similarity models, while also providing non-personalized and fallback reco

A TensorFlow recommendation algorithm and framework in Python.

Pytorch domain library for recommendation systems

Recommenders is a recommendation system framework designed for building, benchmarking, and deploying collaborative and content-based filtering models. It provides a machine learning model pipeline that standardizes the process of moving recommendation data from raw ingestion through training and evaluation. The project functions as a model benchmarking toolkit, utilizing standardized ranking and error metrics to compare the accuracy of different algorithms. It also serves as a hyperparameter tuning tool, allowing for the optimization of model behavior and performance via external configuratio

Crab is a flexible, fast recommender engine for Python that integrates classic information filtering recommendation algorithms in the world of scientific Python packages (numpy, scipy, matplotlib).

Surprise is a Python library for building and analyzing recommendation systems. It provides a comprehensive toolkit for implementing collaborative filtering to predict user preferences and generate item suggestions based on historical rating patterns. The library includes dedicated tools for hyperparameter optimization and model evaluation. It allows for searching through parameter sets to find the most effective configurations and utilizes a suite of metrics to measure prediction accuracy. The framework covers the full development workflow, including data loading from various sources, the c

NVIDIA Merlin is an open source library providing end-to-end GPU-accelerated recommender systems, from feature engineering and preprocessing to training deep learning models and running inference in production.

Oryx 2: Lambda architecture on Apache Spark, Apache Kafka for real-time large scale machine learning

A Comparative Framework for Multimodal Recommender Systems

This project is a recommendation system framework designed for building, evaluating, and operationalizing personalized item suggestion engines. It provides a comprehensive toolkit for implementing collaborative filtering and content-based algorithms, supported by an end-to-end machine learning pipeline for preparing datasets and deploying predictive models. The framework distinguishes itself through the integration of knowledge graphs to provide richer context for recommendations and the use of industry-specific patterns to accelerate system deployment. It also includes a specialized model ev

Annoy is a C++ library designed for approximate nearest neighbor search in high-dimensional vector spaces. It functions as a vector similarity search engine that constructs static, disk-based data structures to facilitate fast lookups. By mapping identifiers to vector data and persisting these structures to disk, the library enables efficient, memory-mapped access to large datasets. The project distinguishes itself through the use of random projection trees and distance-metric-based partitioning, which organize data into hierarchical binary trees to balance search precision against computatio

Learning to Rank in TensorFlow