Build an exact mutual kNN graph from a bigmemory::big.matrix — mutual_knn_graph

Build an exact mutual kNN graph from a bigmemory::big.matrix

Usage

mutual_knn_graph_bigmatrix(
  x,
  k = 10L,
  metric = "euclidean",
  block_size = knn_default_block_size(),
  plan = NULL,
  include_distance = TRUE,
  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.
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().
include_distance: Logical flag controlling whether graph edges store distances or unit weights.
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.