Description Usage Arguments Value Author(s) References Examples
The local pivotal method provides a way to perform balanced sampling. This implementation replace linear searches in lpm2, with k-d trees. K-d trees are binary trees used to effectively search high dimensional spaces, and reduce the average computational complexity of lpm2 from O(N^2) to O(N log(N)).
1 2 3 4 5 | lpm3(
prob,
x,
m=40
)
|
prob |
An array of length N such that the sum of prob is equal to the sample size, where the N is the number of rows of x. |
x |
A matrix of N rows and p columns, each row is assumed to be a sampling unit. |
m |
Max leaf size used as a terminal condition for building the k-d tree. |
Returns a vector of selected indexes from the matrix x. The results are identical to the lpm2 package when no ties in distance occur.
Jonathan Lisic
Lisic, J., Jonathan (2015) Parcel Level Agricultural Land Cover Prediction. (Unpublished doctoral dissertation). George Mason University, Fairfax, Virginia.
1 2 3 4 5 6 7 8 9 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.