Improving bipartite graph edit distance approximation using various search strategies

DOI10.1016/j.patcog.2014.11.002zbMath1374.68473OpenAlexW2027340372MaRDI QIDQ1678686

Kaspar Riesen, Horst Bunke

Publication date: 20 November 2017

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2014.11.002

zbMATH Keywords

approximate graph edit distancebipartite graph matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Distance in graphs (05C12) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Improved Graph Edit Distance Approximation with Simulated Annealing ⋮ Improving bipartite graph edit distance approximation using various search strategies

Uses Software

• CLUSTISZ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of graph edit distance
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Measures of association for cross classifications
• Improving bipartite graph edit distance approximation using various search strategies
• Structural pattern recognition using genetic algorithms
• The Dissimilarity Representation for Pattern Recognition
• Assignment Problems
• On the simplex algorithm for networks and generalized networks
• The Scaling Network Simplex Algorithm
• Well-Separated Clusters and Optimal Fuzzy Partitions
• QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
• Cost operator algorithms for the transportation problem
• Inexact graph matching for structural pattern recognition
• A distance measure between attributed relational graphs for pattern recognition
• A One Hour Trip in the World of Graphs, Looking at the Papers of the Last Ten Years
• Active-Learning Query Strategies Applied to Select a Graph Node Given a Graph Labelling
• Graph-Based Representations in Pattern Recognition
• Structural, Syntactic, and Statistical Pattern Recognition
• Bridging the Gap between Graph Edit Distance and Kernel Machines

This page was built for publication: Improving bipartite graph edit distance approximation using various search strategies