name: 1 class: center middle main-title section-title-4 # Introduction to point pattern analysis .class-info[ **Session 25** .light[HES597: Introduction to Spatial Data in R<br> Boise State University Human-Environment Systems<br> Fall 2021] ] --- # Goals for today * Define point patterns and their utility spatial analysis * Introduce methods for describing point patterns * Describe several commmon methods for the statistical analysis of point patterns --- # What is a point pattern? .pull-left[ * _Point pattern_: A __set__ of __events__ eithin a study region (i.e., a _window_) * __Set__: A collection of mathematical __events__ * __Events__: The existence of a point object of the type we are interested in at a particular location in the study region * A _marked point pattern_ refers to a point pattern where the events have additional descriptors ] .pull-right[ __Some notation:__ * `\(S\)`: refers to the entire set * `\(\mathbf{s_i}\)` denotes the vector of data describing point `\(s_i\)` in set `\(S\)` * `\(\#(S \in A )\)` refers to the number of points in `\(S\)` within study area `\(A\)` ] --- # Requirements for a set to be considered a point pattern * The pattern must be mapped on a plane to preserve distance * The study area, `\(A\)`, should be objectively determined * There should be a `\(1:1\)` correspondence between objects in `\(A\)` and events in the pattern * Events must be _proper_ i.e., refer to actual locations of the event * For some analyses the pattern should be a census of the relevant events --- name: describe class: center middle main-title section-title-4 # Describing point patterns --- # Describing point patterns .pull-left[ * _Density-based metrics_: the `\(\#\)` of points within area, `\(a\)`, in study area `\(A\)` * _Distance-based metrics_: based on nearest neighbor distances or the distance matrix for all points * _First order_ effects reflect variation in __intensity__ due to variation in the 'attractiveness' of locations * _Second order_ effects reflect variation in __intensity__ due to the presence of points themselves ] .pull-right[ <img src="13-slides_files/figure-html/clust-1.png" width="504" style="display: block; margin: auto;" /> ] --- # Centrography .pull-left[ * _Mean center_: the point, `\(\hat{\mathbf{s}}\)`, whose coordinates are the average of all events in the pattern * _Standard distance_: a measure of the dispersion of points around the _mean center_ * _Standard ellipse_: dispersion in one dimension ] .pull-right[ <figure> <img src="img/13/centrography.png" alt="ZZZ" title="ZZZ" width="100%"> </figure> .caption[ From Manuel Gimond ] ] --- # Density based methods .pull-left[ * The overall _intensity_ of a point pattern is a crude density estimate `$$\hat{\lambda} = \frac{\#(S \in A )}{a}$$` * Local density = quadrat counts ] .pull-right[ <img src="13-slides_files/figure-html/qct-1.png" width="504" style="display: block; margin: auto;" /> ] --- # Density based methods .pull-left[ * __kernel density estimates__: similar to quadrat counts, but using a _moving window_ for the subregion * __kernel__: defines the shape, size, and weight assigned to observations in the window * weights often assigned based on distance from the window center ] .pull-right[ <img src="13-slides_files/figure-html/krn-1.png" width="504" style="display: block; margin: auto;" /> ] --- # Distance based metrics .pull-left[ * Provide an estimate of the _second order_ effects * _Mean nearest-neighbor distance_: `$$\hat{d_{min}} = \frac{\sum_{i = 1}^{m} d_{min}(\mathbf{s_i})}{n}$$` * _G_ function: the cummulative frequency distribution of the nearest neighbor distances * _F_ function: similar to _G_ but based on randomly located points * Clustering with _G_ ] .pull-right[ <img src="13-slides_files/figure-html/cumdist-1.png" width="504" style="display: block; margin: auto;" /> ] --- # Distance based metrics .pull-left[ * Nearest neighbor methods throw away a lot of information * The _K_ function is an alternative, based on a series of circles with increasing radius ] .pull-right[ <img src="13-slides_files/figure-html/Kfun-1.png" width="504" style="display: block; margin: auto;" /> ] --- name: analyze class: center middle main-title section-title-4 # Statistical analysis of point patterns --- # Simple tests * Distributional assumptions and heuristics --- # Expected Values * We can use the `\(\chi^{2}\)` distribution to compare an observed point pattern to one generated by an expectation * Often CSR is not interesting so we can use _Monte Carlo Methods_ to generate custom expectations * We'll do this on Thursday --- # Estimating the parameters of covariate effects * Often we are more interested in the effects of specific covariates on the resulting pattern * Spatial regression models * These are the foundation of "event distribution models" * More on these after break