Local convex hull

Local convex hull

Local convex hull (LoCoH) is a method for estimating the size the home range of an animal or a group of animals (e.g. a pack of wolves, a pride of lions, or herd of buffalos), and for constructing a utilization distribution. [Getz, W. M. and C. C. Wilmers, 2004. A local nearest-neighbor convex-hull construction of home ranges and utilization distributions. Ecography 27: 489-505. [http://www.cnr.berkeley.edu/%7Egetz/Reprints04/Getz&WilmersEcoG_SF_04.pdf View PDF] ] [Getz, W.M, S. Fortmann-Roe, P. C. Cross, A. J. Lyons, S. J. Ryan, C.C. Wilmers, PLoS ONE 2(2): e207. doi:10.1371/journal.pone.0000207. LoCoH: nonparametric kernel methods for constructing home ranges and utilization distributions. [http://www.cnr.berkeley.edu/%7Egetz/Reprints06/GetzEtAlPLoSLoCoH07.pdf View PDF] ] The latter is a probability distribution that represents the probabilities of finding an animal within a given area of its home range at any point in time; or, more generally, at points in time for which the utilization distribution has been constructed. In particular, different utilization distributions can be constructed from data pertaining to particular periods of a diurnal or seasonal cycle.

Utilization distributions are constructed from data providing the location of an individual or several individuals in space at different points in time by associating a local distribution function with each point and then summing and normalizing these local distribution functions to obtain a distribution function that pertains to the data as a whole. [Silverman BW. (1986) Density estimation for statistics and data analysis. London: Chapman and Hall. 176 p.] [Worton BJ. (1987). A review of models of home range for animal movement. Ecological Modelling, 38: 277–298.] [Worton BJ. (1989) Kernel methods for estimating the utilization distribution in home-range studies. Ecology 70: 164–168.] [Seaman DE, Powell RA. (1996) An evaluation of the accuracy of kernel density estimators for home range analysis. Ecology 77: 2075–2085.] If the local distribution function is a parametric distribution, such as a symmetric bivariate normal distribution then the method is referred to as a kernel method, but more correctly should be designated as a parametric kernel method. On the other hand, if the local kernel element associated with each point is a local convex polygon constructed from the point and its "k"-1 nearest neighbors, then the method is nonparametric and referred to as a "k"-LoCoH or "fixed point" LoCoH method. This is in contrast to "r"-LoCoH (fixed radius) and "a"-LoCoH (adaptive radius) methods.

In the case of LoCoH utilization distribution constructions, the home range can be taken as the outer boundary of the distribution (i.e. the 100th percentile). In the case of utilization distributions constructed from unbounded kernel elements, such as bivariate normal distributions, the utilization distribution is itself unbounded. In this case the most often used convention is to regard the 95th percentile of the utilization distribution as the boundary of the home range.

To construct a "k"-LoCoH utilization distribution you simply:

# Locate the "k" − 1 nearest neighbors for each point in the dataset.
# Construct a convex hull for each set of nearest neighbors and the original data point.
# Merge these hulls together from smallest to largest.
# Divide the merged hulls into isopleths where the 10% isopleth contains 10% of the original data points, the 100% isopleth contains all the points, etc.

In this sense, LoCoH methods are a generalization of the home range estimator method based on constructing the minimum convex polygon (MCP) associated with the data. The LoCoH method has a number of advantages over parametric kernel methods. In particular:

* As more data are added, the estimates of the home range become more accurate than for bivariate normal kernel constructions.
* LoCoH handles 'sharp' features such as lakes and fences much better than parametric kernal constructions.
* As mentioned above, the home range is a finite region without having to resort to an ad-hoc choice, such as the 95th percentile to obtain bounded region.

LoCoH has a number of implementations including a [http://locoh.palary.org LoCoH Web Application] .

LoCoH was formerly known as "k"-NNCH, for "k"-Nearest Neighbor Convex Hulls. It has recently been shown that the "a"-LoCoH is the best of the three LoCoH methods mentioned above (see Getz et al. in the references below).

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Home range — is a concept that can be traced back to a publication in 1943 by W. H. Burt, [Burt, W. H. 1943. Territoriality and home range concepts as applied to mammals. Journal of Mammalogy 24:346–352.] who constructed maps delineating the spatial extent or …   Wikipedia

  • List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… …   Wikipedia

  • List of statistics topics — Please add any Wikipedia articles related to statistics that are not already on this list.The Related changes link in the margin of this page (below search) leads to a list of the most recent changes to the articles listed below. To see the most… …   Wikipedia

  • Utilization distribution — A utilization distribution is a probability distribution constructed from data providing the location of an individual in space at different points in time.ee also*Home range *Local convex hull …   Wikipedia

  • Curve orientation — In mathematics, a positively oriented curve is a planar simple closed curve (that is, a curve in the plane whose starting point is also the end point and which has no other self intersections) such that when traveling on it one always has the… …   Wikipedia

  • Convexity in economics — Economics …   Wikipedia

  • Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

  • Polyhedron — Polyhedra redirects here. For the relational database system, see Polyhedra DBMS. For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). Some Polyhedra Dodecahedron (Regular polyhedron) …   Wikipedia

  • Gerrymandering — Jerrymander redirects here. Jerrymander may also refer to the arachnid known as Solifugae. For the 2010 documentary film, see Gerrymandering (film). Part of the Politics series …   Wikipedia

  • Simplex — For other uses, see Simplex (disambiguation). A regular 3 simplex or tetrahedron In geometry, a simplex (plural simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimension. Specifically, an n… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”