Scalable Graph-Based Semi-Supervised Learning through Sparse Bayesian Model

Bingbing Jiang

doi:10.1109/TKDE.2017.2749574

2017-12-01

PRE

DOI：10.1109/TKDE.2017.2749574

原文链接

原文求助

摘要

En 中文

Semi-supervised learning (SSL) concerns the problem of how to improve classifiers' performance through making use of prior knowledge from unlabeled data. Many SSL methods have been developed to integrate unlabeled data into the classifiers based on either the manifold or cluster assumption in recent years. In particular, the graph-based approaches, following the manifold assumption, have achieved a promising performance in many real-world applications. However, most of them work well on small-scale data sets only and lack probabilistic outputs. In this paper, a scalable graph-based SSL framework through sparse Bayesian model is proposed by defining a graph-based sparse prior. Based on the traditional Bayesian inference technique, a sparse Bayesian SSL algorithm ((SBSL)-L-2) is obtained, which can remove the irrelevant unlabeled samples and make probabilistic prediction for out-of-sample data. Moreover, in order to scale (SBSL)-L-2 to large-scale data sets, an incremental (SBSL)-L-2 ((ISBSL)-L-2) is derived. The key idea of (ISBSL)-L-2 is employing an incremental strategy and sequentially selecting parts of unlabeled samples that contribute to the learning instead of using all available unlabeled samples directly. (ISBSL)-L-2 has lower time and space complexities than previous SSL algorithms with the use of all unlabeled samples. Extensive experiments on various data sets verify that our algorithms can achieve comparable classification effectiveness and efficiency with much better scalability. Finally, the generalization error bound is derived based on robustness analysis.

Keyword:

Semi-supervised learning

graph-based methods

sparse Bayesian model

incremental learning

large-scale data sets