Incremental embedding within a dissimilarity-based framework

DOI10.1007/978-3-319-18224-7_7MaRDI QIDQ3300151zbMATH OpenOpenAlexFDO

Authors Rachid Hafiane, Luc Brun, Salvatore Tabbone

Publication date 27 July 2020

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-319-18224-7_7

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Encoding dissimilarity data for statistical model building
• Dissimilarity data in statistical model building and machine learning
• A comparison of explicit and implicit graph embedding methods for pattern recognition
• Graph Embedding in Vector Spaces by Means of Prototype Selection
• Fuzzy multilevel graph embedding

Cites work

• 10.1162/15324430260185592
• Equality relating Euclidean distance cone to positive semidefinite cone
• Graph Embedding in Vector Spaces by Means of Prototype Selection
• Graph kernels based on tree patterns for molecules
• Support Vector Machines for Dyadic Data
• Two new graph kernels and applications to chemoinformatics

Cited in

(1)

• A novel data representation based on dissimilarity increments

This page was built for publication: Incremental embedding within a dissimilarity-based framework

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