Semi-supervised Learning with Density Based Distances

Details Semi-supervised Learning with Density Based Distances Semi-supervised Learning with Density Based Distances

2012-02-14

arxiv.org/abs/1202.3702v1

Computer Science

Learning

Scientific paper

We present a simple, yet effective, approach to Semi-Supervised Learning. Our approach is based on estimating density-based distances (DBD) using a shortest path calculation on a graph. These Graph-DBD estimates can then be used in any distance-based supervised learning method, such as Nearest Neighbor methods and SVMs with RBF kernels. In order to apply the method to very large data sets, we also present a novel algorithm which integrates nearest neighbor computations into the shortest path search and can find exact shortest paths even in extremely large dense graphs. Significant runtime improvement over the commonly used Laplacian regularization method is then shown on a large scale dataset.

Affiliated with

Also associated with

No associations

Rating

Semi-supervised Learning with Density Based Distances 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 Semi-supervised Learning with Density Based Distances, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semi-supervised Learning with Density Based Distances will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90338