[ 原始碼： r-cran-rann ]
套件：r-cran-rann（2.6.1-1 以及其他的）
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-s1 (>= 3.5)
- GCC 支援函式庫
-
- dep: libstdc++6 (>= 4.9)
- GNU Standard C++ Library v3
-
- 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
-
- rec: r-cran-testthat
- GNU R testsuite