Reducing non-determinism of \(k\)-NN searching in non-ordered discrete data spaces (Q656596)
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: Reducing non-determinism of k-NN searching in non-ordered discrete data spaces |
scientific article; zbMATH DE number 5999001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reducing non-determinism of \(k\)-NN searching in non-ordered discrete data spaces |
scientific article; zbMATH DE number 5999001 |
Statements
Reducing non-determinism of \(k\)-NN searching in non-ordered discrete data spaces (English)
0 references
18 January 2012
0 references
information retrieval
0 references
databases
0 references
non-ordered discrete data space
0 references
\(k\)-nearest neighbor search
0 references
0.7012898325920105
0 references
0.700905978679657
0 references
0.7006118297576904
0 references
