nmfgpu | CUDA accelerated computation of Non-negative Matrix | GPU library

by razorx89 C++ Version: v0.2.3 License: GPL-3.0

X-Ray Key Features Code Snippets(2)Community Discussions(1)Vulnerabilities Install Support

kandi X-RAY | nmfgpu Summary

nmfgpu is a C++ library typically used in Hardware, GPU applications. nmfgpu has no bugs, it has no vulnerabilities, it has a Strong Copyleft License and it has low support. You can download it from GitHub.

The Non-negative Matrix Factorization (NMF) was first described by Paatero and Tapper [1] and further developed by Lee & Seung [2]. Since then various algorithms for different needs were developed, such as Alternating Hoyer Constrained Least Squared (AHCLS) [3], Gradient Descent Constrained Least Squares (GDCLS) [4] and Non-smooth Non-negative Matrix Factorization (nsNMF) [5]. This library implements a set of algorithms and initialization strategies using the CUDA platforms. A binding to this library exists for the R language and can be found here.

Support

Quality

Security

License

Reuse

Support

nmfgpu has a low active ecosystem.

It has 9 star(s) with 4 fork(s). There are 2 watchers for this library.

It had no major release in the last 12 months.

There are 1 open issues and 1 have been closed. On average issues are closed in 4 days. There are no pull requests.

It has a neutral sentiment in the developer community.

The latest version of nmfgpu is v0.2.3

Quality

nmfgpu has 0 bugs and 0 code smells.

Security

nmfgpu has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.

nmfgpu code analysis shows 0 unresolved vulnerabilities.

There are 0 security hotspots that need review.

License

nmfgpu is licensed under the GPL-3.0 License. This license is Strong Copyleft.

Strong Copyleft licenses enforce sharing, and you can use them when creating open source projects.

Reuse

nmfgpu releases are available to install and integrate.

Installation instructions are not available. Examples and code snippets are available.

Top functions reviewed by kandi - BETA

kandi's functional review helps you automatically verify the functionalities of the libraries and avoid rework.
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of nmfgpu

Get all kandi verified functions for this library.

nmfgpu Key Features

No Key Features are available at this moment for nmfgpu.

nmfgpu Examples and Code Snippets

Instructions

C++

Lines of Code : 14

License : Strong Copyleft (GPL-3.0)

Copy

git clone https://github.com/razorx89/nmfgpu.git

cd nmfgpu
cmake-gui

cd nmfgpu
mkdir build
cd build
cmake .. -G ""

cmake .. -G "Unix Makefiles"

cmake .. -G "Visual Studio 12 2013 Win64"

cmake . -DCMAKE_INSTALL_PREFIX="/usr/local/nmfgpu/"

msbuil

nmfgpu,Citation

C++

Lines of Code : 11

License : Strong Copyleft (GPL-3.0)

Copy

@Article{koitka-friedrich:2016,
  author       = {Sven Koitka and Christoph M. Friedrich}, 
  title        = {{nmfgpu4R}: {GPU}-Accelerated Computation of the Non-Negative Matrix Factorization ({NMF}) Using {CUDA} Capable Hardware}, 
  journal      =

Community Discussions

Trending Discussions on nmfgpu

Convex NMF implementation

QUESTION

Convex NMF implementation

Asked 2019-Mar-18 at 06:37

I need Convex NMF to explore some dat asets in R. I can not find any Convex NMF implementation in packages: NMF, NMFgpu. Any idea how to search for it?

...

ANSWER

Answered 2019-Mar-17 at 20:10

Questions about recommendations for packages are off-topic for SO, but if I interpret this as how do I find ... ?, then the sos package is a good solution. It does a full-text search of all CRAN packages.

Source https://stackoverflow.com/questions/55211363

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install nmfgpu

You can download it from GitHub.

Support

For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .

Find more information at: