A Very Fast Algorithm for Matrix Factorization

Statistics – Computation

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We present a very fast algorithm for general matrix factorization of a data matrix for use in the statistical analysis of high-dimensional data via latent factors. Such data are prevalent across many application areas and generate an ever-increasing demand for methods of dimension reduction in order to undertake the statistical analysis of interest. Our algorithm uses a gradient-based approach which can be used with an arbitrary loss function provided the latter is differentiable. The speed and effectiveness of our algorithm for dimension reduction is demonstrated in the context of supervised classification of some real high-dimensional data sets from the bioinformatics literature.

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

A Very Fast Algorithm for Matrix Factorization 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 A Very Fast Algorithm for Matrix Factorization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Very Fast Algorithm for Matrix Factorization will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-594719

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