Graph Embedding in Vector Spaces by Means of Prototype Selection

DOI10.1007/978-3-540-72903-7_35zbMath1182.68206OpenAlexW2152668649MaRDI QIDQ5325758

Kaspar Riesen, Michel Neuhaus, Horst Bunke

Publication date: 24 July 2009

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72903-7_35

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items (8)

A new protein graph model for function prediction ⋮ A long trip in the charming world of graphs for pattern recognition ⋮ Incremental Embedding Within a Dissimilarity-Based Framework ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ Generalized median graph computation by means of graph embedding in vector spaces ⋮ Spectral graph features for the classification of graphs and graph sequences ⋮ Efficient temporal pattern recognition by means of dissimilarity space embedding with discriminative prototypes ⋮ A Recursive Embedding Approach to Median Graph Computation

This page was built for publication: Graph Embedding in Vector Spaces by Means of Prototype Selection