A Novel Manifold Regularized Online Semi-supervised Learning Model

被引:16
作者
Ding, Shuguang [1 ,2 ]
Xi, Xuanyang [3 ]
Liu, Zhiyong [3 ,4 ,5 ]
Qiao, Hong [3 ,4 ,5 ]
Zhang, Bo [1 ,2 ]
机构
[1] Chinese Acad Sci, LSEC, Beijing 100190, Peoples R China
[2] Chinese Acad Sci, Inst Appl Math, AMSS, Beijing 100190, Peoples R China
[3] Chinese Acad Sci, Inst Automat, State Key Lab Management & Control Complex Syst, Beijing 100190, Peoples R China
[4] Chinese Acad Sci, CEBSIT, Shanghai 200031, Peoples R China
[5] Chinese Acad Sci, Cloud Comp Ctr, Dongguan 523808, Guangdong, Peoples R China
关键词
Human learning; Manifold regularization; Online semi-supervised learning; Lagrange dual problem; FRAMEWORK;
D O I
10.1007/s12559-017-9489-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the process of human learning, training samples are often obtained successively. Therefore, many human learning tasks exhibit online and semi-supervision characteristics, that is, the observations arrive in sequence and the corresponding labels are presented very sporadically. In this paper, we propose a novel manifold regularized model in a reproducing kernel Hilbert space (RKHS) to solve the online semi-supervised learning ((OSL)-L-2) problems. The proposed algorithm, named Model-Based Online Manifold Regularization (MOMR), is derived by solving a constrained optimization problem. Different from the stochastic gradient algorithm used for solving the online version of the primal problem of Laplacian support vector machine (LapSVM), the proposed algorithm can obtain an exact solution iteratively by solving its Lagrange dual problem. Meanwhile, to improve the computational efficiency, a fast algorithm is presented by introducing an approximate technique to compute the derivative of the manifold term in the proposed model. Furthermore, several buffering strategies are introduced to improve the scalability of the proposed algorithms and theoretical results show the reliability of the proposed algorithms. Finally, the proposed algorithms are experimentally shown to have a comparable performance to the standard batch manifold regularization algorithm.
引用
收藏
页码:49 / 61
页数:13
相关论文
共 38 条
  • [1] [Anonymous], 2010, 2010 IEEE COMP SOC C
  • [2] Babenko B, 2009, PROC CVPR IEEE, P983, DOI 10.1109/CVPRW.2009.5206737
  • [3] Belkin M, 2006, J MACH LEARN RES, V7, P2399
  • [4] The forgetron: a kernel-based perceptron on a budget
    Dekel, Ofer
    Shalev-Shwartz, Shai
    Singer, Yoram
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 37 (05) : 1342 - 1372
  • [5] An Adaptive Density Data Stream Clustering Algorithm
    Ding, Shifei
    Zhang, Jian
    Jia, Hongjie
    Qian, Jun
    [J]. COGNITIVE COMPUTATION, 2016, 8 (01) : 30 - 38
  • [6] A Novel Manifold Regularized Online Semi-supervised Learning Algorithm
    Ding, Shuguang
    Xi, Xuanyang
    Liu, Zhiyong
    Qiao, Hong
    Zhang, Bo
    [J]. NEURAL INFORMATION PROCESSING, ICONIP 2016, PT I, 2016, 9947 : 597 - 605
  • [7] Ding SG, 2014, 2014 11TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA), P1473, DOI 10.1109/WCICA.2014.7052936
  • [8] Duchi J, 2011, J MACH LEARN RES, V12, P2121
  • [9] COMPOSE: A Semisupervised Learning Framework for Initially Labeled Nonstationary Streaming Data
    Dyer, Karl B.
    Capo, Robert
    Polikar, Robi
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2014, 25 (01) : 12 - 26
  • [10] Nonconvex Online Support Vector Machines
    Ertekin, Seyda
    Bottou, Leon
    Giles, C. Lee
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (02) : 368 - 381