Online Semi-Supervised Learning on Quantized Graphs

Details Online Semi-Supervised Learning on Quantized Graphs Online Semi-Supervised Learning on Quantized Graphs

2012-03-15

arxiv.org/abs/1203.3522v1

Computer Science

Learning

Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)

Scientific paper

In this paper, we tackle the problem of online semi-supervised learning (SSL). When data arrive in a stream, the dual problems of computation and data storage arise for any SSL method. We propose a fast approximate online SSL algorithm that solves for the harmonic solution on an approximate graph. We show, both empirically and theoretically, that good behavior can be achieved by collapsing nearby points into a set of local "representative points" that minimize distortion. Moreover, we regularize the harmonic solution to achieve better stability properties. We apply our algorithm to face recognition and optical character recognition applications to show that we can take advantage of the manifold structure to outperform the previous methods. Unlike previous heuristic approaches, we show that our method yields provable performance bounds.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-32370