fastFM: a library for factorization machines

MaRDI QIDQ2834525zbMATH OpenFDO

Authors Immanuel Bayer

Publication date 22 November 2016

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1505.00641, http://jmlr.csail.mit.edu/papers/v17/15-355.html

zbMATH Keywords

context-aware recommendationmatrix factorizationMCMCPython

Mathematics Subject Classification ID

Factorization of matrices (15A23) Software, source code, etc. for problems pertaining to computer science (68-04) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A very fast algorithm for matrix factorization
• LIBMF: a library for parallel matrix factorization in shared-memory systems
• FastInf: an efficient approximate inference library
• Fast separable factorization and applications
• LibNMF -- a library for nonnegative matrix factorization
• Accurate and fast matrix factorization for low-rank learning.
• Algorithms for estimating the parameters of factorisation machines
• Factorization machines with regularization for sparse feature interactions
• Fast multi-label core vector machine

Cited in

(5)

• Bayesian feature interaction selection for factorization machines
• LIBMF: a library for parallel matrix factorization in shared-memory systems
• Algorithms for estimating the parameters of factorisation machines
• Factorization machines with regularization for sparse feature interactions
• FMMTL: FMM Template Library A Generalized Framework for Kernel Matrices

Describes a project that uses

Uses Software

• Scikit
• GraphLab
• fastFM
• libFM

This page was built for publication: fastFM: a library for factorization machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2834525)