Generalized median graph computation by means of graph embedding in vector spaces
From MaRDI portal
Recommendations
Cites work
- A distance measure between attributed relational graphs for pattern recognition
- A Riemannian approach to graph embedding
- Graph Embedding in Vector Spaces by Means of Prototype Selection
- Graph-Theoretic Techniques for Web Content Mining
- Inexact graph matching for structural pattern recognition
- Introduction to Pattern Recognition
- Prototype selection for dissimilarity-based classifiers
- Spectral embedding of graphs.
- Structural, Syntactic, and Statistical Pattern Recognition
- The algebraic degree of geometric optimization problems
- Topology of strings: median string is NP-complete
- Weighted mean of a pair of graphs
Cited in
(15)- Fuzzy multilevel graph embedding
- The Fréchet mean of inhomogeneous random graphs
- Median graphs: A genetic approach based on new theoretical properties
- Generalized median graphs and applications
- Graph characterization by counting sink star subgraphs
- Statistical graph space analysis
- Heuristics for the generalized median graph problem
- A Recursive Embedding Approach to Median Graph Computation
- Graph kernels from the Jensen-Shannon divergence
- scientific article; zbMATH DE number 2043370 (Why is no real title available?)
- An edit distance between graph correspondences
- On the Relation Between the Median and the Maximum Common Subgraph of a Set of Graphs
- An average-compress algorithm for the sample mean problem under dynamic time warping
- Ensemble clustering by means of clustering embedding in vector spaces
- Embedding graphs as isometric medians
This page was built for publication: Generalized median graph computation by means of graph embedding in vector spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962746)