Non-Negative Matrix Factorization System: Difference between revisions
Jump to navigation
Jump to search
(Created page with "A Non-Negative Matrix Factorization System is a matrix factorization system that can implement a non-negative matrix factorization algorithm to solve a non-negat...") |
No edit summary |
||
Line 9: | Line 9: | ||
** It can support a [[Matrix Compression System]]. | ** It can support a [[Matrix Compression System]]. | ||
* <B>Example(s):</B> | * <B>Example(s):</B> | ||
** | ** http://www.quuxlabs.com/blog/2010/09/matrix-factorization-a-simple-tutorial-and-implementation-in-python/ | ||
** a [[ | * <B>Counter-Example(s):</B> | ||
** a [[Positive Matrix Factorization System]]. | |||
* <B>See:</B> [[Linear Programming System]]. | * <B>See:</B> [[Linear Programming System]]. | ||
---- | ---- | ||
---- | ---- | ||
[[Category:Concept]] | [[Category:Concept]] |
Revision as of 18:55, 1 May 2015
A Non-Negative Matrix Factorization System is a matrix factorization system that can implement a non-negative matrix factorization algorithm to solve a non-negative matrix factorization task.
- AKA: Nonnegative Matrix Decomposer.
- Context:
- It can range from being an Exact Nonnegative Matrix Decomposition System to being an Approximate Matrix Decomposition System (such as a regularized matrix factorization system).
- It can range from being a Global Matrix Decomposition System to being a Local Matrix Decomposition System.
- It can range from being a Nonnegative Matrix Factorization System to being a Positive Matrix Factorization System to being ...
- It can range from being a Weighted Matrix Decomposition System to being ...
- It can range from being a Boolean Matrix Decomposition System to being an Integer Matrix Decomposition System to being Real Matrix Decomposition System.
- It can support a Matrix Compression System.
- Example(s):
- Counter-Example(s):
- See: Linear Programming System.