@INPROCEEDINGS{MikRaeMue01,
    author = {Mika, S. and R{\"a}tsch, G. and M{\"u}ller, K.-R.},
    editor = "Leen, T.K. and Dietterich, T.G. and Tresp, V.",
    title = "A mathematical programming approach to the {K}ernel {F}isher algorithm",
    booktitle = "Advances in Neural Information Processing Systems",
    year = "2001",
    volume = "13",
    pages = "591--597",
    publisher = "MIT Press",
    abstract = "We investigate a new kernel--based classifier: the Kernel Fisher Discriminant (KFD). A mathematical programming formulation based on the observation that KFD maximizes the {\em average margin} permits an interesting modification of the original KFD algorithm yielding the sparse KFD. We find that both, KFD and the proposed sparse KFD, can be understood in an unifying probabilistic context. Furthermore, we show connections to Support Vector Machines and Relevance Vector Machines. From this understanding, we are able to outline a very intuitive kernel--regression technique based upon the KFD algorithm. Simulations support the usefulness of our approach",
    pdf = "http://doc.ml.tu-berlin.de/publications/publications/MikRaeMue01.pdf",
    postscript = "http://doc.ml.tu-berlin.de/publications/publications/MikRaeMue01.ps"
}