simple_nkde: Simple NKDE algorithm

In JeremyGelb/spNetwork: Spatial Analysis on Network

Simple NKDE algorithm

Description

Function to perform the simple nkde.

Usage

simple_nkde(graph, events, samples, bws, kernel_func, nodes, edges, div = "bw")

Arguments

graph	a graph object from igraph representing the network
events	a feature collection of points representing the events. It must be snapped on the network, and be nodes of the network. A column vertex_id must indicate for each event its corresponding node
samples	a a feature collection of points representing the sampling points. The samples must be snapped on the network. A column edge_id must indicate for each sample on which edge it is snapped.
bws	a vector indicating the kernel bandwidth (in meters) for each event
kernel_func	a function obtained with the function select_kernel
nodes	a a feature collection of points representing the nodes of the network
edges	a a feature collection of linestrings representing the edges of the network
div	The divisor to use for the kernel. Must be "n" (the number of events within the radius around each sampling point), "bw" (the bandwidth) "none" (the simple sum).

Value

a dataframe with two columns. sum_k is the sum for each sample point of the kernel values. n is the number of events influencing each sample point

Examples

#This is an internal function, no example provided

JeremyGelb/spNetwork documentation built on May 24, 2024, 7:23 p.m.