String Kernels, Fisher Kernels and Finite State Automata (2003)
Cached
Download Links
- [www.cs.rhul.ac.uk]
- [cis.paisley.ac.uk]
- [www.ecs.soton.ac.uk]
- DBLP
Other Repositories/Bibliography
by
Craig Saunders
,
John Shawe-taylor
,
Alexei Vinokourov
| Venue: | in Advances in Neural Information Processing Systems 15 |
| Citations: | 13 - 1 self |
BibTeX
@INPROCEEDINGS{Saunders03stringkernels,,
author = {Craig Saunders and John Shawe-taylor and Alexei Vinokourov},
title = {String Kernels, Fisher Kernels and Finite State Automata},
booktitle = {in Advances in Neural Information Processing Systems 15},
year = {2003},
pages = {633--640},
publisher = {MIT Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we show how the generation of documents can be thought of as a k-stage Markov process, which leads to a Fisher kernel from which the n-gram and string kernels can be re-constructed.
Citations
No citations identified.
