Skip to content
A Nonnegative Matrix Factorization algorithm based on alternating least squares and coordinate descent.
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
R 1st version can run on Win Jul 9, 2012
man 1st version can run on Win Jul 9, 2012
src
.gitignore delete some temp files Apr 12, 2013
DESCRIPTION update to the latest version Jun 16, 2012
NAMESPACE update to the latest version Jun 16, 2012
README.md add warnings May 22, 2016

README.md

bignmf

##Warning

This package is deprecated and no longer maintained!

This R package intends to solve Nonnegative Matrix Factorization efficiently. The algorithm bases on alternating least squares while solving nonnegative constrained regression via coordinate descent. The coordinate descent method is modified from glmnet (See Regularization Paths for Generalized Linear Models via Coordinate Descent, by J Friedman et al. 2010).

The inner part of the algorithm is implemented in C++. This package is currently tested only on Ubuntu.

##How to install

In Linux teminal, go to some directory:

cd  ~/mypackages/ 

Download it with:

git clone https://github.com/panlanfeng/bignmf.git

Build with:

R CMD build bignmf

Then in R:

install.packages("~/mypackages/bignmf_0.1.tar.gz", repos = NULL, type = "source")   
library(bignmf)  
You can’t perform that action at this time.