Scaling Up Graph-Based Semisupervised Learning via Prototype Vector Machines

Kai Zhang

doi:10.1109/TNNLS.2014.2315526

Scaling Up Graph-Based Semisupervised Learning via Prototype Vector Machines

2015-03-01

36

OA

AI

DOI：10.1109/TNNLS.2014.2315526

Original

Save

View PDF

Abstract

En 中文

When the amount of labeled data are limited, semisupervised learning can improve the learner's performance by also using the often easily available unlabeled data. In particular, a popular approach requires the learned function to be smooth on the underlying data manifold. By approximating this manifold as a weighted graph, such graph-based techniques can often achieve state-of-the-art performance. However, their high time and space complexities make them less attractive on large data sets. In this paper, we propose to scale up graph-based semisupervised learning using a set of sparse prototypes derived from the data. These prototypes serve as a small set of data representatives, which can be used to approximate the graph-based regularizer and to control model complexity. Consequently, both training and testing become much more efficient. Moreover, when the Gaussian kernel is used to define the graph affinity, a simple and principled method to select the prototypes can be obtained. Experiments on a number of real-world data sets demonstrate encouraging performance and scaling properties of the proposed approach. It also compares favorably with models learned via l(1)-regularization at the same level of model sparsity. These results demonstrate the efficacy of the proposed approach in producing highly parsimonious and accurate models for semisupervised learning.

Keywords:

Graph-based methods

large data sets

low-rank approximation

manifold regularization

semisupervised learning

Scaling Up Graph-Based Semisupervised Learning via Prototype Vector Machines

Abstract

AI Summary

Journal

Organization