R Tutorial : Further testing (Spatial Statistics in R)
Key Takeaways
The video demonstrates the use of Spatial Statistics in R, specifically the quadrat test, nearest neighbor distribution, and Ripley's K function, to analyze spatial point processes. It also introduces Monte Carlo testing for complete spatial randomness.
Full Transcript
one problem with the quadrat test is that you have to choose a set of sub regions two few and you don't have many numbers for the statistical test to have much power too many and your regions don't have many points in them and you lose power too there are alternative tests that don't depend on arbitrary subdivisions instead relying on estimating properties of the spatial point process from the events one such property is the nearest neighbor distribution look at each event in your pattern and find the distance to the nearest event so here as nearest neighbor is B B's nearest neighbor is a and season areas neighbor is B that gives us three distances do this for every event plot a histogram to give an estimate of the probability density function of the nearest neighbor distribution a corresponding cumulative distribution function the probability of finding a nearest neighbor within a distance D is named G for a completely spatially random process the theoretical form of G can be worked out exactly so for a process with lambda events per unit area it looks like this spats that uses the GS function to estimate G given a PPP object and an optional distance vector the lines in this plot include two Corrections for edge effects because events near the edge of the window have less area in which the nearest neighbor might have been and this will bias the estimator so G s has a correction argument to choose these edge correction algorithms another useful function of spatial point processes is the ripley's reduced second moment measure better known as the K function K is the number of expected events to be found at a given distance from an event scaled by the intensity to estimate it for some given distance D visit each event in turn and count the number of other events in a circle of radius D take the average that's K of D do that for a number of values of D and you can plot the function for a completely spatially random process this gives K of equals pi times D squared the area of a circle of radius D but how much variation can be expected from an estimate K so that it can be used as a test for complete spatial randomness well first create 99 completely spatially random point patterns in your window and compute the 99 estimates of K you can plot them now compute K for the data and plot it over the simulation estimates is it bigger than the simulations at any point that's an indication of clustering at that scale since the data at that point outranks all 99 simulations you can say it rejects the null hypothesis at a p-value of 0.01 using 99 simulations just makes the division easy since you divided by 99 plus 1 for the data 100 to get the p-value this sort of test where you generate replicates from your hypothesis compute test statistics or functions and compared with the statistic from the data is called a Monte Carlo test it's commonly used in spatial statistics because working out the theoretical distribution of things can be somewhat tricky in the next few exercises you'll explore the nearest neighbor distribution and do some Monte Carlo testing
Original Description
Want to learn more? Take the full course at https://learn.datacamp.com/courses/spatial-statistics-in-r at your own pace. More than a video, you'll learn hands-on coding & quickly apply skills to your daily work.
---
One problem with the quadrat test is that you have to choose a set of sub-regions:
Too few, and you don't have many numbers for the statistical test to have much power.
Too many, and your regions don't have many points in them and you lose power too.
There are alternative tests that don't depend on arbitrary subdivisions, instead of relying on estimating properties of the spatial point process from the events.
One such property is the nearest-neighbour distribution. Look at each event in your pattern and find the distance to the nearest event.
Do this for every event, and plot a histogram to give an estimate of the probability density function of the nearest neighbour distribution.
So here, A's nearest neighbour is B, B's nearest neighbour is A, and C's nearest neighbour is B. That gives us three distances.
Do this for every event, and plot a histogram to give an estimate of the probability density function of the nearest neighbour distribution.
The corresponding cumulative distribution function, the probability of finding a nearest neighbour within a distance d, is named "G". For a completely spatially random process, the theoretical form of G can be worked out exactly, so for a process with "lambda" events per unit area:
It looks like this. spatstat uses the Gest() function to estimate G, given a ppp object and an optional distance vector. The lines in this plot include two corrections for edge effects. Events near the edge of the window have less area in which their nearest neighbour might have been, and this will bias the estimator. So Gest() has a "correction" argument to choose these edge-correction algorithms.
Another useful function of spatial point processes is the "Ripley's reduced second-moment measure" - better known as the "K" fu
Watch on YouTube ↗
(saves to browser)
Sign in to unlock AI tutor explanation · ⚡30
Playlist
Uploads from DataCamp · DataCamp · 0 of 60
← Previous
Next →
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
SQL Server Tutorial: Date manipulation
DataCamp
R Tutorial: Intermediate Interactive Data Visualization with plotly in R
DataCamp
R Tutorial: Adding aesthetics to represent a variable
DataCamp
R Tutorial: Moving Beyond Simple Interactivity
DataCamp
Python Tutorial: Why use ML for marketing? Strategies and use cases
DataCamp
Python Tutorial: Preparation for modeling
DataCamp
Python Tutorial: Machine Learning modeling steps
DataCamp
R Tutorial: The prior model
DataCamp
R Tutorial: Data & the likelihood
DataCamp
R Tutorial: The posterior model
DataCamp
R Tutorial: An Introduction to plotly
DataCamp
R Tutorial: Plotting a single variable
DataCamp
R Tutorial: Bivariate graphics
DataCamp
Python Tutorial: Customer Segmentation in Python
DataCamp
Python Tutorial: Time cohorts
DataCamp
Python Tutorial: Calculate cohort metrics
DataCamp
Python Tutorial: Cohort analysis visualization
DataCamp
R Tutorial: Building Dashboards with flexdashboard
DataCamp
R Tutorial: Anatomy of a flexdashboard
DataCamp
R Tutorial: Layout basics
DataCamp
R Tutorial: Advanced layouts
DataCamp
Python Tutorial: Time Series Analysis in Python
DataCamp
Python Tutorial: Correlation of Two Time Series
DataCamp
Python Tutorial: Simple Linear Regressions
DataCamp
Python Tutorial: Autocorrelation
DataCamp
R Tutorial: The gapminder dataset
DataCamp
R Tutorial: The filter verb
DataCamp
R Tutorial: The arrange verb
DataCamp
R Tutorial: The mutate verb
DataCamp
R Tutorial: What is cluster analysis?
DataCamp
R Tutorial: Distance between two observations
DataCamp
R Tutorial: The importance of scale
DataCamp
R Tutorial: Measuring distance for categorical data
DataCamp
Python Tutorial: Plotting multiple graphs
DataCamp
Python Tutorial: Customizing axes
DataCamp
Python Tutorial: Legends, annotations, & styles
DataCamp
Python Tutorial: Introduction to iterators
DataCamp
Python Tutorial: Playing with iterators
DataCamp
Python Tutorial: Using iterators to load large files into memory
DataCamp
SQL Tutorial: Introduction to Relational Databases in SQL
DataCamp
SQL Tutorial: Tables: At the core of every database
DataCamp
SQL Tutorial: Update your database as the structure changes
DataCamp
Python Tutorial: Classification-Tree Learning
DataCamp
Python Tutorial: Decision-Tree for Classification
DataCamp
Python Tutorial: Decision-Tree for Regression
DataCamp
Python Tutorial: Census Subject Tables
DataCamp
Python Tutorial: Census Geography
DataCamp
Python Tutorial: Using the Census API
DataCamp
R Tutorial: A/B Testing in R
DataCamp
R Tutorial: Baseline Conversion Rates
DataCamp
R Tutorial: Designing an Experiment - Power Analysis
DataCamp
R Tutorial: Introduction to qualitative data
DataCamp
R Tutorial: Understanding your qualitative variables
DataCamp
R Tutorial: Making Better Plots
DataCamp
SQL Tutorial: OLTP and OLAP
DataCamp
SQL Tutorial: Storing data
DataCamp
SQL Tutorial: Database design
DataCamp
Python Tutorial: Introduction to spaCy
DataCamp
Python Tutorial: Statistical Models
DataCamp
Python Tutorial: Rule-based Matching
DataCamp
🎓
Tutor Explanation
DeepCamp AI