Unsupervised classification of multivariate geostatistical data: Two algorithms. (December 2015)

• Record Type: Journal Article
• Authors: Romary, Thomas; Ors, Fabien; Rivoirard, Jacques; Deraisme, Jacques
• Is Part Of: Computers & geosciences. Volume 85:Part B(2015)
• Page Start: 96
• Page End: 103
• Publication Date: 2015-12
• Subjects: Spatial data -- Clustering -- Multivariate data -- Geostatistics; Environmental policy -- Periodicals; 550.5
• DOI: 10.1016/j.cageo.2015.05.019
• Languages: English
• ISSNs: 0098-3004

Abstract

Abstract: With the increasing development of remote sensing platforms and the evolution of sampling facilities in mining and oil industry, spatial datasets are becoming increasingly large, inform a growing number of variables and cover wider and wider areas. Therefore, it is often necessary to split the domain of study to account for radically different behaviors of the natural phenomenon over the domain and to simplify the subsequent modeling step. The definition of these areas can be seen as a problem of unsupervised classification, or clustering, where we try to divide the domain into homogeneous domains with respect to the values taken by the variables in hand. The application of classical clustering methods, designed for independent observations, does not ensure the spatial coherence of the resulting classes. Image segmentation methods, based on e.g. Markov random fields, are not adapted to irregularly sampled data. Other existing approaches, based on mixtures of Gaussian random functions estimated via the expectation-maximization algorithm, are limited to reasonable sample sizes and a small number of variables. In this work, we propose two algorithms based on adaptations of classical algorithms to multivariate geostatistical data. Both algorithms are model free and can handle large volumes of multivariate, irregularly spaced data. The first one proceeds by agglomerative hierarchical clustering. The spatial coherence is ensured by a proximity condition imposed for two clusters to merge. This proximity condition relies on a graph organizing the data in the coordinates space. The hierarchical algorithm can then be seen as a graph-partitioning algorithm. Following this interpretation, a spatial version of the spectral clustering algorithm is also proposed. The performances of both algorithms are assessed on toy examples and a mining dataset.