Graph-Based Invariant Manifolds for Invariant Pattern Recognition with Kernel Methods. Pozdnoukhov, A. & Bengio, S. In International Conference on Pattern Recognition, ICPR, 2006.
Graph-Based Invariant Manifolds for Invariant Pattern Recognition with Kernel Methods [link]Paper  abstract   bibtex   
We present here an approach for applying the technique of modeling data transformation manifolds for invariant learning with kernel methods. The approach is based on building a kernel function on the graph modeling the invariant manifold. It provides a way for taking into account nearly arbitrary transformations of the input samples. The approach is verified experimentally on the task of optical character recognition, providing state-of-the-art performance on harder problem settings.
@inproceedings{pozdnoukhov:2006:icpr,
  author = {A. Pozdnoukhov and S. Bengio},
  title = {Graph-Based Invariant Manifolds for Invariant Pattern Recognition with Kernel Methods},
  booktitle = {International Conference on Pattern Recognition, {ICPR}},
  year = 2006,
  url = {publications/ps/pozdnoukhov_2006_icpr.ps.gz},
  pdf = {publications/pdf/pozdnoukhov_2006_icpr.pdf},
  djvu = {publications/djvu/pozdnoukhov_2006_icpr.djvu},
  original = {2006/manifold_icpr},
  topics = {kernel},
  abstract = {We present here an approach for applying the technique of modeling data transformation manifolds for invariant learning with kernel methods. The approach is based on building a kernel function on the graph modeling the invariant manifold. It provides a way for taking into account nearly arbitrary transformations of the input samples. The approach is verified experimentally on the task of optical character recognition, providing state-of-the-art performance on harder problem settings.},
  categorie = {C}
}

Downloads: 0