Semi-supervised learning with nuclear norm regularization

作者:

Highlights:

摘要

Integrating new knowledge sources into various learning tasks to improve their performance has recently become an interesting topic. In this paper we propose a novel semi-supervised learning (SSL) approach, called semi-supervised learning with nuclear norm regularization (SSL-NNR), which can simultaneously handle both sparse labeled data and additional pairwise constraints together with unlabeled data. Specifically, we first construct a unified SSL framework to combine the manifold assumption and the pairwise constraints assumption for classification tasks. Then we provide a modified fixed point continuous algorithm to learn a low-rank kernel matrix that takes advantage of Laplacian spectral regularization. Finally, we develop a two-stage optimization strategy, and present a semi-supervised classification algorithm with enhanced spectral kernel (ESK). Moreover, we also present a theoretical analysis of the proposed ESK algorithm, and derive an easy approach to extend it to out-of-sample data. Experimental results on a variety of synthetic and real-world data sets demonstrate the effectiveness of the proposed ESK algorithm.

论文关键词:Semi-supervised learning (SSL),Low-rank kernel learning,Graph Laplacian,Nuclear norm regularization,Pairwise constraints

论文评审过程:Received 28 February 2012, Revised 29 December 2012, Accepted 9 January 2013, Available online 17 January 2013.

论文官网地址:https://doi.org/10.1016/j.patcog.2013.01.009