Spectral Learning of Sequence Taggers over Continuous Sequences
Abstract
In this paper we present a spectral algorithm for learning weighted finite-state sequence taggers (WFSTs) over paired input-output sequences, where the input is continuous and the output discrete. WFSTs are an important tool for modelling paired input-output sequences and have numerous applications in real-world problems. Our approach is based on generalizing the class of weighted finite-state sequence taggers over discrete input-output sequences to a class where transitions are linear combinations of elementary transitions and the weights of the linear combination are determined by dynamic features of the continuous input sequence. The resulting learning algorithm is efficient and accurate.
Cite
Text
Recasens and Quattoni. "Spectral Learning of Sequence Taggers over Continuous Sequences." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013. doi:10.1007/978-3-642-40988-2_19Markdown
[Recasens and Quattoni. "Spectral Learning of Sequence Taggers over Continuous Sequences." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013.](https://mlanthology.org/ecmlpkdd/2013/recasens2013ecmlpkdd-spectral/) doi:10.1007/978-3-642-40988-2_19BibTeX
@inproceedings{recasens2013ecmlpkdd-spectral,
title = {{Spectral Learning of Sequence Taggers over Continuous Sequences}},
author = {Recasens, Adrià and Quattoni, Ariadna},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2013},
pages = {289-304},
doi = {10.1007/978-3-642-40988-2_19},
url = {https://mlanthology.org/ecmlpkdd/2013/recasens2013ecmlpkdd-spectral/}
}