Generalized median graph computation by means of graph embedding in vector spaces

DOI10.1016/j.patcog.2009.10.013zbMath1191.68569OpenAlexW1970615687MaRDI QIDQ962746

E. Valveny, M. Ferrer, Horst Bunke, Kaspar Riesen, Francesc Serratosa

Publication date: 7 April 2010

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

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

zbMATH Keywords

vector spacesgraph matchinggraph embeddingmedian graphweighted mean of graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items

Graph characterization by counting sink star subgraphs, Heuristics for the generalized median graph problem, An Edit Distance Between Graph Correspondences, Graph kernels from the Jensen-Shannon divergence, Statistical graph space analysis, Ensemble clustering by means of clustering embedding in vector spaces, An average-compress algorithm for the sample mean problem under dynamic time warping, Fuzzy multilevel graph embedding, A Recursive Embedding Approach to Median Graph Computation, The Fréchet mean of inhomogeneous random graphs

Cites Work

• A Riemannian approach to graph embedding
• The algebraic degree of geometric optimization problems
• Spectral embedding of graphs.
• Topology of strings: median string is NP-complete
• Prototype selection for dissimilarity-based classifiers
• Introduction to Pattern Recognition
• Inexact graph matching for structural pattern recognition
• A distance measure between attributed relational graphs for pattern recognition
• Graph Embedding in Vector Spaces by Means of Prototype Selection
• Graph-Theoretic Techniques for Web Content Mining
• Structural, Syntactic, and Statistical Pattern Recognition
• Weighted mean of a pair of graphs