FHNW Fachhochschule Nordwestschweiz
  • Startseite
  • Publikationen
  • Projekte
  • Studentische Arbeiten
  • de
  •  Login
Eintraganzeige 
  •   IRF Home
  • Hochschule für Wirtschaft
  • Institut für Wirtschaftsinformatik
  • Eintraganzeige
  • Hochschule für Wirtschaft
  • Institut für Wirtschaftsinformatik
  • Eintraganzeige
JavaScript is disabled for your browser. Some features of this site may not work without it.

Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation

Datum
2014
Autorin/Autor
Riesen, Kaspar
Fischer, Andreas
Bunke, Horst
Metadata
Zur Langanzeige
Type
04 - Beitrag Sammelband oder Konferenzschrift
Primary target group
Science
Created while belonging to FHNW?
Yes
Zusammenfassung
Graph edit distance (GED) is a powerful and flexible graph dissimilarity model. Yet, exact computation of GED is an instance of a quadratic assignment problem and can thus be solved in exponential time complexity only. A previously introduced approximation framework reduces the computation of GED to an instance of a linear sum assignment problem. Major benefit of this reduction is that an optimal assignment of nodes (including local structures) can be computed in polynomial time. Given this assignment an approximate value of GED can be immediately derived. Yet, the primary optimization process of this approximation framework is able to consider local edge structures only, and thus, the observed speed up is at the expense of approximative, rather than exact, distance values. In order to improve the overall approximation quality, the present paper combines the original approximation framework with a fast tree search procedure. More precisely, we regard the assignment from the original approximation as a starting point for a subsequent beam search. In an experimental evaluation on three real world data sets a substantial gain of assignment accuracy can be observed while the run time remains remarkable low.
URI
http://hdl.handle.net/11654/8221

Stöbern

Gesamter BestandBereiche & SammlungenErscheinungsdatumAutoren/AutorinnenTitelThemenDiese SammlungErscheinungsdatumAutoren/AutorinnenTitelThemen

Mein Benutzerkonto

EinloggenRegistrieren

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors

Kontakt

Fachhochschule Nordwestschweiz FHNW
Vizepräsidium Hochschulentwicklung
Bahnhofstrasse 6
5210 Windisch

E-Mail: irf@fhnw.ch

Über das IRF

Das IRF ist das digitale Repositorium der Fachhochschule Nordwestschweiz FHNW. Es enthält Publikationen, studentische Arbeiten und Projekte.

Links

Liste der IRF Power User
Feedbackformular

www.fhnw.ch | Impressum | Datenschutz | Urheberrecht