Kernel-Based Discriminative Learning Algorithms for Labeling Sequences, Trees, and Graphs
Abstract
We introduce a new perceptron-based discriminative learning algorithm forlabeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses pointwise label prediction, large features, including arbitrary number of hidden variables, can beincorporated with polynomial time complexity. This is in contrast to existing labelers that can handle only features of asmall number of hidden variables, such as Maximum Entropy Markov Models and Conditional Random Fields. We also introduce several kernel functions for labeling sequences, trees andgraphs and efficient algorithms for them.
Cite
Text
Kashima and Tsuboi. "Kernel-Based Discriminative Learning Algorithms for Labeling Sequences, Trees, and Graphs." International Conference on Machine Learning, 2004. doi:10.1145/1015330.1015383Markdown
[Kashima and Tsuboi. "Kernel-Based Discriminative Learning Algorithms for Labeling Sequences, Trees, and Graphs." International Conference on Machine Learning, 2004.](https://mlanthology.org/icml/2004/kashima2004icml-kernel/) doi:10.1145/1015330.1015383BibTeX
@inproceedings{kashima2004icml-kernel,
title = {{Kernel-Based Discriminative Learning Algorithms for Labeling Sequences, Trees, and Graphs}},
author = {Kashima, Hisashi and Tsuboi, Yuta},
booktitle = {International Conference on Machine Learning},
year = {2004},
doi = {10.1145/1015330.1015383},
url = {https://mlanthology.org/icml/2004/kashima2004icml-kernel/}
}