Back to Search
Start Over
A Random Walk Kernel Derived from Graph Edit Distance.
- Source :
- Structural, Syntactic & Statistical Pattern Recognition; 2006, p191-199, 9p
- Publication Year :
- 2006
-
Abstract
- Random walk kernels in conjunction with Support Vector Machines are powerful methods for error-tolerant graph matching. Because of their local definition, however, the applicability of random walk kernels strongly depends on the characteristics of the underlying graph representation. In this paper, we describe a simple extension to the standard random walk kernel based on graph edit distance. The idea is to include global matching information in the local similarity evaluation of random walks in graphs. The proposed extension allows us to improve the performance of the random walk kernel significantly. We present an experimental evaluation of our method on three difficult graph datasets. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783540372363
- Database :
- Complementary Index
- Journal :
- Structural, Syntactic & Statistical Pattern Recognition
- Publication Type :
- Book
- Accession number :
- 32910318
- Full Text :
- https://doi.org/10.1007/11815921_20