Spectral graph features for the classification of graphs and graph sequences
DOI10.1007/s00180-012-0381-6zbMath1306.65131OpenAlexW2083895176MaRDI QIDQ2259697
Miriam Schmidt, Friedhelm Schwenker, Günther Palm
Publication date: 5 March 2015
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00180-012-0381-6
spectrumoptical character recognitionhuman activity recognitiongraph classificationgraph-associated matrices
Computational methods for problems pertaining to statistics (62-08) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of graphs
- Spectral embedding of graphs.
- An eigendecomposition approach to weighted graph matching problems
- Hidden Markov Models for Speech Recognition
- A graph distance metric based on the maximal common subgraph
- Biological Sequence Analysis
- Finite mixture models
- Inexact graph matching for structural pattern recognition
- A distance measure between attributed relational graphs for pattern recognition
- Bipartite Graph Matching for Computing the Edit Distance of Graphs
- Graph Embedding in Vector Spaces by Means of Prototype Selection
This page was built for publication: Spectral graph features for the classification of graphs and graph sequences