In this paper we view learning as an unconstrained non-linear minimization
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.
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:5503 |
| Date | January 2002 |
| Creators | Fischer, Manfred M. |
| Publisher | Springer |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Article, PeerReviewed |
| Format | application/pdf |
| Relation | http://dx.doi.org/10.1007/s101090200090, http://link.springer.com/, http://epub.wu.ac.at/5503/ |
Page generated in 0.0286 seconds