Distributed Tree Kernels
Abstract
In this paper, we propose the distributed tree kernels (DTK) as a novel method to reduce time and space complexity of tree kernels. Using a linear complexity algorithm to compute vectors for trees, we embed feature spaces of tree fragments in low-dimensional spaces where the kernel computation is directly done with dot product. We show that DTKs are faster, correlate with tree kernels, and obtain a statistically similar performance in two natural language processing tasks.
Cite
Text
Zanzotto and Dell'Arciprete. "Distributed Tree Kernels." International Conference on Machine Learning, 2012.Markdown
[Zanzotto and Dell'Arciprete. "Distributed Tree Kernels." International Conference on Machine Learning, 2012.](https://mlanthology.org/icml/2012/zanzotto2012icml-distributed/)BibTeX
@inproceedings{zanzotto2012icml-distributed,
title = {{Distributed Tree Kernels}},
author = {Zanzotto, Fabio Massimo and Dell'Arciprete, Lorenzo},
booktitle = {International Conference on Machine Learning},
year = {2012},
url = {https://mlanthology.org/icml/2012/zanzotto2012icml-distributed/}
}