coverTreeNeighbor: Run a Cover Tree distance analysis

In eddelbuettel/rcppmlpack2: Rcpp Integration for MLPACK Library

Description

Run a Cover Tree distance measure analysis which provides a specialised

Usage

coverTreeNeighbor(dataset, k)

Arguments

dataset	A matrix of training data values
k	An integer specifying the number of dimensions

Details

This function performs a distance calculation using a Cover Tree. A cover tree is a tree specifically designed to speed up nearest-neighbor computation in high-dimensional spaces. Each non-leaf node references a point and has a nonzero number of children, including a “self-child” which references the same point. A leaf node represents only one point.

Value

A list with two elements giving the nighbors and their distances

Examples

data(testData1kBy3)
mat <- t(testData1kBy3)
res <- coverTreeNeighbor(mat, 5)

eddelbuettel/rcppmlpack2 documentation built on Feb. 2, 2021, 1:51 a.m.