@Article{PRL2012,


author = {Benoit Gaüzère and Luc Brun and Didier Villemin},
title = {Two new graphs kernels in chemoinformatics},
journal = {Pattern Recognition Letters},
year = 2012,
issn = "0167-8655",
doi = "10.1016/j.patrec.2012.03.020",
url = "ScienceDirect:=http://www.sciencedirect.com/science/article/pii/S016786551200102X, HAL := http://hal.archives-ouvertes.fr/hal-00773283",
keywords = "Chemoinformatics",
keywords = "Graph kernel",
keywords = "Machine learning",
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 chemoinformatics are machine
learning and graph theory. From this point of view,
graph kernels provide a nice framework combining
machine learning and graph theory techniques. Such
kernels prove their efficiency on several
chemoinformatics problems and this paper presents
two new graph kernels applied to regression and
classification problems. The first kernel is based
on the notion of edit distance while the second is
based on subtrees enumeration. The design of this
last kernel is based on a variable selection step in
order to obtain kernels defined on parsimonious sets
of patterns. Performances of both kernels are
investigated through experiments.",
theme="pattern,chemo",
volume=33,
number=15,
pages={2038-2047}

 }