Non-Euclidean Dissimilarities: Causes, Embedding and Informativeness
From MaRDI portal
Publication:5253998
DOI10.1007/978-1-4471-5628-4_2zbMath1314.68267OpenAlexW65248374MaRDI QIDQ5253998
Elżbieta Pȩkalska, Marco Loog, Robert P. W. Duin
Publication date: 8 June 2015
Published in: Similarity-Based Pattern Analysis and Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4471-5628-4_2
Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
Ricci flow embedding for rectifying non-Euclidean dissimilarity data ⋮ Indefinite Proximity Learning: A Review
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearest neighbour group-based classification
- Metric and Euclidean properties of dissimilarity coefficients
- Solving the multiple instance problem with axis-parallel rectangles.
- Support-vector networks
- Prototype selection for dissimilarity-based classifiers
- 10.1162/15324430260185592
- The Dissimilarity Representation for Pattern Recognition
- A graph distance metric based on the maximal common subgraph
- Dissimilarity representations allow for building good classifiers
This page was built for publication: Non-Euclidean Dissimilarities: Causes, Embedding and Informativeness
