Discrete vector quantization for arbitrary distance function estimation.
There are currently many vastly different areas of research involving adaptive learning. Among them are the two areas that concern neural networks and learning automata. This paper develops a method by which the general philosophies of vector quantization (VQ) and discretized automata learning can be incorporated for the computation of arbitrary distance functions. The latter is a problem which has important applications in logistics and location analysis. The input to our problem is the set of coordinates of a large number of nodes whose internode arbitrary "distances" have to be estimated. To render the problem interesting, nontrivial, and realistic, we assume that the explicit form of this distance function is both unknown and uncomputable. Unlike traditional operations research methods, which use optimized parametric functional estimators, we have utilized discretized VQ principles to first adaptively polarize the nodes into subregions. Subsequently, the parameters characterizing the subregions are learned by using a variety of methods (including, for academic purposes, a VQ strategy in the meta-domain). After an initial training phase, a system which achieves distance estimation attempts to yield an estimate of any node-pair distance without actually deriving an explicit form for the unknown function. The algorithms have been rigorously tested for the actual road-travel distances involving cities in Turkey and the results obtained are conclusive. Indeed, these present results are the best currently available from any single or hybrid strategy.
Oommen
J
J
Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.
Altinel
I K
IK
Aras
N
N