Data-dependent kernels in nearly-linear time

Details Data-dependent kernels in nearly-linear time Data-dependent kernels in nearly-linear time

2011-10-20

arxiv.org/abs/1110.4416v1

Computer Science

Learning

Scientific paper

We propose a method to efficiently construct data-dependent kernels which can make use of large quantities of (unlabeled) data. Our construction makes an approximation in the standard construction of semi-supervised kernels in Sindhwani et al. 2005. In typical cases these kernels can be computed in nearly-linear time (in the amount of data), improving on the cubic time of the standard construction, enabling large scale semi-supervised learning in a variety of contexts. The methods are validated on semi-supervised and unsupervised problems on data sets containing upto 64,000 sample points.

Affiliated with

Also associated with

No associations

Rating

Data-dependent kernels in nearly-linear time 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 Data-dependent kernels in nearly-linear time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data-dependent kernels in nearly-linear time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-550707