Topographic Processing of Relational Data


Recently, batch optimization schemes of the self-organizing map and neural gas have been modified to allow arbitrary distance measures.This principle is particularly suitable for complex applications where data are compared by means of problem-specific, possibly discrete metrics such as protein sequences. However, median variants do not allow a continuous update of prototype locations and their capacity is thus restricted. In this contribution, we consider the relational dual of batch optimization which can be formulated in terms of pairwise distances only such that an application to arbitrary distance matrices becomes possible. For SOM, a direct visualization of data is given by means of the underlying (euclidean or hyperbolic) lattice structure. For NG, pairwise distances of prototypes can be computed based on a given data matrix only, such that subsequent mapping by means of multidimensional scaling can be applied

Similar works

Full text


BieColl - Bielefeld Electronic Collections

Provided a free PDF
oaioai:biecoll2.ub.uni-bielefeld.de:article/306Last time updated on 9/9/2020View original full text link

This paper was published in BieColl - Bielefeld Electronic Collections.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.