Using Boosted Regression Trees and Remotely Sensed Data to Drive Decision-Making ()

Brigitte Colin^{*}, Samuel Clifford^{}, Paul Wu^{}, Samuel Rathmanner^{}, Kerrie Mengersen^{}

School of Mathematical Sciences, Queensland University of Technology, Brisbane, Australia.

**DOI: **10.4236/ojs.2017.75061
PDF
HTML XML
2,384
Downloads
5,753
Views
Citations

School of Mathematical Sciences, Queensland University of Technology, Brisbane, Australia.

Challenges in Big Data analysis arise due to the way the data are recorded, maintained, processed and stored. We demonstrate that a hierarchical, multivariate, statistical machine learning algorithm, namely Boosted Regression Tree (BRT) can address Big Data challenges to drive decision making. The challenge of this study is lack of interoperability since the data, a collection of GIS shapefiles, remotely sensed imagery, and aggregated and interpolated spatio-temporal information, are stored in monolithic hardware components. For the modelling process, it was necessary to create one common input file. By merging the data sources together, a structured but noisy input file, showing inconsistencies and redundancies, was created. Here, it is shown that BRT can process different data granularities, heterogeneous data and missingness. In particular, BRT has the advantage of dealing with missing data by default by allowing a split on whether or not a value is missing as well as what the value is. Most importantly, the BRT offers a wide range of possibilities regarding the interpretation of results and variable selection is automatically performed by considering how frequently a variable is used to define a split in the tree. A comparison with two similar regression models (Random Forests and Least Absolute Shrinkage and Selection Operator, LASSO) shows that BRT outperforms these in this instance. BRT can also be a starting point for sophisticated hierarchical modelling in real world scenarios. For example, a single or ensemble approach of BRT could be tested with existing models in order to improve results for a wide range of data-driven decisions and applications.

Share and Cite:

Colin, B. , Clifford, S. , Wu, P. , Rathmanner, S. and Mengersen, K. (2017) Using Boosted Regression Trees and Remotely Sensed Data to Drive Decision-Making. *Open Journal of Statistics*, **7**, 859-875. doi: 10.4236/ojs.2017.75061.

1. Background

Data are typically stored in various ways and various formats, mostly in monolithic software architectures which do not allow for interoperability. Analysis of data across multiple data sources is thus difficult, since the functionality of the single data sources with respect to input and output, maintenance, data processing, error handling and user interface is all interwoven and acts as architecturally separate components. In order to create a basis for analysing the data considered here, it was required to extract the datasets from their original databases and combine them to form a common input file for the modelling process. It was therefore inevitable that this resulted in a data file structure which showed missing data, inconsistencies, duplicates and redundancies.

A case study is presented here to examine land use data sourced from a GIS, direct observations from an agricultural company, and remotely sensed data. The data were extracted from a relational database, Excel spreadsheets, remotely sensed imagery stored as raster data, and vector data from a Geographic Information System (GIS), directly observed and measured data in real-time and interpolated data. By combining these data sources to form one common basis for our analysis, issues of data volume, variety and veracity were encountered. Big Data research clearly deals with issues beyond volume and belongs not only to the ongoing digital revolution, but to the scientific revolution as well. The question posed of Big Data and illustrated in the case study presented here, is whether new knowledge can be extracted from various data sources that haven’t been analysed in combination before, and can thus assist in a better and more confident decision making.

2. Introduction

There is an exponential increase in interest in the use of digital data to improve decision making in a range of areas such as human systems, urban environments, agriculture and national security. For example, decisions in the agricultural domain may require information based on vegetation or land use change, estimation of crops or biomass, distribution of native or exotic species, livestock or weed assessment and so on. One source of digital data that has generated intense interest over the past decades is remotely sensed imagery. These data are available from a wide range of sources, ranging from satellites to drones, and have been used for a very wide range of environmental applications [1] - [8] .

The availability and resolution of these data, combined with improved computer storage and data management facilities, have greatly increased the opportunity for mathematicians and statisticians to utilise this information in their models and analyses. The challenge in linking remotely sensed data to decision- making is that there are multiple steps in the process. Here, we focus on an exemplar real-world problem in the livestock industry: deciding on the allocation of animals to different paddocks and potentially different grazing properties based on the predicted availability of grass over the year. This problem arose in the context of collaboration between statisticians at the Queensland University of Technology and a large livestock organisation in Australia. The specific aim of the project was to develop an ensemble of models to predict the carrying capacity, that is, the number of animals that can be sustained on a paddock. In order to achieve this goal we utilised remote sensing data and supporting information about climate and paddock characteristics. Further, it was important to present the results in a form that is useful for the agricultural decision makers.

Difficult or challenging decisions demand a thorough consideration and even then they imply uncertainty, complexity and different levels of risk. Making the right decisions at the right time can lead to success, increase of profit or minimisation of risk. It is thus important that thoughtful considerations are put into each decision. Figure 1 demonstrates the workflow following a Big Data approach for our case study. Here, we use structured but heterogeneous data sources that showed characteristics like missing data, noise and redundancies. All the data sources were used to create a BRT model via an ensemble approach. The resulting model and its output serves as a foundation for a better decision making. The steps involved in the process are depicted in Figure 1. Due to commercial confidentiality concerns, the final results of the modelling workflow are not presented here.

In this article we focus on one component of the ensemble modelling approach employed in the project, namely the use of BRT to estimate so-called animal equivalents per paddock. Since calves, cows and bulls of different ages consume different amounts of grass, these animals are standardised to a reference animal which can then be used as a common response variable in the analysis. An interesting conundrum is that one of the major inputs into such a model is the amount of grass, or more generally the biomass, in a paddock. This can potentially be estimated directly from remote sensing, but is confounded by the fact that animals are on the paddock eating the very thing that is being measured by the sensor. Moreover, the decision maker may be interested in the biomass estimates themselves, either directly via the remotely sensed measurements or indirectly via the animal equivalents based on animal weight and metabolic formula.

A BRT is a popular statistical and machine learning approach that has not yet seen much application in the analysis of remotely sensed data. Indeed, although they were first defined two decades ago, BRT has only recently been extended to deal with the types of features that are characteristic of remotely sensed data, in particular its spatial and temporal dynamics. Most of the activity around the use of BRT for agricultural and environmental applications does not appear in the mainstream mathematical and statistical literature.

Figure 1. Modelling process for case study.

2.1. Case Study

The study area is located in the Northern Territory, Australia. The main climate zone is identified as grassland with hot dry summers and mild winters [9] . It is a heterogeneous region with a complex topography and land cover and type of grassland. Identification, differentiation and quantitative estimation of biomass is of primary interest in this case study. A range of data from different sources was required for this problem. In this section, we describe the information derived from Landsat imagery and comment briefly on other data. The reflectance recorded by the Landsat sensor is stored as an 8 bit value, resulting in a scale of 256 different grey values ranging from black (0 max absorption) to white (255 max reflection). The electronically recorded data appear as an array of numbers in digital format. In addition to the 8 bit quantisation, Landsat offers several spectral bands in the electromagnetic and infrared spectrum in which each individual pixel shows different values across different bands. This means that each pixel has a different dimension and therefore will be represented differently in each spectral band. Raster data are becoming increasingly common and increasingly large in volume, although it is possible to reduce file size with compression functions.

There is a strong advantage in using remotely sensed Landsat imagery and applied spectroscopy for these types of analyses because the data are freely available, the imagery covers a wide geographical range, and it avoids expensive, extensive and often impractical in-situ measurement. However, the trade-off is in resolution: in-situ measurements provide highly localised accuracy whereas a pixel in a Landsat image covers an area of 30 ´ 30 meters. It is noted that other satellites are now able to provide higher resolution, but these are not yet freely available for the areas of interest in this case study.

Estimation of biomass using satellite data is of ongoing global interest. Grass biomass estimation is challenging since the phenological growing cycle of naturally existing grass is a dynamic process influenced by many complex parameters, including grass type, soil, climate, topography and land use. With the spectral information of remotely sensed imagery it is possible to detect green vegetation, which is driven by the photosynthetic biochemical process of grass biomass. However, since raster imagery is only a two dimensional representation of the land cover it is difficult to derive the quantity of the vertical grass biomass directly.

Fractional cover [10] data are often available as derived products; for example Geoscience Australia (GA) who provides an Australian Reflectance Grid 25 (ARG25) product which gives a 25 meter scale fractional cover representation of underlying vegetation across Australia or Tern - Auscover in 30 meter resolution of Landsat 5 and 7 covering the temporal extent from 2000-2011. Fractional cover unmixing algorithms use the spectral reflectance of a Landsat scene for a pixel to break it into three fractions represented as percentage values. These are photosynthetic vegetation (includes leaves and grass), non-photosynthetic vegetation (includes branches, dry grass, and dead leaf litter) and bare surface cover (bare soil or rocks) [11] .

In addition to fractional cover Vegetation Indices (VI) are commonly used to extract meaningful information out of the imagery through image analysis techniques. To calculate VIs it is common to apply arithmetical methods in order to create additional artificial channels using existing spectral bands of the imagery. Other related data were also available to support the analyses. For example, SILO (Scientific Information for Land Owners) is a database of historical climate records for Australia. SILO provides daily datasets for a range of climate variables and in formats suitable for a variety of applications. In addition, SILO datasets are constructed from observational records provided by the Bureau of Meteorology (BOM). As another example, the AussieGRASS spatial framework includes inputs of key climate variables (rainfall, evaporation, temperature, vapour pressure and solar radiation), soil and pasture types, tree and shrub cover, domestic livestock and other herbivore numbers. The derived results of AussieGRASS data are spatially interpolated to construct gridded datasets on a regular grid (approximately 5 ´ 5 km) across Australia [12] [13] .

2.2. Data-Related Challenges

The analysis of relationships in ecological data sets is not trivial [14] . In addition to the complexity of the processes being modelled, there is the challenge of dealing with data dimensionality since it is often necessary to combine various data sources. Moreover, the scale of spatial data needs to be considered when there are differing granularities of spatial and temporal data. For example, SILO rainfall data are reported at a 5 ´ 5 km grid, whereas a Landsat pixel covers an area of 30 ´ 30 meter. The SILO data are stored in a tabular data base format and the single measurement points to record the precipitation independently from each other. In contrast, the derived VI cover a whole Landsat scene of 185 ´ 185 km and are highly correlated. All our environmental data have been provided from the Department of Science, Information Technology and Innovation (DSITI). In addition to the environmental data we used operational data provided by a commercial entity under a confidential agreement.

Another challenging characteristic of remotely sensed data is missing information. There are two major considerations in dealing with this issue. The first is dealing with the missing values. Common options are to filter them out [15] [16] , interpolate them or increase the spatial aggregation. There are advantages and disadvantages to each of these approaches in terms of computational resources, inferential capability, and precision and bias of the resultant estimates [17] . The second consideration is whether to undertake the chosen method as part of the pre-processing or post-processing steps.

For our case study we performed a number of pre-processing steps to prepare our data for the modelling process, namely data aggregation and data reduction for our predictor variables, as well as calculation of the response variable. Instead of working with single pixel values we reduced the volume of data by deriving descriptive statistics from Landsat, MODIS and SILO data, thereby obtaining paddock specific means, medians, first quartile, third quartile, variance and Shannon Entropy. With respect to our response variable, we aggregated real- time measurements to a monthly mean. In the next step we created a test and a training data set by partitioning the data to 20% and 80% respectively. The training set was used to estimate the model parameters. The test set was used for model performance evaluation on unseen data.

3. Boosted Regression Trees

Boosted Regression Trees (BRT), also known as Gradient Boosted Machine (GBM) or Stochastic Gradient Boosting (SGB), are non-parametric regression techniques that combine a regression tree with a boosting algorithm [18] . This extension to the classical regression tree allows greater flexibility and predictive performance in modelling the data. The implementation of these methods used in this study can be found in the gbm R package.

A regression tree partitions the data with a hierarchy of binary splits that define regions of the covariate space in which the response variable has similar values. These splits are defined by rules, distance metrics or information gain. The choice of variables and the value at which the split point occurs is determined in a recursive manner at each stage of the tree construction. The segmentation can be depicted as a tree-like structure, comprising nodes representing the selected factors, branches acting as if-else connectors between the nodes, and leaves representing terminal nodes containing the subsets of responses [19] [16] [20] .

Boosting improves the performance of a simple base-learner by reweighting observations that were misclassified or had large residual errors in the previous iteration. The deeper we grow the tree, the more segments we can accommodate and thus more variance can be explained. This results in higher model complexity and therefore higher risk of overfitting the model to the data.

The motivation behind Boosting is that each tree can be quite shallow (a weak classifier) and thus fast to estimate, but by combining the predictive power of many weak classifiers, a classifier of arbitrary accuracy and precision can be created [21] [22] [23] .

Gradient Boosting

In this section we give a brief summary of the method, following Friedman [18] . This supervised machine learning approach deals with a response variables y and a vector of predictor variables $x$ that are connected via a joint probability distribution $P\left(x\mathrm{,}y\right)$ . Using a training sample $\left\{\left({x}_{1}\mathrm{,}{y}_{1}\right)\mathrm{,}\cdots \mathrm{,}\left({x}_{n}\mathrm{,}{y}_{n}\right)\right\}$ of known values of $x$ and corresponding values of y, the goal is to find an approximation $F\left(x\right)$ to a function ${F}^{\mathrm{*}}\left(x\right)$ that minimises the expected value of a loss function $\psi \left(y\mathrm{,}F\left(x\right)\right)$ , i.e.

${F}^{\mathrm{*}}\left(x\right)=\underset{F\left(x\right)}{\mathrm{arg}\mathrm{min}}{E}_{y\mathrm{,}x}\psi \left(y\mathrm{,}F\left(x\right)\right)\mathrm{.}$ (1)

Boosting approximates ${F}^{\mathrm{*}}\left(x\right)$ by an “additive” expansion in the form of

$F\left(x\right){\displaystyle \underset{m=0}{\overset{M}{\sum}}}\text{\hspace{0.05em}}{\beta}_{m}h\left(x\mathrm{;}{a}_{m}\right)\mathrm{,}$ (2)

where the functions $h\left(x\mathrm{;}a\right)$ are generally simple functions of $x$ with parameters $a=\left\{{a}_{1}\mathrm{,}{a}_{2}\mathrm{,}\cdots \right\}$ . The parameters ${\left\{{a}_{m}\right\}}_{0}^{M}$ and the expansion coefficients ${\left\{{\beta}_{m}\right\}}_{0}^{M}$ are jointly fit to the training data. This is done in a forward stage wise manner. Gradient Boosting [18] approximately solves differentiable loss functions $\psi \left(y\mathrm{,}F\left(x\right)\right)$ with a two step procedure. First, the function $h\left(x\mathrm{;}a\right)$ is fit by least squares to the current “pseudo”-residuals

${\stackrel{\u02dc}{y}}_{im}=-{\left[\frac{\partial \psi \left({y}_{i}\mathrm{,}F\left({x}_{i}\right)\right)}{\partial F\left({x}_{i}\right)}\right]}_{F\left(x\right)={F}_{m-1}\left(x\right)}$ (3)

which represent the residuals from the given stage of the tree building.

Then, given $h\left(x\mathrm{;}{a}_{m}\right)$ , the optimal value of the coefficient ${\beta}_{m}$ is calculated via

${\beta}_{m}=\underset{\beta}{\mathrm{arg}\mathrm{min}}{\displaystyle \underset{i=1}{\overset{N}{\sum}}}\text{\hspace{0.05em}}\psi \left({y}_{i}\mathrm{,}{F}_{m-1}\left({x}_{i}\right)+\beta h\left({x}_{i}\mathrm{;}{a}_{m}\right)\right)\mathrm{.}$ (4)

Gradient Tree Boosting performs this with a base learner $h\left(x\mathrm{;}a\right)$ of an L terminal node regression tree. A regression tree partitions the feature space into L disjoint regions ${\left\{{R}_{lm}\right\}}_{l-1}^{L}$ and predicts a separate constant value at each iteration m.

$h{\left(x\mathrm{;}\left\{{R}_{lm}\right\}\right)}_{1}^{L}={\displaystyle \underset{l-1}{\overset{L}{\sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{\stackrel{\xaf}{y}}_{lm}1\left(x\in {R}_{lm}\right)\mathrm{.}$ (5)

The parameters of the base learner are the splitting variables and corresponding split points that define the tree, and this defines the corresponding regions ${\left\{{R}_{lm}\right\}}_{1}^{L}$ of the partition at each iteration. These are accomplished in a top-down “best-first” approach using a least squares splitting measure [18] . Equation 4 can be solved individually within each region ${R}_{lm}$ defined by the corresponding terminal node $l$ of the mth tree. Because the tree in Equation (5) predicts a constant value ${\stackrel{\xaf}{y}}_{lm}$ within each region ${R}_{lm}$ , the solution to 4 reduces to a simple location estimate based on the criterion $\psi $

${\gamma}_{lm}=\underset{\gamma}{\mathrm{arg}\mathrm{min}}{\displaystyle \underset{{x}_{i}\in {R}_{lm}}{\sum}}\psi \left({y}_{i}\mathrm{,}{F}_{m-1}\left({x}_{i}\right)+\gamma \right)\mathrm{.}$ (6)

Next, the current approximation ${F}_{m-1}\left(x\right)$ is individually updated in all of the corresponding regions

${F}_{m}\left(x\right)={F}_{m-1}\left(x\right)+\nu \cdot {\gamma}_{lm}1\left(x\in {R}_{lm}\right)\mathrm{.}$ (7)

Friedman [18] added a stochastic element to the above boosting algorithm by proposing to draw a random subsample from the full training data set without

replacement. This subsample is then used to fit the base learner and compute the model update for the current iteration. By adding randomness to the algorithm the performance of gradient boosting was improved and this resulted in the stochastic Gradient Boosting Machine (GBM) [23] . The Stochastic Gradient Boosting algorithm is summarised as pseudo code below [15] [23] . The input training data is defined through ${\left\{{y}_{i}\mathrm{,}{x}_{i}\right\}}_{i}^{N}$ and ${\left\{\pi \left(i\right)\right\}}_{i}^{N}$ is the random permutation of the integers $\mathrm{1,}\cdots \mathrm{,}N$ . The random subsample of size $\stackrel{\u02dc}{N}<N$ is given by ${\left\{{y}_{\pi \left(i\right)}\mathrm{,}{x}_{\pi \left(i\right)}\right\}}_{1}^{\stackrel{\u02dc}{N}}$ .

4. Results

The data were presented as a set $\left\{\left({x}_{i},{y}_{i}\right)|0\le i<{n}_{\text{samples}}\right\}$ with feature vector ${x}_{i}\in {\mathbb{R}}^{{n}_{\text{features}}}$ , and the response ${y}_{i}\in \mathbb{R}$ . All the data we used for our case study were combined into a structured comma-separated values (CSV) file that consisted of 209 observations and 141 covariates. The machine friendly notation of our covariates are generated in the following manner. There are in total 5 different components for creating the covariate names. The first shows whether the calculated summary statistics are for monthly values of EOLW/D = end of last wet/dry, or WS = wet season; these are then followed by whether it is an aggregated mean, minimum red or maximum monthly values, followed by the nature of the descriptive statistic: first quartile, median, mean, third quartile, variance and Shannon Entropy; next comes the name of data source (e.g. rain = SILO data), and lastly the corresponding area in proximity to water (3 km, 5 km, 99 km = whole paddock). The covariate name of paha.99km/5km stores values for the whole paddock area measured in hectare and the proximity of water e.g. 5 km radius or 99 km for the whole extent of the paddock. As described in 2.2, the data set was partitioned by treating 80% as training data and the remaining 20% as test data, resulting in 167 training and 42 test observations.

The computational environment was the R statistical modelling software version 3.3.3 [24] running inside Windows 7 SP1 (64-bit) on a 2.60 GHz Intel i7 CPU with 16 GB of RAM. All of the results and illustrations were created in the R programming language. The GBM model implementations for this article were taken from the gbm packages. Table 1 show the distribution of the response variable and the most influential covariates. Please see Figure 3 as a further reference in regards of their individual contribution in the splitting process.

One way of showing the complex relationships of the joint probability and contribution of each covariate in describing the response is through a relative influence plot. Relative influence measures are calculated by averaging the number of times a covariate is used for splitting, weighted by the squared improvement to the model as the result of each split. It is then scaled so the values sum to 100.

In Figure 2 we present a relative influence plot for all of the available variables. The relative influence of the 141 variables varies considerably, with some never contributing (0%) and only 20 variables having relative influence greater than 2.9% as depicted in Figure 3. The two variables that contribute the most are paha.99km at 10.8%, followed by paha.5km with 9.56%. The third strongest variable is EOLW.q3.abrad.3km which contributes with only %3.83. Figure 3 shows the top five contributors on a log scale plot.

Regularisation methods are used to constrain the fitting procedure so that it balances model fit and predictive performance [15] . Regularisation is particularly important for BRT because its sequential model fitting allows trees to be added until the data are completely overfitted [25] . As discussed in section 3, introducing some randomness into a boosted model usually improves accuracy and speed and reduces overfitting [23] .

Figure 4 describes the effect of regularisation on the squared error loss. The blue line is the error in the training data, the red line in the test data. The vertical dashed line indicates the optimal number of iterations/trees provided by the gbm model where the test data reaches its minimum, here at 2784 trees. After reaching the minimum, the graph of the squared error loss starts to increase again. This change of direction indicates the start of the model overfitting the training data and therefore poorly explaining the variation seen in the test data.

Table 1. Distribution of the response variable and key predictors. Predictor names are described in text.

Figure 2. Relative influence plots of all 141 covariates showing their contribution in the splitting process. The horizontal axis indicates the frequency of the contribution with the maximum of 10.8%.

Figure 3. Subset of a relative influence plots of covariates with a contribution greater than 2.9% (log scale).

Figure 4. Squared error loss for the training (blue) and test (red) data as the number of trees in the ensemble increases to a maximum of 6000. The optimal tree size (2784) is shown with the dashed black line.

The bias-variance trade-off goal is to find the optimal number of trees where the bias and the variance are balanced and the error is minimised, since both under- and overfitting will have a negative effect on the predictive performance of the model.

Histograms of the residuals for the test and training sets are shown in Figure 5. In comparison to the training data the test data does not have multiple peaks―which often indicate that important variables are not yet accounted for― but there are some large positive outliers in the training data, beyond 50,000.

Table 2 shows the results of the comparison of BRT and other methods. It is seen that the BRT performed best in fitting the data according to the RMSE.

One of the biggest advantages in using a BRT is that it can handle missing values in the predictors by default. As part of the model diagnostics, we can plot how the data have been split, to which node they have been assigned, and the reduction in error for this single iteration/tree. If the tree is challenged with data that are missing a variable, the split is decided based on a surrogate variable, typically one that has a high correlation with non-missing observations.

The R function pretty.gbm.tree() returns a data frame in which each row corresponds to a node in the tree (Table 3). Here, the root node (indicated by the row number 0) is split by the 84^{th} SplitVar (splitting variable). Since the numbering starts with 0 the split variable is the 85^{th} column in the training set of our case study. Rows in the table with a SplitVar of −1 are terminal nodes. A SplitCodePred value of 301.171 denotes that all points less than 301.17 were allocated to the left node 1 (and hence all points greater then 301.17 were allocated to the right node 2). All points that had a missing value in this column were assigned

Figure 5. Histogram of residuals in the test and training sets at the optimal tree size.

Table 2. Overall model average prediction performance, based on 500 cross-validations.

Table 3. Summary of gbm single tree prediction in pretty.gbm.tree.

to the missing node 3. If the node is a terminal node then this is the prediction. The error reduction (29.73) indicates the reduction in the loss function as a result of splitting this node and there were 466 weights (weights will be on each node) in the root node. The weight indicates the total weight of observations in the node. The last column prediction of −0.000019659 denotes the value assigned to all values at this node before the point was split. The prediction column refers to individual trees and they are fit to predict the gradient of the loss function evaluated in the current prediction and the response. This is the gradient part of Gradient Boosting.

5. Discussion

In this case study we demonstrated that BRT is able to address Big Data challenges, produce satisfying results and can deal with missing values by default. In addition, we obtained in-depth knowledge of the diverse and heterogeneous data sources used in this study, and identified key covariates that were most influential in describing the response variable. Further, descriptive statistics has been used to quantitatively describe our data and basic features of it by providing summaries that enables us to present our results in a meaningful way and therefore allowed for a simpler interpretation. The histograms of training and test data showed us the underlying frequency distribution of our continuous data. In this case both histograms are left skewed and demonstrate that the majority of data can be found on the left hand side. Because histograms use bins to display data it is not possible to see exactly what the specific values are for the minimum and maximum. However, we can see an approximation of the range of values, see how spread out the data are and that there are not outliers that we need to take care of. One of the biggest disadvantages of BRT is, that they are prone to overfit the data, thus appropriate settings for the hyperparameters need to be set in order to control the model building process. It is therefore advisable to tune the model hyperparameters as part of a pre-processing step in an iterative manner prior to performing the final modelling.

There are many features of BRT that are advantageous for the problem considered here. In addition to computational speed and accuracy of estimation, they can describe complex nonlinearities and interactions between variables, accommodate missing data, include different types of input variables without the need for transformations, perform well in high-dimensional problems, and allow for different loss functions such as accurate identification of small areas of interest. Moreover, they can be visualised and interpreted easily, thus facilitating the translation of the analytic results to decision makers [18] . BRT have also been compared favourably with other flexible regression approaches such as generalised additive models [14] . An example of BRT models helping in developing an understanding of missingness structure in the data is given by [26] . In this study Tierney [26] concluded that more knowledge was gained about the origins of the data and the data collection process, as well as the handling of missing values for future analysis. In another study [26] , the author took a different approach to deal with missing values by taking summary values such as the mean over grouped data.

There are several challenges in using BRT for this case study. First, the volume of one single satellite imagery is quite high even without aggregating or combining them in a dense time series. One Landsat satellite scene covers 185 ´ 185 km of land and has a file size of about 300 MB. The temporal resolution of Landsat is on average 16 days; thus, in one year there are 22 scenes of the same area to computationally process, analyse and store, a data volume of about 6.6 GB. Examination of several years of satellite imagery yields in enormous geo-temporal datasets. Given these specifications, a substantive challenge is the storage, processing and management of massive volumes of raster data information. This challenge is exacerbated when the other input variables are also considered, especially since these are of different data formats, sources, structure and spatial granularities. In order to decrease the volume we calculated descriptive statistics based on individual paddock information instead of using pixel information for our analysis.

The second challenge is determining the geographic area to include in the statistical models. The region of interest is spread over multiple stations, with multiple paddocks per station. However, not all of the land in a paddock is grazable. Jansen [27] investigated the quantification of livestock effects on the scalable, season specific metric of Landsat imagery and biomass identification and development of a model assessing spatial relationships between spectral indices and ruminants over a growing season. The focus was on finding significant correlations between existing biomass, vegetation metrics and management practices to quantify changes in vegetation due to grazing. Changes can be caused not only through overgrazing and loss but also due to changes in phenology caused by climate variability and also availability of water. The spatial distribution of animal impacts becomes organised along an utilisation gradient termed a piosphere [28] . Moreover, since animals need access to water, concentric rings can be calculated based on the distance from naturally occurring water points in the paddocks. In the case study these were of order 3 km, 5 km and the size of the whole paddock. The area around those water locations is then deemed to be the available foraging area. In addition to the concentric rings there are also natural water streams which attract the animals and provide biomass along those linear features. So-called linear buffer zones can be calculated along the streams to indicate grazing areas nearby the water, like the concentric rings around the water points. The quantity and quality of biomass types can be extracted through the spectral values of the Landsat pixels and with additional spatial data, in particular fractional cover which identifies three categories of ground cover percentage (photosynthetic vegetation, non-photosynthetic vegetation and bare soil).

The third challenge is incorporating spatial information with disjoint geographic areas (agricultural properties or stations), each of which comprises regions (paddocks) of varying sizes. In the case study, the provided information was typically in the form of summary values per paddock per month. Seasonal (wet and dry) indicators were also used to help quantify the biomass [29] and define the spatial extent of the area due to varying rainfall. The beginning of the dry season is a critical time stamp in terms of predicting the amount of grass that will be available during the dry season and the corresponding decision regarding the number of animals to be placed in paddocks to avoid the negative impact of over- or under grazing.

There is a large literature on the predictive, methodological and computational properties of decision trees, including the Random Forest (RF) and Boosted Regression Tree (BRT) models used in this paper. The predictive accuracy of these methods has been investigated both theoretically [30] [31] [32] [33] and in various applications [34] . The latter authors also compared modelling approaches considered in this paper in the analysis of a large epidemiological dataset and concluded that RF, BRT and LASSO outperformed the conventional logistic regression framework. Methodologically, decision tree approaches belong to the family of greedy algorithms and select variables in a forward selection manner. Both of these features strongly influence the convergence speed and computational time [18] [23] . The computational time is also influenced by the choice of model parameters such as the learning rate and tree complexity [25] . For example, while a smaller shrinkage parameter slows down the learning rate and results in better predictive performance, the trade-off is a larger number of iterations in order to converge to a local minimum and therefore a longer computational time. The total running time also depends on the choice of loss function, regularisation method and the measure of convergence [31] . Empirical comparisons of the running time of different tree methods such as RF and BRT have also been published [35] .

This article has focused on the use of a modern statistical machine learning technique, namely Boosted Regression Trees, to address a challenging real world problem in industry. We presented and demonstrated the efficiency of BRT for addressing Big Data properties with environmental data, specifically remotely sensed data for decision making. There are, of course, other methods that could be used for this type of problem. An appealing alternative that also deals with big, noisy and spatial data is the Bayesian additive regression model [36] , a Bayesian sum-of-tree model that generates samples from a posterior. Further, a sum-of-trees model is an additive model with multivariate components. Compared to generalized additive models based on sums of low dimensional smoothers [37] [38] , these multivariate components can more naturally incorporate interaction effects. This approach enables full posterior inference including point and interval estimates of the unknown regression function as well as the marginal effects of potential predictors. Gathering large and diverse environmental data is essential in this field and analysing those covariates is challenging. Big data has notable effects on predictive analytic, knowledge extraction and interpretation tools [39] and appropriate methods need to be applied in order to gain new knowledge of data-driven discoveries that assist in decision making.

Acknowledgements

This research was undertaken through the Australian Cooperative Research Centre for Spatial Information with the Project number P4.101. We thank our colleagues for their insight and expertise, particularly Dr. Michael Schmidt (Department of Science, Information Technology and Innovation) for providing key publications of the Wambiana Grazing Trial and helpful discussions.

Conflicts of Interest

The authors declare no conflicts of interest.

[1] | Schmidt, M., Thamm, H.P. and Menz, G. (2003) Long Term Vegetation Change Detection in an Arid Environment Using Landsat Data. Geoinformation for European-Wide Integration, Millpress, Rotterdam. |

[2] |
Marsett, R.C., Qi, J., Heilman, P., Biedenbender, S., Watson, M.C., Amer, S., Weltz, M., Goodrich, D. and Marsett, R.C. (2006) Remote Sensing for Grassland Management in the Arid Southwest. Rangeland Ecology & Management, 59, 530-540.
https://doi.org/10.2111/05-201R.1 |

[3] | Huete, A., Ponce-Campos, G., Zhang, Y., Restrepo-Coupe, N., Ma, X. and Moran, M.S. (2015) Land Resources Monitoring, Modeling, and Mapping with Remote Sensing, Monitoring Photosynthesis from Space, CRC Press. |

[4] |
Jafari, A., Khademi, H., Finke, P.A., Van de Wauw, J. and Ayoubi, S. (2014) Spatial Prediction of Soil Great Groups by Boosted Regression Trees Using a Limited Point Dataset in an Arid Region, Southeastern Iran. Geoderma, 232-234, 148-163.
https://doi.org/10.1016/j.geoderma.2014.04.029 |

[5] |
Anderson, M.C., Allen, R.G., Morse, A. and Kustas, W.P. (2012) Use of Landsat Thermal Imagery in Monitoring Evapotranspiration and Managing Water Resources. Remote Sensing of Environment, 122, 50-65.
https://doi.org/10.1016/j.rse.2011.08.025 |

[6] |
Washington-Allen, R.A., Van Niel, T.G., Ramsey, R.D. and West, N.E. (2004) Remote Sensing Based Piosphere Analysis. GIScience and Remote Sensing, 41, 136-154. https://doi.org/10.2747/1548-1603.41.2.136 |

[7] |
Stohlgren, T.J., Ma, P., Kumar, S., Rocca, M., Morisette, J.T., Jarnevich, C.S. and Benson, N. (2010) Ensemble Habitat Mapping of Invasive Plant Species. Risk Analysis, 30, 224-235. https://doi.org/10.1111/j.1539-6924.2009.01343.x |

[8] |
Sarker, C., Mejias Alvarez, L. and Woodley, A. (2016) Integrating Recursive Bayesian Estimation with Support Vector Machine to Map Probability of Flooding from Multispectral Landsat Data. International Conference on Digital Image Computing: Techniques and Applications. https://doi.org/10.1109/DICTA.2016.7797054 |

[9] |
Australian Bureau of Meteorology (2016) Climate classification of Australia,
http://www.bom.gov.au/climate/averages/climatology/gridded-data-info/metadata/md_koppen_classification.shtml |

[10] |
Scarth, P. (2017) Fractional Cover—Landsat, Joint Remote Sensing Research Program Algorithm, Australia Coverage.
http://data.auscover.org.au/xwiki/bin/view/Product+pages/Landsat+Fractional+Cover |

[11] | Scarth, P.F., Roder, A. and Schmidt, M. (2010) Fractional Cover. Proceedings of the 15th Australasian Remote Sensing and Photogrammetry Conference. |

[12] |
DSITI (2015) AussieGRASS Environmental Calculator.
https://www.longpaddock.qld.gov.au/about/publications/pdf/agrass_user_guide.pdf |

[13] |
Bastin, G., Denham, R., Scarth, P., Sparrow, A. and Chewings, V. (2014) Remotely-Sensed Analysis of Ground-Cover Change in Queensland’s Rangelands, 1988-2005. Rangeland Journal, 36, 191-204. https://doi.org/10.1071/RJ13127 |

[14] |
Leathwick, J.R., Elith, J., Francis, M.P., Hastie, T. and Taylor, P. (2006) Variation in Demersal Fish Species Richness in the Oceans Surrounding New Zealand: An Analysis Using Boosted Regression Trees. Marine Ecology-Progress Series, 321, 267-281.
https://doi.org/10.3354/meps321267 |

[15] |
Hastie, T., Tibshirani, R. and Friedman, J. (2009) The Elements of Statistical Learning. Springer Series in Statistics, New York.
https://doi.org/10.1007/978-0-387-84858-7 |

[16] | Tarling, R. (2009) Statistical Modelling for Social Researchers: Principles and Practice. Taylor & Francis Group, Abingdon. |

[17] |
De’ath, G. and Fabricius, K.E. (2000) Classification and Regression Trees: A Powerful yet Simple Technique for Ecological Data Analysis. Ecology, 81, 3178-3192.
https://doi.org/10.1890/0012-9658(2000)081[3178:CARTAP]2.0.CO;2 |

[18] |
Friedman, J.H. (2001) Greedy Function Approximation: A Gradient Boosting Machine. Institute of Mathematical Statistics, 29, 1189-1232.
http://www.jstor.org/stable/2699986 |

[19] |
Robinzonov, N. (2013) Advances in Boosting of Temporal and Spatial Models. Ludwig-Maximilians-Universitat München.
http://edoc.ub.uni-muenchen.de/15338/ |

[20] |
James, G. and Witten, D. and Hastie, T. and Tibshirani, R. (2013) An Introduction to Statistical Learning. Springer Texts in Statistics, Springer-Verlag, New York, 856-875. https://doi.org/10.1007/978-1-4614-7138-7 |

[21] | Breiman, L. (1998) Arcing Classifiers. Annals of Statistics, 26, 801-849. |

[22] |
Freund, Y. and Schapire, R.E. (1996) Experiments with a New Boosting Algorithm. International Conference on Machine Learning, Bari, 3-6 July 1996, 148-156.
http://dl.acm.org/citation.cfm?id=3091696.3091715 |

[23] |
Friedman, J.H. (2002) Stochastic Gradient Boosting. Computational Statistics and Data Analysis, 28, 367-378. https://doi.org/10.1016/S0167-9473(01)00065-2 |

[24] |
R Core Team (2017) R: A Language and Environment for Statistical Computing.
https://www.R-project.org/ |

[25] |
Elith, J., Leathwick, J.R. and Hastie, T. (2008) A Working Guide to Boosted Regression Trees. Journal of Animal Ecology, 77, 802-813.
https://doi.org/10.1111/j.1365-2656.2008.01390.x |

[26] |
Tierney, N.J., Harden, F.A., Harden, M.J. and Mengersen, K.L. (2015) Using Decision Trees to Understand Structure in Missing Data. BMJ Open, 5, 1-12.
https://doi.org/10.1136/bmjopen-2014-007450 |

[27] |
Jansen, V., Kolden, C., Taylor, R. and Newingham, B. (2016) Quantifying Livestock Effects on Bunchgrass Vegetation with Landsat ETM+ Data across a Single Growing Season. International Journal of Remote Sensing, 37, 150-175.
https://doi.org/10.1080/01431161.2015.1117681 |

[28] |
Derry, J.F. (2004) Piospheres in Semi-Arid Rangeland: Consequences of Spatially Constrained Plant-Herbivore Interactions. The University of Edinburgh, 1-305.
http://hdl.handle.net/1842/600 |

[29] |
Humphries, G.R.W. (2015) Estimating Regions of Oceanographic Importance for Seabirds Using A-Spatial Data. PLoS ONE, 10, 1-15.
https://doi.org/10.1371/journal.pone.0137241 |

[30] |
Schapire, R. (2003) The Boosting Approach to Machine Learning: An Overview. MSRI Workshop on Nonlinear Estimation and Classification, Springer, New York.
https://doi.org/10.1007/978-0-387-21579-2_9 |

[31] | Chipman, H.A., George, E.I. and McCulloch, R.E. (2001) The Elements of Statistical Learning: Data Mining, Inference and Prediction. Springer, New York. |

[32] |
Bell, J.F. (1999) Tree-Based Methods, Machine Learning Methods for Ecological Applications. Kluer, Dordrecht, 89-105.
https://doi.org/10.1007/978-1-4615-5289-5_3 |

[33] | Breiman, L., Friedman, J., Olshen, R. and Stone, C. (1984) Classification and Regression Trees. Chapman and Hall, Wadsworth, New York. |

[34] |
Tsangaratos, P. and Ilia, I. (2016) Landslide Susceptibility Mapping Using a Modified Decision Tree Classifier in the Xanthi Perfection, Greece. Landslides, 13, 305-320. https://doi.org/10.1007/s10346-015-0565-6 |

[35] | Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C. (2009) Introduction to Algorithms. The MIT Press, Cambridge, Massachusetts. |

[36] |
Chipman, H.A., George, E.I. and McCulloch, R.E. (2010) BART: Bayesian Additive Regression Trees. Annals of Applied Statistics, 4, 266-298.
https://doi.org/10.1214/09-AOAS285 |

[37] |
Hastie, T.J. and Tibshirani, R. (1986) Generalized Additive Models. Statistical Science, 1, 297-310. https://doi.org/10.1214/ss/1177013604 |

[38] |
Wood, S.N. (2011) Fast Stable Restricted Maximum Likelihood and Marginal Likelihood Estimation of Semiparametric Generalized Linear Models. Journal of the Royal Statistical Society (B), 73, 3-36.
https://doi.org/10.1111/j.1467-9868.2010.00749.x |

[39] |
Lary, D.J., Alavi, A.H., Gandomi, A.H. and Walker, A.L. (2016) Machine Learning in Geosciences and Remote Sensing. Geoscience Frontiers, 7, 3-10.
https://doi.org/10.1016/j.gsf.2015.07.003 |

Journals Menu

Contact us

+1 323-425-8868 | |

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2024 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.