Class NMFGdClsUpdate encapsulates the Gradient Descent - Constrained
Least Squares (GDCLS) algorithm for Nonnegative Matrix Facotorization (NMF).
Namespace:
CenterSpace.NMath.StatsAssembly: NMathStats (in NMathStats.dll) Version: 3.4.0.0
Syntax
| C# |
|---|
[SerializableAttribute] public class NMFGdClsUpdate : INMFUpdateAlgorithm, ICloneable |
| Visual Basic (Declaration) |
|---|
<SerializableAttribute> _ Public Class NMFGdClsUpdate _ Implements INMFUpdateAlgorithm, ICloneable |
| Visual C++ |
|---|
[SerializableAttribute] public ref class NMFGdClsUpdate : INMFUpdateAlgorithm, ICloneable |
Remarks
In some cases it may be desirable to enforce a statistical sparsity constraint
on the H matrix. As the sparsity of H increases, the basis
vectors become more localized, i.e, the parts-based representation of the data
in W becomes more and more enhanced. The Gradient Descent - Constrained
Least Squares (GDCLS) algorithm enforces sparsity in H using a scheme
that penalizes the number of non-zero entries in H. It is a hybrid
algorithm that uses the multiplicative update rule for updating W while
H is calculated using a constrained least squares model as the metric.