Displaying 1 to 20 from 25 results

Fast Python Collaborative Filtering for Implicit Datasets. Alternating Least Squares as described in the papers Collaborative Filtering for Implicit Feedback Datasets and Applications of the Conjugate Gradient Method for Implicit Feedback Collaborative Filtering.

collaborative-filtering machine-learning matrix-factorization recommender-systemSpotlight uses PyTorch to build both deep and shallow recommender models. By providing both a slew of building blocks for loss functions (various pointwise and pairwise ranking losses), representations (shallow factorization representations, deep sequence models), and utilities for fetching (or generating) recommendation datasets, it aims to be a tool for rapid exploration and prototyping of new recommender models. See the full documentation for details.

recommender-system deep-learning learning-to-rank machine-learning matrix-factorization pytorchLibRec (http://www.librec.net) is a Java library for recommender systems (Java version 1.7 or higher required). It implements a suit of state-of-the-art recommendation algorithms, aiming to resolve two classic recommendation tasks: rating prediction and item ranking. A movie recommender system is designed and available here.

recommender-systems recommendation-algorithms collaborative-filtering matrix-factorization tensor-factorization probabilistic-graphical-models recommender systems factorization matrix tensor collaborative filtering sparseLightFM is a Python implementation of a number of popular recommendation algorithms for both implicit and explicit feedback, including efficient implementation of BPR and WARP ranking losses. It's easy to use, fast (via multithreaded model estimation), and produces high quality results. It also makes it possible to incorporate both item and user metadata into the traditional matrix factorization algorithms. It represents each user and item as the sum of the latent representations of their features, thus allowing recommendations to generalise to new items (via item features) and to new users (via user features).

machine-learning recommender matrix-factorization learning-to-rank recommender-systemNeanderthal is a Clojure library for fast matrix and linear algebra computations based on the highly optimized native libraries of BLAS and LAPACK computation routines for both CPU and GPU.. Read the documentation at Neanderthal Web Site.

clojure-library matrix gpu gpu-computing gpgpu opencl cuda high-performance-computing vectorization api matrix-factorization matrix-multiplication matrix-functions matrix-calculationsThe library fastFM is an academic project. The time and resources spent developing fastFM are therefore justified by the number of citations of the software. If you publish scientific articles using fastFM, please cite the following article (bibtex entry citation.bib). This repository allows you to use Factorization Machines in Python (2.7 & 3.x) with the well known scikit-learn API. All performance critical code as been written in C and wrapped with Cython. fastFM provides stochastic gradient descent (SGD) and coordinate descent (CD) optimization routines as well as Markov Chain Monte Carlo (MCMC) for Bayesian inference. The solvers can be used for regression, classification and ranking problems. Detailed usage instructions can be found in the online documentation and on arXiv.

machine-learning recommender-system factorization-machines matrix-factorizationLow-Rank and Sparse tools for Background Modeling and Subtraction in Videos. The LRSLibrary provides a collection of low-rank and sparse decomposition algorithms in MATLAB. The library was designed for motion segmentation in videos, but it can be also used (or adapted) for other computer vision problems (for more information, please see this page). Currently the LRSLibrary offers more than 100 algorithms based on matrix and tensor methods. The LRSLibrary was tested successfully in several MATLAB versions (e.g. R2014, R2015, R2016, R2017, on both x86 and x64 versions). It requires minimum R2014b.

rpca matrix-factorization matrix-completion tensor-decomposition tensor matlab matrix subspace-tracking subspace-learningArmadillo: fast C++ library for linear algebra & scientific computing - http://arma.sourceforge.net

linear-algebra matrix matrix-functions linear-algebra-library statistics matlab blas lapack hpc scientific-computing mkl machine-learning armadillo openmp gaussian-mixture-models cpp11 vector sparse-matrix expression-template matrix-factorizationNimfa is a Python module that implements many algorithms for nonnegative matrix factorization. Nimfa is distributed under the BSD license. The project was started in 2011 by Marinka Zitnik as a Google Summer of Code project, and since then many volunteers have contributed. See AUTHORS file for a complete list of contributors.

matrix-factorization algorithm latent-features latent-variable-modelsscikit-fusion is a Python module for data fusion based on recent collective latent factor models. scikit-fusion is tested to work under Python 3.

matrix-factorization data-fusion latent-featuresThe API of this package has changed since version 0.4, due to the API change of LIBMF 2.01 and some other design improvement. recosystem is an R wrapper of the LIBMF library developed by Yu-Chin Juan, Wei-Sheng Chin, Yong Zhuang, Bo-Wen Yuan, Meng-Yuan Yang, and Chih-Jen Lin (http://www.csie.ntu.edu.tw/~cjlin/libmf/), an open source library for recommender system using parallel matrix factorization.

matrix-factorization recommender-systemM4RI is a library for fast arithmetic with dense matrices over F2. The name M4RI comes from the first implemented algorithm: The “Method of the Four Russians” inversion algorithm published by Gregory Bard. This algorithm in turn is named after the “Method of the Four Russians” multiplication algorithm which is probably better referred to as Kronrod's method. M4RI is available under the General Public License Version 2 or later (GPLv2+). and support for Linux, Solaris, and OS X (GCC).

linear-algebra matrix-multiplication matrix-factorizationA jupyter notbook that compares PMF and BPMF model can be found here. Old version code can be found in v0.0.1. It contains a Probabilistic Matrix Factorization model with theano implementation.

matrix-factorization recommendation-systemThis repository contains the source code to reproduce the experimental results as described in the paper "Factorization Meets the Item Embedding: Regularizing Matrix Factorization with Item Co-occurrence" (RecSys'16). Note: The code is mostly written for Python 2.7. For Python 3.x, it is still usable with minor modification. If you run into any problem with Python 3.x, feel free to contact me and I will try to get back to you with a helpful solution.

recommender-system matrix-factorization embeddingsThis repository contains the source code to reproduce all the experimental results as described in the paper "Modeling User Exposure in Recommendation" (WWW'16). Note: The code is mostly written for Python 2.7. For Python 3.x, it is still usable with minor modification. If you run into any problem with Python 3.x, feel free to contact me and I will try to get back to you with a helpful solution.

recommender-system matrix-factorization user-exposurersparse is an R package for statistical learning on sparse data. Notably it implements many algorithms sparse matrix factorizations with a focus on applications for recommender systems. All of the algorithms benefit from OpenMP and most of them use BLAS. Package scales nicely to datasets with millions of rows and millions of columns.

collaborative-filtering alternating-least-squares recommender-system r matrix-factorization matrix-completion singular-value-decomposition truncated-svd ftrl follow-the-regularized-leader factorization-machinesThe NMFLibrary is a pure-Matlab library of a collection of algorithms of non-negative matrix factorization (NMF).

nmf optimization-algorithms machine-learning-algorithms factorization matrix-factorization big-data data-analysis constrained-optimization gradient-descent matlab matlab-toolbox online-learning stochastic-optimizers stochastic-gradient-descent robust-optimization bigdata sparse-representations orthogonal nonnegative-matrix-factorization nonnegativity-constraintsOLSTEC is an online tensor subspace tracking algorithm based on the Canonical Polyadic decomposition (CP decomposition) (or PARAFAC or CANDECOMP decomposition) exploiting the recursive least squares (RLS). Run run_me_first for path configurations.

subspace-learning tensor-cp-decomposition tensor-decomposition matrix-factorization matrix-completion low-rank-factorization online-learning stochastic-gradient-descent gradient-descent-algorithm background-subtraction grasta grouse petrels cp-decomposition tensorIn the near future, we will redesign the framework making some solid APIs for fast development on different network embedding techniques. This shell script will help obtain the representations of the Youtube links in Youtube-links dataset.

network-embedding representation-learning matrix-factorization knowledge-graphFluRS is a Python library for online item recommendation. The name indicates Flu-* (Flux, Fluid, Fluent) Recommender Systems which incrementally adapt to dynamic user-item interactions in a streaming environment. Note that repository takuti/stream-recommender uses FluRS v0.0.1 to write research papers.

factorization-machines matrix-factorization recommender-system machine-learning data-science
We have large collection of open source products. Follow the tags from
Tag Cloud >>

Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
**Add Projects.**