The algebraic degree of geometric optimization problems
Discrete & Computational Geometry
Topology of strings: median string is NP-complete
Theoretical Computer Science
Pattern Recognition Letters - Special issue on pattern recognition in practice VI
On Median Graphs: Properties, Algorithms, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Weighted mean of a pair of graphs
Computing
Algorithmic Applications of Low-Distortion Geometric Embeddings
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Levenshtein Distance for Graph Spectral Features
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Pattern Vectors from Algebraic Graph Theory
IEEE Transactions on Pattern Analysis and Machine Intelligence
Median graph computation for graph clustering
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Object Recognition as Many-to-Many Feature Matching
International Journal of Computer Vision
A Binary Linear Programming Formulation of the Graph Edit Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mixing spectral representations of graphs
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 04
The Dissimilarity Representation for Pattern Recognition: Foundations And Applications (Machine Perception and Artificial Intelligence)
A Riemannian approach to graph embedding
Pattern Recognition
Prototype selection for dissimilarity-based classifiers
Pattern Recognition
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Median graph: A new exact algorithm using a distance based on the maximum common subgraph
Pattern Recognition Letters
Skeletal Shape Abstraction from Examples
IEEE Transactions on Pattern Analysis and Machine Intelligence
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing
A Recursive Embedding Approach to Median Graph Computation
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Graph-Based k-Means Clustering: A Comparison of the Set Median versus the Generalized Median Graph
CAIP '09 Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns
Graph Classification and Clustering Based on Vector Space Embedding
Graph Classification and Clustering Based on Vector Space Embedding
Fast suboptimal algorithms for the computation of graph edit distance
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Synthesis of median spectral graph
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Inexact graph matching for structural pattern recognition
Pattern Recognition Letters
Pattern analysis with graphs: Parallel work at Bern and York
Pattern Recognition Letters
Generalized median string computation by means of string embedding in vector spaces
Pattern Recognition Letters
Hypergraph-based image retrieval for graph-based representation
Pattern Recognition
Ensemble clustering by means of clustering embedding in vector spaces
Pattern Recognition
Hi-index | 0.00 |
The median graph has been shown to be a good choice to obtain a representative of a set of graphs. However, its computation is a complex problem. Recently, graph embedding into vector spaces has been proposed to obtain approximations of the median graph. The problem with such an approach is how to go from a point in the vector space back to a graph in the graph space. The main contribution of this paper is the generalization of this previous method, proposing a generic recursive procedure that permits to recover the graph corresponding to a point in the vector space, introducing only the amount of approximation inherent to the use of graph matching algorithms. In order to evaluate the proposed method, we compare it with the set median and with the other state-of-the-art embedding-based methods for the median graph computation. The experiments are carried out using four different databases (one semi-artificial and three containing real-world data). Results show that with the proposed approach we can obtain better medians, in terms of the sum of distances to the training graphs, than with the previous existing methods.