A regression tree algorithm for the identification of convergence clubs

  • Authors:

  • Paolo Postiglione;Roberto Benedetti;Giovanni Lafratta

  • Affiliations:

  • "G. d'Annunzio" University of Chieti - Pescara, Department of Business, Statistical, Technological and Environmental Sciences, Viale della Pineta, 4, 65127, Pescara, Italy;"G. d'Annunzio" University of Chieti - Pescara, Department of Business, Statistical, Technological and Environmental Sciences, Viale della Pineta, 4, 65127, Pescara, Italy;"G. d'Annunzio" University of Chieti - Pescara, Department of Business, Statistical, Technological and Environmental Sciences, Viale della Pineta, 4, 65127, Pescara, Italy

  • Venue:
  • Computational Statistics & Data Analysis
  • Year:
  • 2010

Quantified Score

Hi-index 0.03

Visualization

Abstract

The concept of convergence clubs is analyzed and compared with classical methods for the study of economic @b-convergence, which often consider the entire data set as one sample. A technique for the identification of convergence clubs is proposed. The algorithm is based on a modified version of the usual regression trees procedure. The objective function of the method is represented by the difference among the parameters of the model under investigation. Different strategies are adopted in the definition of the model used in the objective function of the algorithm. The first is the classical non-spatial @b-convergence model. The others are modified @b-convergence models which take into account the dependence showed by spatially distributed data. The proposed procedure identifies situation of local stationarity in the economic growth of the different regions: a group of regions is divided into two sub-groups if the parameter estimates are significantly different among them. The algorithm is applied to 191 European regions for the period 1980-2002. Given the adaptability of the algorithm, its implementation provides a flexible tool for the use of any regression model in the analysis of non-stationary spatial data.