Abstract
Graph kernels allow to define metrics on graph space and constitute thus an efficient tool to combine advantages of structural and statistical pattern recognition fields. Within the chemoinformatics framework, kernels are usually defined by comparing the number of occurences of patterns extracted from two different graphs. Such a graph kernel construction scheme neglects the fact that similar but not identical patterns may lead to close properties. We propose in this paper to overcome this drawback by defining our kernel as a weighted sum of comparisons between all couples of patterns. In addition, we propose an efficient computation of the optimal edit distance on a limited set of finite trees. This extension has been tested on two chemoinformatics problems.
Keywords
- Linear Pattern
- Edit Operation
- Statistical Pattern Recognition
- Graph Kernel
- Graph Edit Distance
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download conference paper PDF
References
Brun, L., Gaüzére, B., Fourey, S.: Relationships between graph edit distance and maximal common unlabeled subgraph. Technical report, CNRS UMR 6072 GREYC (2012), http://hal.archives-ouvertes.fr/hal-00714879
Bunke, H.: Error correcting graph matching: On the influence of the underlying cost function. IEEE Transactions on Pattern Analysis and Machine Intelligence 21(9), 917–922 (1999)
Fankhauser, S., Riesen, K., Bunke, H.: Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol. 6658, pp. 102–111. Springer, Heidelberg (2011)
Gaüzère, B., Brun, L., Villemin, D.: Two new graph kernels and applications to chemoinformatics. Pattern Recognition Lett. (in Press, 2012)
Haussler, D.: Convolution kernels on discrete structures. Technical report, Dept. of Computer Science, University of California at Santa Cruz (1999)
Kashima, H., Tsuda, K., Inokuchi, A.: Kernels for graphs, ch. 7, pp. 155–170. MIT Press (2004)
Mahé, P., Vert, J.-P.: Graph kernels based on tree patterns for molecules. Machine Learning 75(1), 3–35 (2009)
Neuhaus, M., Bunke, H.: Bridging the gap between graph edit distance and kernel machines. World Scientific Pub. Co. Inc. (2007)
Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Information Processing Letters 42(3), 133–139 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaüzère, B., Brun, L., Villemin, D. (2012). Graph Kernels: Crossing Information from Different Patterns Using Graph Edit Distance. In: Gimel’farb, G., et al. Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2012. Lecture Notes in Computer Science, vol 7626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34166-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-34166-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34165-6
Online ISBN: 978-3-642-34166-3
eBook Packages: Computer ScienceComputer Science (R0)
-
Published in cooperation with
http://www.iapr.org/
