Abstract
This paper proposes parallel methods of non-negative large sparse matrix factorization – a very popular technique in computational linguistics. Memory usage and data transmitting necessity of factorization algorithm was analysed and optimized. The described effective GPU-based and distributed algorithms were implemented, tested and compared by means of large sparse matrices processing.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have