2012/06/18 by Fabio Massimo Zanzotto, Zanzotto, Fabio Massimo, Lorenzo Dell’Arciprete +1
Computer Science · #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Music and Audio Processing #Natural Language Processing Techniques #Topic Modeling
paper · pdf · doi:10.48550/arxiv.1206.4607
openalex publication_date 2012/06/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.