Skip to content
/ daSVM Public
forked from chokkyvista/daSVM

Matlab implementation of the EM and MCMC algorithm for SVMs as introduced in the paper "Data augmentation for support vector machines"

Notifications You must be signed in to change notification settings

wxiang7/daSVM

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

This is a Matlab implementation of the fancy idea by Polson & Scott that reformulates the traditional binary linear SVM problem into a MAP (Maximum a Posteriori) estimation in a probabilistic generative model, and by use of the technique of data augmentation, makes it possible to do very easy and fast Gibbs sampling for the solution.

You may find the paper here:
"Data Augmentation for Support Vector Machines" by Nicholas G. Polson and Steven L. Scotty, published in Bayesian Analysis (2011)
http://ba.stat.cmu.edu/journal/2011/vol06/issue01/polson.pdf

Specifically, I implemented the basic EM algorithm and the MCMC algorithm, as well as the case under spike-and-slab prior.

NEW: We extend the algorithm to the Crammer & Singer multi-class SVM!
     Check csmultisvm.m!

The code is already highly optimized for Matlab (not further accelerated by MEX though).

About

Matlab implementation of the EM and MCMC algorithm for SVMs as introduced in the paper "Data augmentation for support vector machines"

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published