Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms (Q669282)
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: Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms |
scientific article; zbMATH DE number 7036668
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms |
scientific article; zbMATH DE number 7036668 |
Statements
Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms (English)
0 references
15 March 2019
0 references
nearest neighbour
0 references
distance metric
0 references
lowest probability mass neighbour
0 references
mass-based dissimilarity
0 references
classification
0 references
clustering
0 references
0 references
0 references
0.7211413979530334
0 references
0.7173857688903809
0 references
0.7114330530166626
0 references
0.7006537318229675
0 references
