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

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

Kaspar Riesen, Horst Bunke, M. Ferrer, E. Valveny, 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 spaces; graph matching; graph embedding; median graph; weighted mean of graphs

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68T10: Pattern recognition, speech recognition

Related Items

Graph kernels from the Jensen-Shannon divergence, Ensemble clustering by means of clustering embedding in vector spaces, Fuzzy multilevel graph embedding, A Recursive Embedding Approach to Median Graph Computation

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