กก
MATLAB Toolbox for Minimum Error Minimax Probability Machine and Biased Minimax Probability Machine
Authors: Yang, Haiqin and Huang, Kaizhu
Supervisors: Irwin King, Michael R. Lyu and Laiwan Chan
MEMPM is solved by the sequential BMPM method, i.e., a line search + BMPM. The line search is solved by the Quadratic Interpolation (QI) method and BMPM is implemented by solving a concave-convex Fractional Programming problem with each local maximum being a global maximum. For linear BMPM, it is implemented by the Rosen Gradient projection method. The kernelized BMPM is implemented by the parametric method, where we need to solve a second order cone problem. We adopt the least-square method and implement the codes based on the MPM source codes provided by Gert R. G. Lanckriet. We would thank his distribution.
We also implement the robust MPM with unequal parameters (nu) by solving a Fractional Programming problem using parametric method.
The toolbox is provided free for non-commercial use.
If you want to use this toolbox for research purposes, we would like you cite it as:
Haiqin Yang, Kaizhu Huang, Irwin King, Michael R. Lyu and Laiwan Chan. Matlab Toolbox for Minimum Error Minimax Probability Machine (MEMPM-1.0), http://www.cse.cuhk.edu.hk/~miplab/mempm_toolbox/index.htm, 2004.
or
Haiqin Yang, Kaizhu Huang, Irwin King, Michael R. Lyu and Laiwan Chan. Matlab Toolbox for Biased Minimax Probability Machine (BMPM-1.0), http://www.cse.cuhk.edu.hk/~miplab/mempm_toolbox/index.htm, 2004.
Related Link
Additional Remark
We would be grateful if you let us know about any bugs you find
or send suggestions to improve the toolbox. You may send email to
hqyang@cse.cuhk.edu.hk and
kzhuang@cse.cuhk.edu.hk.
Kaizhu Huang, Haiqin Yang, Irwin King, Michael R. Lyu and Laiwan Chan. Minimum Error Minimax Probability Machine. Journal of Machine Learning Research, under revision, 2004.