title: Efficient probabilistic classification vector machine with incremental basis function selection.
abstract: Probabilistic classification vector machine (PCVM) is a sparse learning approach aiming to address the stability problems of relevance vector machine for classification problems. Because PCVM is based on the expectation maximization algorithm, it suffers from sensitivity to initialization, convergence to local minima, and the limitation of Bayesian estimation making only point estimates. Another disadvantage is that PCVM was not efficient for large data sets. To address these problems, this paper proposes an efficient PCVM (EPCVM) by sequentially adding or deleting basis functions according to the marginal likelihood maximization for efficient training. Because of the truncated prior used in EPCVM, two approximation techniques, i.e., Laplace approximation and expectation propagation (EP), have been used to implement EPCVM to obtain full Bayesian solutions. We have verified Laplace approximation and EP with a hybrid Monte Carlo approach. The generalization performance and computational effectiveness of EPCVM are extensively evaluated. Theoretical discussions using Rademacher complexity reveal the relationship between the sparsity and the generalization bound of EPCVM.
authors.forename: Huanhuan
authors.initials: H
authors.lastname: Chen
authors.forename: Peter
authors.initials: P
authors.lastname: Tino
authors.forename: Xin
authors.initials: X
authors.lastname: Yao
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003661:Decision Support Techniques; D006801:Humans; D010363:Pattern Recognition, Automated; D011336:Probability; D060388:Support Vector Machine