Bayesian classification of vegetation types with Gaussian mixture density fitting to indicator values.

Question: Is it possible to mathematically classify relevés into vegetation types on the basis of their average indicator values, including the uncertainty of the classification? Location: The Netherlands. Method: A large relevé database was used to develop a method for predicting vegetation types based on indicator values. First, each relevé was classified into a phytosociological association on the basis of its species composition. Additionally, mean indicator values for moisture, nutrients and acidity were computed for each relevé. Thus, the position of each classified relevé was obtained in a three-dimensional space of indicator values. Fitting the data to so called Gaussian Mixture Models yielded densities of associations as a function of indicator values. Finally, these density functions were used to predict the Bayesian occurrence probabilities of associations for known indicator values. Validation of predictions was performed by using a randomly chosen half of the database for the calibration of densities and the other half for the validation of predicted associations. Results and Conclusions: With indicator values, most relevés were classified correctly into vegetation types at the association level. This was shown using confusion matrices that relate (1) the number of relevés classified into associations based on species composition to (2) those based on indicator values. Misclassified relevés belonged to ecologically similar associations. The method seems very suitable for predictive vegetation models

Constrained dogleg methods for nonlinear systems with simple bounds

We focus on the numerical solution of medium scale bound-constrained systems of nonlinear equations. In this context, we consider an affine-scaling trust region approach that allows a great flexibility in choosing the scaling matrix used to handle the bounds. The method is based on a dogleg procedure tailored for constrained problems and so, it is named Constrained Dogleg method. It generates only strictly feasible iterates. Global and locally fast convergence is ensured under standard assumptions. The method has been implemented in the Matlab solver CoDoSol that supports several diagonal scalings in both spherical and elliptical trust region frameworks. We give a brief account of CoDoSol and report on the computational experience performed on a number of representative test problem