NOMAD: Non-locking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion

Proceedings of the VLDB Endowment, Volume 7, Issue 11, 2014, Pages 975-986.

Cited by: 153|Views62
EI

Abstract:

We develop an efficient parallel distributed algorithm for matrix completion, named NOMAD (Non-locking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion). NOMAD is a decentralized algorithm with non-blocking communication between processors. One of the key features of NOMAD is that the ownership of a...More

Code:

Data:

Your rating :
0

 

Tags
Comments