Spectral approximations in machine learning

Details Spectral approximations in machine learning Spectral approximations in machine learning

2011-07-21

arxiv.org/abs/1107.4340v1

Statistics

Machine Learning

11 pages, 4 figures

Scientific paper

In many areas of machine learning, it becomes necessary to find the eigenvector decompositions of large matrices. We discuss two methods for reducing the computational burden of spectral decompositions: the more venerable Nystom extension and a newly introduced algorithm based on random projections. Previous work has centered on the ability to reconstruct the original matrix. We argue that a more interesting and relevant comparison is their relative performance in clustering and classification tasks using the approximate eigenvectors as features. We demonstrate that performance is task specific and depends on the rank of the approximation.

Affiliated with

Also associated with

No associations

Rating

Spectral approximations in machine learning 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 Spectral approximations in machine learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spectral approximations in machine learning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-688397