A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition (Q3758256): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q52639299, #quickstatements; #temporary_batch_1705521228510 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q52639299 / rank | |||
Normal rank | |||
Revision as of 21:17, 17 January 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
