A long trip in the charming world of graphs for pattern recognition
type: Item
instance of: scholarly article
title: A long trip in the charming world of graphs for pattern recognition
zbMATH Open document ID: 1373.68356
author: Mario Vento
published in: Pattern Recognition
publication date: 2017-11-10T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 6805423
zbMATH Keywords: graph clustering
zbMATH Keywords: graph embeddings
zbMATH Keywords: graph kernels
zbMATH Keywords: graph learning
zbMATH Keywords: graph matching
zbMATH Keywords: structural pattern recognition
MaRDI profile type: Publication
full work available at URL: j.patcog.2014.01.002
OpenAlex ID: W2064000859
cites work: A survey of graph edit distance
cites work: Recent advances in graph-based pattern recognition with applications in document analysis
cites work: A study of graph spectra for comparing graphs and trees
cites work: Assessing the Performance of a Graph-Based Clustering Algorithm
cites work: Learning structural shape descriptions from examples
cites work: Pattern classification.
cites work: Q3994472
cites work: Q4091421
cites work: Q4148000
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: An Algorithm for Subgraph Isomorphism
cites work: A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
cites work: Graph Optimal Monomorphism Algorithms
cites work: A large database of graphs and its use for benchmarking graph isomorphism algorithms
cites work: Constraint satisfaction algorithms for graph pattern matching
cites work: Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
cites work: Solving subgraph isomorphism problems with constraint programming
cites work: AllDifferent-based filtering for subgraph isomorphism
cites work: Q3671211
cites work: Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
cites work: Subgraph error-correcting isomorphisms for syntactic pattern recognition
cites work: An algorithm for graph optimal monomorphism
cites work: A distance measure between attributed relational graphs for pattern recognition
cites work: Q4808944
cites work: Q4218487
cites work: Q4536500
cites work: An eigendecomposition approach to weighted graph matching problems
cites work: Q4780826
cites work: Q4808936
cites work: Self-organizing map for clustering in the graph domain
cites work: Bridging the Gap between Graph Edit Distance and Kernel Machines
cites work: Graph kernels based on tree patterns for molecules
cites work: Spectral embedding of graphs.
cites work: Graph embedding using tree edit-union
cites work: Graph Embedding Using Quantum Commute Times
cites work: Graph Embedding in Vector Spaces by Means of Prototype Selection
DOI: 10.1016/J.PATCOG.2014.01.002
description: scientific article; zbMATH DE number 6805423