BiocNeighbors 1.22.0
Another application of the KMKNN or VP tree algorithms is to identify all neighboring points within a certain distance1 The default here is Euclidean, but again, we can set distance="Manhattan" in the BNPARAM object if so desired. of the current point.
We first mock up some data:
nobs <- 10000
ndim <- 20
data <- matrix(runif(nobs*ndim), ncol=ndim)We apply the findNeighbors() function to data:
fout <- findNeighbors(data, threshold=1)
head(fout$index)## [[1]]
## [1] 4825 3672 1 1310
##
## [[2]]
## [1] 2 2420
##
## [[3]]
## [1] 2528 4574 3
##
## [[4]]
## [1] 7045 4
##
## [[5]]
## [1] 5
##
## [[6]]
## [1] 1537 3076 6head(fout$distance)## [[1]]
## [1] 0.9668138 0.9467203 0.0000000 0.9200029
##
## [[2]]
## [1] 0.0000000 0.9114991
##
## [[3]]
## [1] 0.8174621 0.8429530 0.0000000
##
## [[4]]
## [1] 0.9050417 0.0000000
##
## [[5]]
## [1] 0
##
## [[6]]
## [1] 0.9924753 0.9112642 0.0000000Each entry of the index list corresponds to a point in data and contains the row indices in data that are within threshold.
For example, the 3rd point in data has the following neighbors:
fout$index[[3]]## [1] 2528 4574 3… with the following distances to those neighbors:
fout$distance[[3]]## [1] 0.8174621 0.8429530 0.0000000Note that, for this function, the reported neighbors are not sorted by distance. The order of the output is completely arbitrary and will vary depending on the random seed. However, the identity of the neighbors is fully deterministic.
The queryNeighbors() function is also provided for identifying all points within a certain distance of a query point.
Given a query data set:
nquery <- 1000
ndim <- 20
query <- matrix(runif(nquery*ndim), ncol=ndim)… we apply the queryNeighbors() function:
qout <- queryNeighbors(data, query, threshold=1)
length(qout$index)## [1] 1000… where each entry of qout$index corresponds to a row of query and contains its neighbors in data.
Again, the order of the output is arbitrary but the identity of the neighbors is deterministic.
Most of the options described for findKNN() are also applicable here.
For example:
subset to identify neighbors for a subset of points.get.distance to avoid retrieving distances when unnecessary.BPPARAM to parallelize the calculations across multiple workers.raw.index to return the raw indices from a precomputed index.Note that the argument for a precomputed index is precomputed:
pre <- buildIndex(data, BNPARAM=KmknnParam())
fout.pre <- findNeighbors(BNINDEX=pre, threshold=1)
qout.pre <- queryNeighbors(BNINDEX=pre, query=query, threshold=1)Users are referred to the documentation of each function for specific details.
sessionInfo()## R version 4.4.0 beta (2024-04-15 r86425)
## Platform: x86_64-pc-linux-gnu
## Running under: Ubuntu 22.04.4 LTS
##
## Matrix products: default
## BLAS: /home/biocbuild/bbs-3.19-bioc/R/lib/libRblas.so
## LAPACK: /usr/lib/x86_64-linux-gnu/lapack/liblapack.so.3.10.0
##
## locale:
## [1] LC_CTYPE=en_US.UTF-8 LC_NUMERIC=C
## [3] LC_TIME=en_US.UTF-8 LC_COLLATE=en_US.UTF-8
## [5] LC_MONETARY=en_US.UTF-8 LC_MESSAGES=en_US.UTF-8
## [7] LC_PAPER=en_US.UTF-8 LC_NAME=C
## [9] LC_ADDRESS=C LC_TELEPHONE=C
## [11] LC_MEASUREMENT=en_US.UTF-8 LC_IDENTIFICATION=C
##
## time zone: America/New_York
## tzcode source: system (glibc)
##
## attached base packages:
## [1] stats graphics grDevices utils datasets methods base
##
## other attached packages:
## [1] BiocParallel_1.38.0 BiocNeighbors_1.22.0 knitr_1.46
## [4] BiocStyle_2.32.0
##
## loaded via a namespace (and not attached):
## [1] cli_3.6.2 rlang_1.1.3 xfun_0.43
## [4] jsonlite_1.8.8 S4Vectors_0.42.0 htmltools_0.5.8.1
## [7] stats4_4.4.0 sass_0.4.9 rmarkdown_2.26
## [10] grid_4.4.0 evaluate_0.23 jquerylib_0.1.4
## [13] fastmap_1.1.1 yaml_2.3.8 lifecycle_1.0.4
## [16] bookdown_0.39 BiocManager_1.30.22 compiler_4.4.0
## [19] codetools_0.2-20 Rcpp_1.0.12 lattice_0.22-6
## [22] digest_0.6.35 R6_2.5.1 parallel_4.4.0
## [25] bslib_0.7.0 Matrix_1.7-0 tools_4.4.0
## [28] BiocGenerics_0.50.0 cachem_1.0.8