Factorization approaches provide high accuracy in several important prediction problems, for example, recommender systems. However, applying factorization approaches to a new prediction problem is a nontrivial task and requires a lot of expert knowledge. Typically, a new model is developed, a learning algorithm is derived, and the approach has to be implemented. Factorization machines (FM) are a generic approach since they can mimic most factorization models just by feature engineering. This way, factorization machines combine the generality of feature engineering with the superiority of factorization models in estimating interactions between categorical variables of large domain. libFM is a software implementation for factorization machines that features stochastic gradient descent (SGD) and alternating least-squares (ALS) optimization, as well as Bayesian inference using Markov Chain Monto Carlo (MCMC). This article summarizes the recent research on factorization machines both in terms of modeling and learning, provides extensions for the ALS and MCMC algorithms, and describes the software tool libFM.
%0 Journal Article
%1 rendle2012factorization
%A Rendle, Steffen
%C New York, NY, USA
%D 2012
%I ACM
%J ACM Trans. Intell. Syst. Technol.
%K factor factorization libfm machines models recommender recsys
%N 3
%P 57:1--57:22
%R 10.1145/2168752.2168771
%T Factorization Machines with libFM
%U http://doi.acm.org/10.1145/2168752.2168771
%V 3
%X Factorization approaches provide high accuracy in several important prediction problems, for example, recommender systems. However, applying factorization approaches to a new prediction problem is a nontrivial task and requires a lot of expert knowledge. Typically, a new model is developed, a learning algorithm is derived, and the approach has to be implemented. Factorization machines (FM) are a generic approach since they can mimic most factorization models just by feature engineering. This way, factorization machines combine the generality of feature engineering with the superiority of factorization models in estimating interactions between categorical variables of large domain. libFM is a software implementation for factorization machines that features stochastic gradient descent (SGD) and alternating least-squares (ALS) optimization, as well as Bayesian inference using Markov Chain Monto Carlo (MCMC). This article summarizes the recent research on factorization machines both in terms of modeling and learning, provides extensions for the ALS and MCMC algorithms, and describes the software tool libFM.
@article{rendle2012factorization,
abstract = {Factorization approaches provide high accuracy in several important prediction problems, for example, recommender systems. However, applying factorization approaches to a new prediction problem is a nontrivial task and requires a lot of expert knowledge. Typically, a new model is developed, a learning algorithm is derived, and the approach has to be implemented. Factorization machines (FM) are a generic approach since they can mimic most factorization models just by feature engineering. This way, factorization machines combine the generality of feature engineering with the superiority of factorization models in estimating interactions between categorical variables of large domain. libFM is a software implementation for factorization machines that features stochastic gradient descent (SGD) and alternating least-squares (ALS) optimization, as well as Bayesian inference using Markov Chain Monto Carlo (MCMC). This article summarizes the recent research on factorization machines both in terms of modeling and learning, provides extensions for the ALS and MCMC algorithms, and describes the software tool libFM.},
acmid = {2168771},
added-at = {2013-07-17T14:47:33.000+0200},
address = {New York, NY, USA},
articleno = {57},
author = {Rendle, Steffen},
biburl = {https://www.bibsonomy.org/bibtex/259d99cb9a9538e36e94792713f0bc086/folke},
description = {Factorization Machines with libFM},
doi = {10.1145/2168752.2168771},
interhash = {c0457142c7201487b1f6e22aba237c30},
intrahash = {59d99cb9a9538e36e94792713f0bc086},
issn = {2157-6904},
issue_date = {May 2012},
journal = {ACM Trans. Intell. Syst. Technol.},
keywords = {factor factorization libfm machines models recommender recsys},
month = may,
number = 3,
numpages = {22},
pages = {57:1--57:22},
publisher = {ACM},
timestamp = {2013-07-17T14:47:33.000+0200},
title = {Factorization Machines with libFM},
url = {http://doi.acm.org/10.1145/2168752.2168771},
volume = 3,
year = 2012
}