Improving Graph Classification by Isomap

DOI10.1007/978-3-642-02124-4_21MaRDI QIDQ3637702zbMATH OpenOpenAlexFDO

Authors Kaspar Riesen, Volkmar Frinken, Horst Bunke

Publication date 14 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-642-02124-4_21

Mathematics Subject Classification ID

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

Recommendations

• Robust kernel Isomap
• scientific article; zbMATH DE number 1975571
• Bridging the Gap between Graph Edit Distance and Kernel Machines
• Multi-manifold discriminant Isomap for visualization and classification
• A more topologically stable ISOMAP algorithm

Cites work

• A note on two problems in connexion with graphs
• Bipartite Graph Matching for Computing the Edit Distance of Graphs
• Bridging the Gap between Graph Edit Distance and Kernel Machines
• scientific article; zbMATH DE number 4004880 (Why is no real title available?)
• Inexact graph matching for structural pattern recognition
• Kernels for Structured Data

Cited in

(2)

• A more topologically stable ISOMAP algorithm
• Robust kernel Isomap

This page was built for publication: Improving Graph Classification by Isomap

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637702)