Graph embedding using tree edit-union
From MaRDI portal
Publication:869016
Recommendations
Cites work
- scientific article; zbMATH DE number 41243 (Why is no real title available?)
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 2043371 (Why is no real title available?)
- scientific article; zbMATH DE number 2043372 (Why is no real title available?)
- scientific article; zbMATH DE number 4119686 (Why is no real title available?)
- scientific article; zbMATH DE number 1844616 (Why is no real title available?)
- scientific article; zbMATH DE number 847265 (Why is no real title available?)
- Central clustering of attributed graphs
- First order Gaussian graphs for efficient structure classification
- Genetic operators for hierarchical graph clustering
- Image Segmentation by Dominant Sets
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning Bayesian networks: The combination of knowledge and statistical data
- On the editing distance between unordered labeled trees
- Principal component analysis.
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Spectral embedding of graphs.
- Structural, Syntactic, and Statistical Pattern Recognition
Cited in
(8)- A survey of graph edit distance
- scientific article; zbMATH DE number 2062653 (Why is no real title available?)
- scientific article; zbMATH DE number 2090204 (Why is no real title available?)
- A long trip in the charming world of graphs for pattern recognition
- Graph kernels from the Jensen-Shannon divergence
- Fuzzy multilevel graph embedding
- Computer Vision - ECCV 2004
- The graph matching problem
This page was built for publication: Graph embedding using tree edit-union
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869016)