Graph embedding using tree edit-union

DOI10.1016/j.patcog.2006.09.006zbMath1112.68114OpenAlexW2143213386WikidataQ60431198 ScholiaQ60431198MaRDI QIDQ869016

Edwin R. Hancock, Andrea Torsello

Publication date: 26 February 2007

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

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

zbMATH Keywords

embeddingskeleton2D shapetree-union

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items

A long trip in the charming world of graphs for pattern recognition ⋮ Graph kernels from the Jensen-Shannon divergence ⋮ The graph matching problem ⋮ Fuzzy multilevel graph embedding ⋮ A survey of graph edit distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Central clustering of attributed graphs
• On the editing distance between unordered labeled trees
• First order Gaussian graphs for efficient structure classification
• Spectral embedding of graphs.
• Principal component analysis.
• Learning Bayesian networks: The combination of knowledge and statistical data
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Image Segmentation by Dominant Sets
• Genetic operators for hierarchical graph clustering
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Structural, Syntactic, and Statistical Pattern Recognition