A tree-based kernel for graphs

Giovanni Da San Martino, Nicolò Navarin, Alessandro Sperduti

Research output: Chapter in Book/Report/Conference proceedingConference contribution

29 Citations (Scopus)

Abstract

This paper proposes a new tree-based kernel for graphs. Graphs are decomposed into multisets of ordered Directed Acyclic Graphs (DAGs) and a family of kernels computed by application of tree kernels extended to the DAG domain. We focus our attention on the efficient development of one member of this family. A technique for speeding up the computation is given, as well as theoretical bounds and practical evidence of its feasibility. State of the art results on various benchmark datasets prove the effectiveness of our approach.

Original languageEnglish
Title of host publicationProceedings of the 12th SIAM International Conference on Data Mining, SDM 2012
Pages975-986
Number of pages12
Publication statusPublished - 1 Dec 2012
Event12th SIAM International Conference on Data Mining, SDM 2012 - Anaheim, CA, United States
Duration: 26 Apr 201228 Apr 2012

Publication series

NameProceedings of the 12th SIAM International Conference on Data Mining, SDM 2012

Conference

Conference12th SIAM International Conference on Data Mining, SDM 2012
CountryUnited States
CityAnaheim, CA
Period26/4/1228/4/12

ASJC Scopus subject areas

  • Computer Science Applications

Cite this

Da San Martino, G., Navarin, N., & Sperduti, A. (2012). A tree-based kernel for graphs. In Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012 (pp. 975-986). (Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012).