The graph based semi-supervised algorithm with ℓ1-regularizer

In this paper a new graph-based semi-supervised algorithm for regression problem is proposed. An excess generalization error bound is established. It evaluates the learning performance of the proposed method and has a fast convergence rate with O ( l ? - 1 ) decay. An example is given to show that the proposed method uses a small portion of the labeled and unlabeled data to represent the target function, which illustrates the sparsity of the algorithm, and can efficiently reduce the computational complexity of the semi-supervised learning. Moreover, some experiments are performed to validate the sparsity and learning performance of the formulation.

[1]  Luoqing Li,et al.  Semisupervised Multicategory Classification With Imperfect Model , 2009, IEEE Transactions on Neural Networks.

[2]  Ding-Xuan Zhou,et al.  LEARNING BY NONSYMMETRIC KERNELS WITH DATA DEPENDENT SPACES AND , 2010 .

[3]  Michel Verleysen,et al.  A graph Laplacian based approach to semi-supervised feature selection for regression problems , 2013, Neurocomputing.

[4]  Dirong Chen,et al.  Consistency of regularized spectral clustering , 2011 .

[5]  Jiangtao Peng,et al.  Error bounds of multi-graph regularized semi-supervised classification , 2009, Inf. Sci..

[6]  Ivor W. Tsang,et al.  Laplacian Embedded Regression for Scalable Manifold Regularization , 2012, IEEE Transactions on Neural Networks and Learning Systems.

[7]  Roland Opfer,et al.  Multiscale kernels , 2006, Adv. Comput. Math..

[8]  Rajat Raina,et al.  Efficient sparse coding algorithms , 2006, NIPS.

[9]  Haitao Zhao.  Combining labeled and unlabeled data with graph embedding , 2006, Neurocomputing.

[10]  Philippe Rigollet,et al.  Generalization Error Bounds in Semi-supervised Classification Under the Cluster Assumption , 2006, J. Mach. Learn. Res..

[11]  Qiang Wu,et al.  Least square regression with indefinite kernels and coefficient regularization , 2011 .

[12]  Xiaojin Zhu,et al.  --1 CONTENTS , 2006 .

[13]  R. Opfer.  Tight frame expansions of multiscale reproducing kernels in Sobolev spaces , 2006 .

[14]  Yuesheng Xu,et al.  Refinable Kernels , 2007, J. Mach. Learn. Res..

[15]  Ding-Xuan Zhou,et al.  Concentration estimates for learning with ℓ1-regularizer and data dependent hypothesis spaces , 2011 .

[16]  Shiliang Sun,et al.  Manifold-preserving graph reduction for sparse semi-supervised learning , 2014, Neurocomputing.

[17]  Mikhail Belkin,et al.  Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples , 2006, J. Mach. Learn. Res..

[18]  Shiliang Sun,et al.  Sparse Semi-supervised Learning Using Conjugate Functions , 2010, J. Mach. Learn. Res..

[19]  S. Smale,et al.  Learning Theory Estimates via Integral Operators and Their Approximations , 2007 .

[20]  Luoqing Li,et al.  Generalization performance of graph-based semi-supervised classification , 2009 .

[21]  Zenglin Xu,et al.  Discriminative Semi-Supervised Feature Selection Via Manifold Regularization , 2009, IEEE Transactions on Neural Networks.

[22]  Ivor W. Tsang,et al.  Large-Scale Sparsified Manifold Regularization , 2006, NIPS.