Learning in Neural Spatial Interaction Models: A Statistical Perspective

Abstract

This chapter views learning as an unconstrained nonlinear minimisation problem in which the objective function is defined by the negative log-likelihood function and the search space by the parameter space of an origin-constrained product unit neural spatial interaction model. We consider Alopex based global search, as opposed to local search based upon backpropagation of gradient descents, each in combination with the bootstrapping pairs approach to solve the maximum likelihood learning problem. Interregional telecommunication traffic flow data from Austria are used as test bed for comparing the performance of the two learning procedures. The study illustrates the superiority of Alopex based global search, measured in terms of Kullback and Leibler’s information criterion.