Feature discovery in non-metric pairwise data
From MaRDI portal
Recommendations
- On the information and representation of non-Euclidean pairwise data
- Structure preserving embedding of dissimilarity data
- Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
- Indefinite proximity learning: a review
- The Metric Nearness Problem
Cited in
(11)- Visualizing non-metric similarities in multiple maps
- Ricci flow embedding for rectifying non-Euclidean dissimilarity data
- On the information and representation of non-Euclidean pairwise data
- Densifying distance spaces for shape and image retrieval
- h‐plots for displaying nonmetric dissimilarity matrices
- Convexification with bounded gap for randomly projected quadratic optimization
- Robust common spatial filters with a maxmin approach
- A method for visual identification of small sample subgroups and potential biomarkers
- Semi-supervised information-maximization clustering
- Similarity, kernels, and the triangle inequality
- Dealing with non-metric dissimilarities in fuzzy central clustering algorithms
This page was built for publication: Feature discovery in non-metric pairwise data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093203)
