Clustering Of Nonnegative Data And An Application To Matrix Completion

This video program is a part of the Premium package:

Clustering Of Nonnegative Data And An Application To Matrix Completion


  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00
Purchase

Clustering Of Nonnegative Data And An Application To Matrix Completion

0 views
  • Share
Create Account or Sign In to post comments
In this paper, we propose a simple algorithm to cluster nonnegative data lying in disjoint subspaces. We analyze its performance in relation to a certain measure of correlation between said subspaces. We use our clustering algorithm to develop a matrix co
In this paper, we propose a simple algorithm to cluster nonnegative data lying in disjoint subspaces. We analyze its performance in relation to a certain measure of correlation between said subspaces. We use our clustering algorithm to develop a matrix co