The graph matching problem
From MaRDI portal
Publication:2444585
DOI10.1007/s10044-012-0284-8zbMath1284.68470OpenAlexW2003627696WikidataQ57921782 ScholiaQ57921782MaRDI QIDQ2444585
Publication date: 10 April 2014
Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10044-012-0284-8
graph embeddinggraph edit distancegraph kernelsinexact graph matchinggraph-based pattern recognition
Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Neural software vulnerability analysis using rich intermediate graph representations of programs, Parameter specification for the degree distribution of simulated Barabási-Albert graphs, Correlated randomly growing graphs, On the geometry of graph spaces, Connectedness of graphs and its application to connected matroids through covering-based rough sets, Efficient random graph matching via degree profiles, Nonparametric statistics of dynamic networks with distinguishable nodes, Statistical graph space analysis, Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis, A new measure for the attitude to mobility of Italian students and graduates: a topological data analysis approach, Testing correlation of unlabeled random graphs, Estimation of Monge matrices, Graph ambiguity, Modeling the Uncertainty of a Set of Graphs Using Higher-Order Fuzzy Sets, On the maximum edge-pair embedding bipartite matching, Maximum bipartite matchings with low rank data: locality and perturbation analysis, Inexact graph matching using a hierarchy of matching processes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A survey on tree edit distance and related problems
- Central clustering of attributed graphs
- A survey of graph edit distance
- A unified approach to pattern recognition
- A Riemannian approach to graph embedding
- Automatic learning of cost functions for graph edit distance
- Graph embedding using tree edit-union
- Learning probabilistic models of tree edit distance
- Image categorization: Graph edit distance \(+\) edge direction histogram
- Complete mining of frequent patterns from graphs: Mining graph data
- Scale-based approach to hierarchical fuzzy clustering.
- Principal component analysis.
- Support-vector networks
- Managing and mining graph data
- Complex networks: structure and dynamics
- Theoretical foundations of the potential function method in pattern recognition learning
- A note on the derivation of maximal common subgraphs of two directed or undirected graphs
- Modern multidimensional scaling. Theory and applications.
- Nonmetric multidimensional scaling. A numerical method
- Dimensionality Reduction for Graph of Words Embedding
- Maximum Likelihood for Gaussians on Graphs
- Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching
- A graph distance measure for image analysis
- Algorithms for the Assignment and Transportation Problems
- The Dissimilarity Representation for Pattern Recognition
- Mining Graph Data
- Modern Multivariate Statistical Techniques
- Kernels for Structured Data
- Graph Classification and Clustering Based on Vector Space Embedding
- Characteristic Polynomial Analysis on Matrix Representations of Graphs
- A universal interconnection pattern for parallel computers
- Dynamic programming algorithm optimization for spoken word recognition
- A graph distance metric based on the maximal common subgraph
- Inexact graph matching for structural pattern recognition
- A distance measure between attributed relational graphs for pattern recognition
- Kron Reduction of Graphs With Applications to Electrical Networks
- Learning Theory and Kernel Machines
- Learning Theory and Kernel Machines
- A Quadratic Programming Approach to the Graph Edit Distance Problem
- Graph Embedding Using Quantum Commute Times
- Parallelism in random access machines
- Graph-Theoretic Techniques for Web Content Mining
- Fuzzy sets
- Bridging the Gap between Graph Edit Distance and Kernel Machines
- On Information and Sufficiency
- Self-organizing maps.
