Fisher Kernels for Relational Data

  • Uwe Dick
  • Kristian Kersting
Conference paper

DOI: 10.1007/11871842_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4212)
Cite this paper as:
Dick U., Kersting K. (2006) Fisher Kernels for Relational Data. In: Fürnkranz J., Scheffer T., Spiliopoulou M. (eds) Machine Learning: ECML 2006. ECML 2006. Lecture Notes in Computer Science, vol 4212. Springer, Berlin, Heidelberg

Abstract

Combining statistical and relational learning receives currently a lot of attention. The majority of statistical relational learning approaches focus on density estimation. For classification, however, it is well-known that the performance of such generative models is often lower than that of discriminative classifiers. One approach to improve the performance of generative models is to combine them with discriminative algorithms. Fisher kernels were developed to combine them with kernel methods, and have shown promising results for the combinations of support vector machines with (logical) hidden Markov models and Bayesian networks. So far, however, Fisher kernels have not been considered for relational data, i.e., data consisting of a collection of objects and relational among these objects. In this paper, we develop Fisher kernels for relational data and empirically show that they can significantly improve over the results achieved without Fisher kernels.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Uwe Dick
    • 1
  • Kristian Kersting
    • 1
  1. 1.Institute for Computer Science, Machine Learning LabUniversity of FreiburgFreiburgGermany

Personalised recommendations