A comparison of explicit and implicit graph embedding methods for pattern recognition

DOI10.1007/978-3-642-38221-5_9MaRDI QIDQ4922151zbMATH OpenOpenAlexFDO

Authors Donatello Conte, Jean-Yves Ramel, Nicolas Sidère, Muhammad Muzzamil Luqman, Benoit Gaüzère, Jaume Gibert, Luc Brun, Mario Vento

Publication date 28 May 2013

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-38221-5_9

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Fuzzy multilevel graph embedding
• On Whole-Graph Embedding Techniques
• Graph Embedding in Vector Spaces by Means of Prototype Selection
• Graph classification and clustering based on vector space embedding.
• Recent advances in graph-based pattern recognition with applications in document analysis

Cited in

(9)

• Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery
• Fuzzy multilevel graph embedding
• Discriminative prototype selection methods for graph embedding
• Incremental embedding within a dissimilarity-based framework
• An unsupervised framework for comparing graph embeddings
• A Scalable Unsupervised Framework for Comparing Graph Embeddings
• A nested alignment graph kernel through the dynamic time warping framework
• Real-valued embeddings and sketches for fast distance and similarity estimation
• Whole-graph embedding and adversarial attacks for life sciences

This page was built for publication: A comparison of explicit and implicit graph embedding methods for pattern recognition

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