![](bga.png)
win. 1991. Structure-Activity Relationship of Mu-
tagenic Aromatic and Heteroaromatic Nitro Com-
pounds. Correlation with Molecular Orbital Energies
and Hydrophobicity. Journal of Medicinal Chemistry,
34, 786–797.
Ga
¨
uz
`
ere, Benoit, Bougleux, S
´
ebastien, Riesen, Kaspar, and
Brun, Luc. 2014. Approximate Graph Edit Distance
Guided by Bipartite Matching of Bags of Walks. In
Proc. of International Workshop on Structural and
Syntactic Pattern Recognition (SSPR), 73–82.
Hart, Peter E., Nilsson, Nils J., and Raphael, Bertram. 1968.
A Formal Basis for the Heuristic Determination of
Minimum Cost Paths. Journal of IEEE Transaction
on Systems Science and Cybernetics, 4(2), 100–107.
Hido, Shohei and Kashima, Hisashi. 2009. A Linear-Time
Graph Kernel. In Proc. of International Conference
on Data Mining (ICDM), 179–188.
Kashima, Hisashi, Tsuda, Koji, and Inokuchi, Aki-
hiro. 2003. Marginalized Kernels Between Labeled
Graphs. In Proc. of International Conference on Ma-
chine Learning (ICML), 321–328.
Kataoka, Tetsuya and Inokuchi, Akihiro. 2016. Hadamard
Code Graph Kernels for Classifying Graphs. In Proc.
of International Conference on Pattern Recognition
Applications and Methods (ICPRAM), 24–32.
Kinable, Joris, and Kostakis, Orestis. 2011. Malware Clas-
sification based on Call Graph Clustering. Journal in
Computer Virology, 7(4), 233–245.
Koopmans, Tjalling C. and Beckmann, Martin. 1957. As-
signment Problems and the Location of Economic Ac-
tivities. Econometrica, 25(1), 53–76.
Riesen, Kaspar and Bunkle, Horst. 2009. Approximate
Graph Edit Distance Computation by Means of Bipar-
tite Graph Matching. Image Vision Computing, 27(7),
950–959.
Riesen, Kaspar. 2015. Structural Pattern Recognition with
Graph Edit Distance: Approximation Algorithms and
Applications. Advances in Computer Vision and Pat-
tern Recognition, Springer.
Robles-Kelly, Antonio, and Hancock, Edwin R. 2003. Edit
Distance From Graph Spectra. In Proc. of Interna-
tional Conference on Computer Vision (ICCV), 234–
241.
Schomburg, Ida, Chang, Antje, Ebeling, Christian, Gremse,
Marion, Heldt, Christian, Huhn, Gregor, and Schom-
burg, Dietmar. 2004. BRENDA, the Enzyme
Database: Updates and Major New Developments.
Nucleic Acids Research, 32D, 431–433.
Shervashidze, Nino, Schweitzer, Pascal, Jan van Leeuwen,
Erik, Mehlhorn, Kurt, and Borgwardt, Karsten M..
2011. Weisfeiler-Lehman Graph Kernels. Journal of
Machine Learning Research (JMLR), 2539–2561.
Wang, Peng, Eglin, V
´
eronique, Garcia, Christophe, Larg-
eron, Christine, Llad
´
os, Josep, and Forn
´
es, Alicia.
2014. A Coarse-to-Fine Word Spotting Approach for
Historical Handwritten Documents Based on Graph
Embedding and Graph Edit Distance. In Proc of Inter-
national Conference on Pattern Recognition (ICPR),
3074–3079.
Yan, Xifeng, Yu, Philip S., and Han, Jiawei. 2005 Substruc-
ture Similarity Search in Graph Databases. In Proc. of
the ACM SIGMOD International Conference on Man-
agement of Data (SIGMOD), 766–777.
Zeng, Zhiping, Tung, Anthony K. H. Tung, Wang, Jiany-
ong, Feng, Jianhua, and Zhou, Lizhu. 2009. Com-
paring Stars: On Approximating Graph Edit Distance.
In Proc. of International Conference on Very Large
Databases (PVLDB), 2(1), 25–36.
APPENDIX
The Label Aggregate Kernel (LAK) was designed to
measure the similarity between two graphs g
1
and g
2
to enable the application of a Support Vector Machine
(SVM). The kernel is defined as
k(g
1
,g
2
) =
h
∑
t=0
∑
v
i
∈V (g
1
)
∑
v
j
∈V (g
2
)
δ(`
`
`
(t)
L
(v
i
),`
`
`
(t)
L
(v
j
)),
where δ is the Kronecker delta. In contrast, in this pa-
per, LAK has been used to measure the approximate
graph edit distance corresponding to the dissimilarity
between two graphs g
1
and g
2
.
ICPRAM 2018 - 7th International Conference on Pattern Recognition Applications and Methods
26