Computer Science – Learning
Scientific paper
2010-10-26
Computer Science
Learning
55 pages, 11 figures
Scientific paper
This paper proposes uni-orthogonal and bi-orthogonal nonnegative matrix
factorization algorithms with robust convergence proofs. We design the
algorithms based on the work of Lee and Seung [1], and derive the converged
versions by utilizing ideas from the work of Lin [2]. The experimental results
confirm the theoretical guarantees of the convergences.
No associations
LandOfFree
Converged Algorithms for Orthogonal Nonnegative Matrix Factorizations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Converged Algorithms for Orthogonal Nonnegative Matrix Factorizations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Converged Algorithms for Orthogonal Nonnegative Matrix Factorizations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-158894