Low-rank data modeling via the Minimum Description Length principle

Details Low-rank data modeling via the Minimum Description Length principle Low-rank data modeling via the Minimum Description Length principle

2011-09-28

arxiv.org/abs/1109.6297v1

Computer Science

Information Theory

Scientific paper

Robust low-rank matrix estimation is a topic of increasing interest, with promising applications in a variety of fields, from computer vision to data mining and recommender systems. Recent theoretical results establish the ability of such data models to recover the true underlying low-rank matrix when a large portion of the measured matrix is either missing or arbitrarily corrupted. However, if low rank is not a hypothesis about the true nature of the data, but a device for extracting regularity from it, no current guidelines exist for choosing the rank of the estimated matrix. In this work we address this problem by means of the Minimum Description Length (MDL) principle -- a well established information-theoretic approach to statistical inference -- as a guideline for selecting a model for the data at hand. We demonstrate the practical usefulness of our formal approach with results for complex background extraction in video sequences.

Affiliated with

Also associated with

No associations

Rating

Low-rank data modeling via the Minimum Description Length principle 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 Low-rank data modeling via the Minimum Description Length principle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-rank data modeling via the Minimum Description Length principle will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-44489