Description: Contains efficient implementations of Discrete Optimal Transport algorithms for the computation of Kantorovich-Wasserstein distances between pairs of large spatial maps (Bassetti, Gualandi, Veneroni (2020), <doi:10.1137/19M1261195>). All the algorithms are based on an ad-hoc implementation of the Network Simplex algorithm. The package has four main helper functions: compareOneToOne() (to compare two spatial maps), compareOneToMany() (to compare a reference map with a list of other maps), compareAll() (to compute a matrix of distances between a list of maps), and focusArea() (to compute the KWD distance within a focus area). In non-convex maps, the helper functions first build the convex-hull of the input bins and pad the weights with zeros.

Description: Implements a spatial extension of the random forest algorithm
Future updates include more local machine learning methods
as well as a geographically weighted random forest.

Allows for a geographically weighted random forest regression
including a function to find the optical bandwidth.

including a function to find the optical bandwidth. (Georganos

Title: Multivariate nonparametric methods based on spatial signs and ranks
Author: Seija Sirkia, Jaakko Nevalainen, Klaus Nordhausen, Hannu Oja
Description: This package contains test and estimates of location, tests of independence, tests of sphericity, several estimates of shape and regression all based on spatial signs, symmetrized signs, ranks and signed ranks.
Packaged: Mon Feb 23 11:11:46 2009; hornik

Packaged: Tue Sep  4 14:14:37 2007; ssirkia

Title: Multivariate nonparametric methods based on spatial signs and
Author: Seija Sirkia, Klaus Nordhausen, Hannu Oja
Description: This package contains test and estimates of location,
tests of independence, tests of sphericity and several
estimates of shape all based on spatial signs, symmetrized

Author: Seija Sirkia, Jari Miettinen, Klaus Nordhausen, Hannu Oja, Sara

Author: Seija Sirkia, Jari Miettinen, Klaus Nordhausen, Hannu Oja, Sara Taskinen