Multi-View Discriminative Sequential Learning

Abstract

Discriminative learning techniques for sequential data have proven to be more effective than generative models for named entity recognition, information extraction, and other tasks of discrimination. However, semi-supervised learning mechanisms that utilize inexpensive unlabeled sequences in addition to few labeled sequences – such as the Baum-Welch algorithm – are available only for generative models. The multi-view approach is based on the principle of maximizing the consensus among multiple independent hypotheses; we develop this principle into a semi-supervised hidden Markov perceptron, and a semi-supervised hidden Markov support vector learning algorithm. Experiments reveal that the resulting procedures utilize unlabeled data effectively and discriminate more accurately than their purely supervised counterparts.

Cite

Text

Brefeld et al. "Multi-View Discriminative Sequential Learning." European Conference on Machine Learning, 2005. doi:10.1007/11564096_11

Markdown

[Brefeld et al. "Multi-View Discriminative Sequential Learning." European Conference on Machine Learning, 2005.](https://mlanthology.org/ecmlpkdd/2005/brefeld2005ecml-multiview/) doi:10.1007/11564096_11

BibTeX

@inproceedings{brefeld2005ecml-multiview,
  title     = {{Multi-View Discriminative Sequential Learning}},
  author    = {Brefeld, Ulf and Büscher, Christoph and Scheffer, Tobias},
  booktitle = {European Conference on Machine Learning},
  year      = {2005},
  pages     = {60-71},
  doi       = {10.1007/11564096_11},
  url       = {https://mlanthology.org/ecmlpkdd/2005/brefeld2005ecml-multiview/}
}