rhrHrefScaled: Select a bandwidth for Kernel Density Estimation
In jmsigner/rhr: Reproducible Home Ranges with R

Description Usage Arguments Details Value References

Use two dimensional reference bandwidth to select a bandwidth for kernel density estimation. Find the smallest value for bandwidth (h) that results in n polygons (usually n=1) contiguous polygons at a given level.

1
2
3

rhrHrefScaled(xy, range = rhrHref(xy)$h * c(0.01, 1),
  trast = rhrRasterFromExt(rhrExtFromPoints(xy, extendRange = 0.2), nrow =
  100, res = NULL), numOfParts = 1, levels = 95, tol = 0.1, maxIt = 500)

`xy`	Instance of `data.frame`, `SpatialPoints`, `SpatialPointsDataFrame` or `RhrMappedData`. If `xy` is is a `data.frame`, then the first two columns are assumed to be the `x` and `y` coordinates of the relocations.
`range`	Numeric vector, indicating the lower and upper bound of the search range. If `range` is to large with regard to `trast`, the algorithm will fail.
`trast`	Instance of `RasterLayer` that serves as a template for the resulting grid of the estimation.
`numOfParts`	Numeric numeric scalar, indicating the number of contiguous polygons desired. This will usually be one.
`levels`	Numeric `vector` indicating percentages at which the home-range estimates should be evaluated.
`tol`	Numeric scalar, indicating which difference of to stop.
`maxIt`	Numeric scalar, indicating the maximum number of acceptable iterations.

This implementation uses a bisection algorithm to the find the smallest value value for the kernel bandwidth within range that produces an home-range isopleth at level consisting of n polygons. Note, no difference is is made between the two dimensions.

list with the calculated bandwidth, exit status and the number of iteration.

Kie, John G. "A rule-based ad hoc method for selecting a bandwidth in kernel home-range analyses." Animal Biotelemetry 1.1 (2013): 1-12.

jmsigner/rhr documentation built on June 26, 2020, 8:59 a.m.