A binary linear programming formulation of the graph edit distance

A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. A general formulation for editing graphs is used to derive a graph edit distance that is proven to be a metric, provided...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on pattern analysis and machine intelligence Jg. 28; H. 8; S. 1200 - 1214
Hauptverfasser:	Justice, D., Hero, A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Los Alamitos, CA IEEE 01.08.2006 IEEE Computer Society The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Applied sciences Artificial Intelligence Chemicals Computer Graphics Computer science; control theory; systems continuation (homotopy) methods Cost function Exact sciences and technology Fingerprint recognition Formulations Graph algorithms Graphs graphs and networks Image Enhancement - methods Image Interpretation, Computer-Assisted - methods Information Storage and Retrieval - methods Information systems Linear programming Machine vision Mathematical models Operations research Pattern Recognition, Automated - methods Pattern recognition. Digital image processing. Computational geometry Polynomials Product development Programming, Linear Prototypes Recognition similarity measures Standards development structural pattern recognition Studies structural pattern recognition Similarity Information system Assignment problem String matching Linear programming Graph theory Pattern recognition Continuation method similarity measures Homotopy Chemical databasis Graph algorithms continuation (homotopy) methods Pattern analysis graphs and networks Non directed graph
ISSN:	0162-8828, 2160-9292, 1939-3539
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!