A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition (Q3758256): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tpami.1986.4767859 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2106767554 / rank | |||
Normal rank | |||
Latest revision as of 08:59, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition |
scientific article |
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
