Some approaches to improve tree-based nearest neighbour search algorithms (Q2575820): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q2707395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: PCA-based branch and bound search algorithms for computing K nearest neighbors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Branch and Bound Algorithm for Computing k-Nearest Neighbors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Data Structure and an Algorithm for the Nearest Point Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The String-to-String Correction Problem / rank | |||
Normal rank | |||
Latest revision as of 12:50, 11 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some approaches to improve tree-based nearest neighbour search algorithms |
scientific article |
Statements
Some approaches to improve tree-based nearest neighbour search algorithms (English)
0 references
7 December 2005
0 references
Nearest neighbour search
0 references
Metric spaces
0 references
Pruning rules
0 references
Branch and bound scheme
0 references
