Abstract
Nonnegative Matrix Factorization (NMF) is a commonly-used unsupervised learning method for extracting parts-based features and dimensionality reduction from nonnegative data. Many computational algorithms exist for updating the latent nonnegative factors in NMF. In this study, we propose an extension of the Hierarchical Alternating Least Squares (HALS) algorithm to a distributed version using the state-of-the-art framework - Apache Spark. Spark gains its popularity among other distributed computational frameworks because of its in-memory approach which works much faster than well-known Apache Hadoop. The scalability and efficiency of the proposed algorithm is confirmed in the numerical experiments, performed on real data as well as synthetic ones.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
