Version 2.01 released on February 20, 2016. LIBMF can solve more formulations than its previous versions and do disk-level training. Please check [3] for the details.
LIBMF is an open source tool for approximating an incomplete matrix using the product of two matrices in a latent space. Matrix factorization is commonly used in recommender systems. Main features of LIBMF include
Please read the COPYRIGHT notice before using LIBMF. Note that we use the BSD license.
The algorithm of LIBMF is described in the following papers.
[1] W.-S. Chin, Y. Zhuang, Y.-C. Juan, and C.-J. Lin. A Fast Parallel Stochastic Gradient Method for Matrix Factorization in Shared Memory Systems. ACM TIST, 2015.
[2] W.-S. Chin, Y. Zhuang, Y.-C. Juan, and C.-J. Lin. A Learning-rate Schedule for Stochastic Gradient Methods to Matrix Factorization. PAKDD, 2015.
[3] W.-S. Chin, B.-W. Yuan, M.-Y. Yang, Y. Zhuang, Y.-C. Juan, and C.-J. Lin. LIBMF: A Library for Parallel Matrix Factorization in Shared-memory Systems. JMLR, 2016.
See README in the package for the practical use.
Language | Description | Maintainers and Their Affiliation | Supported LIBMF version | Link |
---|---|---|---|---|
R | R interface to LIBMF | Yixuan Qiu from Purdue University | 2.01 | R LIBMF |
Please send comments and suggestions to Chih-Jen Lin.