Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data (Q975219)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data |
scientific article; zbMATH DE number 5718258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data |
scientific article; zbMATH DE number 5718258 |
Statements
Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data (English)
0 references
8 June 2010
0 references
metric learning
0 references
positive and negative constraints
0 references
semi-supervised clustering
0 references
optimization problem
0 references
non-linear
0 references
topological structure
0 references
kernel
0 references
0 references
0 references
0.8933101296424866
0 references
0.8281046152114868
0 references
0.8187009692192078
0 references
0.8172262907028198
0 references
0.8102818727493286
0 references
