Straight monotonic embedding of data sets in Euclidean spaces


  • Courrieu P

document type



This paper presents a fast incremental algorithm for embedding data sets belonging to various topological spaces in Euclidean spaces. This is useful for networks whose input consists of non-Euclidean (possibly non-numerical) data, for the on-line computation of spatial maps in autonomous agent navigation problems, and for building internal representations from empirical similarity data. (C) 2002 Elsevier Science Ltd. All rights reserved.

more information