A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition (Q3758256)
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: A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition |
scientific article; zbMATH DE number 4007746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition |
scientific article; zbMATH DE number 4007746 |
Statements
A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition (English)
0 references
1986
0 references
density estimation
0 references
k nearest neighbors
0 references
nonparametric pattern recognition
0 references
ordered partition
0 references
preprocessing
0 references
search tree
0 references
