Skip to contents

Build an exact shared-nearest-neighbour graph from a bigmemory::big.matrix

Source: R/knn_interface.R
snn_graph_bigmatrix.Rd

Build an exact shared-nearest-neighbour graph from a bigmemory::big.matrix

Usage

snn_graph_bigmatrix(
  x,
  k = 10L,
  metric = "euclidean",
  block_size = knn_default_block_size(),
  plan = NULL,
  weight = c("count", "jaccard"),
  format = c("edge_list", "triplet", "dgCMatrix")
)

Arguments

x

A bigmemory::big.matrix, an external pointer referencing a big.matrix, or a prepared reference returned by knn_prepare_bigmatrix().

k

Number of neighbours per row in the underlying exact kNN search.

metric

Distance metric. Supported values are "euclidean", "sqeuclidean", and "cosine".

block_size

Number of rows to process per query and reference block.

plan

Optional execution plan returned by knn_plan_bigmatrix().

weight

Shared-nearest-neighbour weight definition. One of "count" or "jaccard".

format

Output format. One of "edge_list", "triplet", or "dgCMatrix".

Value

An edge list, a triplet list, or a Matrix::dgCMatrix, depending on the requested format.