TnKnn {KPC} | R Documentation |
Tn with geometric graphs
Description
Calculate using directed K-NN graph or minimum spanning tree (MST).
Usage
TnKnn(Y, X, k, Knn = 1)
Arguments
Y |
a matrix of response (n by dy) |
X |
a matrix of predictors (n by dx) |
k |
a function |
Knn |
the number of K-nearest neighbor to use; or "MST". |
Details
is an estimate of
, with
,
drawn iid from
, given
.
For K-NN graph, ties will be broken at random. Algorithm finding the MST is implemented the package
emstreeR
.
Value
The algorithm returns a real number which is the value of Tn.
[Package KPC version 0.1.2 Index]