title: The generalization ability of online SVM classification based on Markov sampling.
abstract: In this paper, we consider online support vector machine (SVM) classification learning algorithms with uniformly ergodic Markov chain (u.e.M.c.) samples. We establish the bound on the misclassification error of an online SVM classification algorithm with u.e.M.c. samples based on reproducing kernel Hilbert spaces and obtain a satisfactory convergence rate. We also introduce a novel online SVM classification algorithm based on Markov sampling, and present the numerical studies on the learning ability of online SVM classification based on Markov sampling for benchmark repository. The numerical studies show that the learning performance of the online SVM classification algorithm based on Markov sampling is better than that of classical online SVM classification based on random sampling as the size of training samples is larger.
authors.forename: Jie
authors.initials: J
authors.lastname: Xu
authors.forename: Yuan
authors.initials: Y
authors.lastname: Yan Tang
authors.forename: Bin
authors.initials: B
authors.lastname: Zou
authors.forename: Zongben
authors.initials: Z
authors.lastname: Xu
authors.forename: Luoqing
authors.initials: L
authors.lastname: Li
authors.forename: Yang
authors.initials: Y
authors.lastname: Lu