Fast exact \(k\) nearest neighbors search using an orthogonal search tree (Q962830): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/pr/LiawLW10, #quickstatements; #temporary_batch_1731475607626 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/pr/LiawLW10 / rank | |||
Normal rank | |||
Revision as of 07:37, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast exact \(k\) nearest neighbors search using an orthogonal search tree |
scientific article |
Statements
Fast exact \(k\) nearest neighbors search using an orthogonal search tree (English)
0 references
7 April 2010
0 references
\(k\) nearest neighbors
0 references
fast algorithm
0 references
principal axis search tree
0 references
orthonormal basis
0 references
