Two new graph kernels and applications to chemoinformatics

  • Authors:
  • Benoit Gaüzère;Luc Brun;Didier Villemin

  • Affiliations:
  • GREYC UMR CNRS 6072, Caen, France;GREYC UMR CNRS 6072, Caen, France;LCMT UMR CNRS 6507, Caen, France

  • Venue:
  • GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Chemoinformatics is a well established research field concerned with the discovery of molecule's properties through informational techniques. Computer science's research fields mainly concerned by the chemoinformatics field are machine learning and graph theory. From this point of view, graph kernels provide a nice framework combining machine learning techniques with graph theory. Such kernels prove their efficiency on several chemoinformatics problems. This paper presents two new graph kernels applied to regression and classification problems within the chemoinformatics field. The first kernel is based on the notion of edit distance while the second is based on sub trees enumeration. Several experiments show the complementary of both approaches.