Rank/Norm Regularization with Closed-Form Solutions: Application to Subspace Clustering

Details Rank/Norm Regularization with Closed-Form Solutions: Application to Subspace Clustering Rank/Norm Regularization with Closed-Form Solutions: Application to Subspace Clustering

2012-02-14

arxiv.org/abs/1202.3772v1

Computer Science

Learning

Scientific paper

When data is sampled from an unknown subspace, principal component analysis (PCA) provides an effective way to estimate the subspace and hence reduce the dimension of the data. At the heart of PCA is the Eckart-Young-Mirsky theorem, which characterizes the best rank k approximation of a matrix. In this paper, we prove a generalization of the Eckart-Young-Mirsky theorem under all unitarily invariant norms. Using this result, we obtain closed-form solutions for a set of rank/norm regularized problems, and derive closed-form solutions for a general class of subspace clustering problems (where data is modelled by unions of unknown subspaces). From these results we obtain new theoretical insights and promising experimental results.

Affiliated with

Also associated with

No associations

Rating

Rank/Norm Regularization with Closed-Form Solutions: Application to Subspace Clustering 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 Rank/Norm Regularization with Closed-Form Solutions: Application to Subspace Clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rank/Norm Regularization with Closed-Form Solutions: Application to Subspace Clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90745