A novel manifold regularized online semi-supervised learning algorithm

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a novel manifold regularized online semi-supervised learning (OS2L) model in an Reproducing Kernel Hilbert Space (RK-HS). The proposed algorithm, named Model-Based Online Manifold Regularization (MOMR), is derived by solving a constrained optimization problem, which is different from the stochastic gradient algorithm used for solving the online version of the primal problem of Laplacian support vector machine (LapSVM). Taking advantage of the convex property of the proposed model, an exact solution can be obtained iteratively by solving its Lagrange dual problem. Furthermore, a buffering strategy is introduced to improve the computational efficiency of the algorithm. Finally, the proposed algorithm is experimentally shown to have a comparable performance to the standard batch manifold regularization algorithm.

Cite

CITATION STYLE

APA

Ding, S., Xi, X., Liu, Z., Qiao, H., & Zhang, B. (2016). A novel manifold regularized online semi-supervised learning algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9947 LNCS, pp. 597–605). Springer Verlag. https://doi.org/10.1007/978-3-319-46687-3_66

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free