Simulated Annealing with Levy Distribution for Fast Matrix Factorization-Based Collaborative Filtering
Machine Learning
2017-08-10 v1 Information Retrieval
Machine Learning
Abstract
Matrix factorization is one of the best approaches for collaborative filtering, because of its high accuracy in presenting users and items latent factors. The main disadvantages of matrix factorization are its complexity, and being very hard to be parallelized, specially with very large matrices. In this paper, we introduce a new method for collaborative filtering based on Matrix Factorization by combining simulated annealing with levy distribution. By using this method, good solutions are achieved in acceptable time with low computations, compared to other methods like stochastic gradient descent, alternating least squares, and weighted non-negative matrix factorization.
Cite
@article{arxiv.1708.02867,
title = {Simulated Annealing with Levy Distribution for Fast Matrix Factorization-Based Collaborative Filtering},
author = {Mostafa A. Shehata and Mohammad Nassef and Amr A. Badr},
journal= {arXiv preprint arXiv:1708.02867},
year = {2017}
}