Converged Algorithms for Orthogonal Nonnegative Matrix Factorizations

Computer Science – Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-158894

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.