软件包：r-cran-rann（2.6.1-1 以及其他的） [debports]
Fast Nearest Neighbour Search Using L2 Metric
Finds the k nearest neighbours for every point in a given dataset in O(N log N) time using Arya and Mount's ANN library (v1.1.3). There is support for approximate as well as exact searches, fixed radius searches and 'bd' as well as 'kd' trees. The distance is computed using the L2 (Euclidean) metric. Please see package 'RANN.L1' for the same functionality using the L1 (Manhattan, taxicab) metric.
其他与 r-cran-rann 有关的软件包
|
|
|
|
-
- dep: libc6 (>= 2.4)
- GNU C 语言运行库：共享库
同时作为一个虚包由这些包填实： libc6-udeb
-
- dep: libgcc-s2 (>= 4.2.1)
- GCC 支持库
-
- dep: libstdc++6 (>= 4.9)
- GNU 标准 C++ 库，第3版
-
- dep: r-api-4.0
- 本虚包由这些包填实： r-base-core
-
- dep: r-base-core (>= 4.0.0-3)
- GNU R core of statistical computation and graphics system