Spatial weights: Constructing weight-compatible exchange matrices from proximity matrices

12Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Exchange matrices represent spatial weights as symmetric probability distributions on pairs of regions, whose margins yield regional weights, generally well-specified and known in most contexts. This contribution proposes a mechanism for constructing exchange matrices, derived from quite general symmetric proximity matrices, in such a way that the margin of the exchange matrix coincides with the regional weights. Exchange matrices generate in turn diffusive squared Euclidean dissimilarities, measuring spatial remoteness between pairs of regions. Unweighted and weighted spatial frameworks are reviewed and compared, regarding in particular their impact on permutation and normal tests of spatial autocorrelation. Applications include tests of spatial autocorrelation with diagonal weights, factorial visualization of the network of regions, multivariate generalizations of Moran’s I, as well as “landscape clustering,” aimed at creating regional aggregates both spatially contiguous and endowed with similar features.

Cite

CITATION STYLE

APA

Bavaud, F. (2014). Spatial weights: Constructing weight-compatible exchange matrices from proximity matrices. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8728, 81–96. https://doi.org/10.1007/978-3-319-11593-1_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free