Skip to main content

Optimising the Volgenant-Jonker Algorithm for Approximating Graph Edit Distance

Jones, William, Chawdhary, Aziem, King, Andy (2016) Optimising the Volgenant-Jonker Algorithm for Approximating Graph Edit Distance. Pattern Recognition Letters, . pp. 1-9. ISSN 0167-8655. (doi:10.1016/j.patrec.2016.07.024)

PDF - Author's Accepted Manuscript
Download (294kB) Preview
[img]
Preview
Official URL
http://dx.doi.org/10.1016/j.patrec.2016.07.024

Abstract

Although it is agreed that the Volgenant-Jonker (VJ) algorithm provides a fast way to approximate graph edit distance (GED), until now nobody has reported how the VJ algorithm can be tuned for this task. To this end, we revisit VJ and propose a series of refinements that improve both the speed and memory footprint without sacrificing accuracy in the GED approximation. We quantify the effectiveness of these optimisations by measuring distortion between control-flow graphs: a problem that arises in malware matching. We also document an unexpected behavioural property of VJ in which the time required to find shortest paths to unassigned vertices decreases as graph size increases, and explain how this phenomenon relates to the birthday paradox.

Item Type: Article
DOI/Identification number: 10.1016/j.patrec.2016.07.024
Subjects: Q Science
Q Science > QA Mathematics (inc Computing science)
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 08 Aug 2016 14:33 UTC
Last Modified: 29 May 2019 17:41 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/56765 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year