A long trip in the charming world of graphs for pattern recognition
From MaRDI portal
Publication:1677050
DOI10.1016/j.patcog.2014.01.002zbMath1373.68356OpenAlexW2064000859MaRDI QIDQ1677050
Publication date: 10 November 2017
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2014.01.002
graph matchinggraph embeddingsgraph clusteringgraph kernelsgraph learningstructural pattern recognition
Applications of graph theory (05C90) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items
Heuristics for the generalized median graph problem, Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound Strategy, An Edit Distance Between Graph Correspondences, Preface of special issue on ``Graph-based processing for pattern recognition, Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving subgraph isomorphism problems with constraint programming
- Recent advances in graph-based pattern recognition with applications in document analysis
- A survey of graph edit distance
- Graph embedding using tree edit-union
- A study of graph spectra for comparing graphs and trees
- AllDifferent-based filtering for subgraph isomorphism
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Spectral embedding of graphs.
- Graph kernels based on tree patterns for molecules
- An algorithm for graph optimal monomorphism
- An eigendecomposition approach to weighted graph matching problems
- Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
- Graph Optimal Monomorphism Algorithms
- Subgraph error-correcting isomorphisms for syntactic pattern recognition
- An Algorithm for Subgraph Isomorphism
- A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
- A large database of graphs and its use for benchmarking graph isomorphism algorithms
- Self-organizing map for clustering in the graph domain
- A distance measure between attributed relational graphs for pattern recognition
- Learning structural shape descriptions from examples
- Constraint satisfaction algorithms for graph pattern matching
- Assessing the Performance of a Graph-Based Clustering Algorithm
- Graph Embedding Using Quantum Commute Times
- Graph Embedding in Vector Spaces by Means of Prototype Selection
- Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
- Bridging the Gap between Graph Edit Distance and Kernel Machines
