buildKdDataTree: Construct a KD-Tree using the data.tree package

Description Usage Arguments Author(s)

Description

This algorithm works similarly as buildKdTree but allows for more fancy operation such as child-parent traversal

Usage

1
buildKdDataTree(X, y, scale = TRUE, FUN = median, ...)

Arguments

X

Data table of values on which to perform splits

y

Vector with data that should be stored in the leafs

scale

Should data be scaled beforehand, defaults to true

FUN

Optional function to use for determining position of split. Defaults to median as this gives a balanced tree

...

Optional arguments to pass on to FUN

Author(s)

Jurian Baas


Jurian/nearest.neighbour documentation built on May 23, 2019, 3:11 p.m.