Linear online learning over structured data with distributed tree kernels

Simone Filice, Danilo Croce, Roberto Basili, Fabio Massimo Zanzotto

Research output: Contribution to conferencePaper

3 Citations (Scopus)

Abstract

Online algorithms are an important class of learning machines as they are extremely simple and computationally efficient. Kernel methods versions can handle structured data, such as trees, and achieve state-of-the-art performance. However kernelized versions of Online Learning algorithms slow down when the number of support vectors becomes large. The traditional way to cope with this problem is introducing budgets that set the maximum number of support vectors. In this paper, we investigate Distributed Trees (DT) as an efficient way to use structured data in online learning. DTs effectively embed the huge feature space of the tree fragments into small vectors, so enabling the use of linear versions of kernel machines over tree structured data. We experiment with the Passive-Aggressive (PA) algorithm by comparing the linear and the kernelized version. A massive dataset made with tree structured data is employed: it is originated from a natural language processing task, the Boundary Detection in the context of Semantic Role Labeling over Frame Net. Results on a sample of the final data show that the DTs along with the Linear PA algorithm and the Tree Kernel along with the Bundgeted PA achieve comparable results in terms of f1-measure. Finally, the exploration of the full dataset allows the former to improve the performance on the classification task, with respect to the latter.

Original languageEnglish
Pages123-128
Number of pages6
DOIs
Publication statusPublished - 1 Jan 2013
Event2013 12th International Conference on Machine Learning and Applications, ICMLA 2013 - Miami, FL, United States
Duration: 4 Dec 20137 Dec 2013

Other

Other2013 12th International Conference on Machine Learning and Applications, ICMLA 2013
CountryUnited States
CityMiami, FL
Period4/12/137/12/13

Keywords

  • Distributed Trees
  • Online Learning
  • Tree Kernels

ASJC Scopus subject areas

  • Computer Science Applications
  • Human-Computer Interaction

Fingerprint Dive into the research topics of 'Linear online learning over structured data with distributed tree kernels'. Together they form a unique fingerprint.

  • Cite this

    Filice, S., Croce, D., Basili, R., & Zanzotto, F. M. (2013). Linear online learning over structured data with distributed tree kernels. 123-128. Paper presented at 2013 12th International Conference on Machine Learning and Applications, ICMLA 2013, Miami, FL, United States. https://doi.org/10.1109/ICMLA.2013.28