Paket: r-cran-rann (2.6.1-1 ve diğerleri)

[ Kaynak: r-cran-rann  ]

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 ile İlgili Diğer Paketler

• dep: libc6 (>= 2.4)

  GNU C Library: Shared libraries
  ayrıca şunun tarafından sağlanan bir sanal paket libc6-udeb

• dep: libgcc-s1 (>= 3.0)

  GCC support library

• dep: libstdc++6 (>= 4.9)

  GNU Standard C++ Library v3

• dep: r-api-4.0

  sanal paketi sağlayan 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

r-cran-rann indir

Tüm mevcut mimariler için indir

Mimari	Sürüm	Paket Boyutu	Kurulu Boyut	Dosyalar
amd64	2.6.1-1+b2	40,9 kB	121,0 kB	[dosya listesi]