A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern Recognition
DOI10.1007/978-3-642-38221-5_9zbMath1382.68206OpenAlexW81602814MaRDI QIDQ4922151
Nicolas Sidère, Donatello Conte, Luc Brun, Muhammad Muzzamil Luqman, Mario Vento, Jean-Yves Ramel, Benoit Gaüzère, Jaume Gibert
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
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
This page was built for publication: A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern Recognition