Exploring Parallel Implementations of the Bayesian Probabilistic Matrix Factorization

Using the matrix factorization technique in machine learning is very common mainly in areas like recommender systems. Despite its high prediction accuracy and its ability to avoid over-fitting of the data, the Bayesian Probabilistic Matrix Factorization algorithm (BPMF) has not been widely used beca...

Full description

Saved in:
Bibliographic Details
Published in:2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) pp. 119 - 126
Main Authors: Chakroun, Imen, Haber, Tom, Aa, Tom Vander, Kovac, Thomas
Format: Conference Proceeding Journal Article
Language:English
Published: IEEE 01.02.2016
Subjects:
Algorithms
Bayes methods
Bayesian analysis
Collaborative filtering
Conferences
Electronics packaging
Factorization
Instruction sets
Machine learning
Motion pictures
multicore
Multicore processing
PGAS
Probabilistic logic
Probabilistic matrix factorization algorithm
Probabilistic methods
Probability theory
Recommender systems
Sampling
ISSN:2377-5750
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Using the matrix factorization technique in machine learning is very common mainly in areas like recommender systems. Despite its high prediction accuracy and its ability to avoid over-fitting of the data, the Bayesian Probabilistic Matrix Factorization algorithm (BPMF) has not been widely used because of the prohibitive cost. In this paper, we propose a comprehensive parallel implementation of the BPMF using Gibbs sampling on shared and distributed architectures. We also propose an insight of a GPU-based implementation of this algorithm.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:2377-5750
DOI:10.1109/PDP.2016.48