NonnegativeMatrixFactorization Class 
Namespace: Accord.Math.Decompositions
The NonnegativeMatrixFactorization type exposes the following members.
Name  Description  

NonnegativeMatrixFactorization(Double, Int32) 
Initializes a new instance of the NMF algorithm
 
NonnegativeMatrixFactorization(Double, Int32, Int32) 
Initializes a new instance of the NMF algorithm

Name  Description  

LeftNonnegativeFactors 
Gets the nonnegative factor matrix W.
 
RightNonnegativeFactors 
Gets the nonnegative factor matrix H.

Name  Description  

Equals  Determines whether the specified object is equal to the current object. (Inherited from Object.)  
Finalize  Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.)  
GetHashCode  Serves as the default hash function. (Inherited from Object.)  
GetType  Gets the Type of the current instance. (Inherited from Object.)  
MemberwiseClone  Creates a shallow copy of the current Object. (Inherited from Object.)  
ToString  Returns a string that represents the current object. (Inherited from Object.) 
Name  Description  

HasMethod 
Checks whether an object implements a method with the given name.
(Defined by ExtensionMethods.)  
IsEqual  Compares two objects for equality, performing an elementwise comparison if the elements are vectors or matrices. (Defined by Matrix.)  
ToT 
Converts an object into another type, irrespective of whether
the conversion can be done at compile time or not. This can be
used to convert generic types to numeric types during runtime.
(Defined by ExtensionMethods.) 
Nonnegative matrix factorization (NMF) is a group of algorithms in multivariate analysis and linear algebra where a matrix X is factorized into (usually) two matrices, W and H. The nonnegative factorization enforces the constraint that the factors W and H must be nonnegative, i.e., all elements must be equal to or greater than zero. The factorization is not unique.
References: