Self-organizing maps (SOM) are unsupervised, competitive neural networks used to project high-dimensional data onto a low-dimensial space. In this article we show how SOM can be sued to draw graphs in the plane. The SOM-based approach to graph drawing, which belongs to the general class of force-directed algorithms, allows the drawing of arbitrary weighted graphs. It is particularly efficient to draw large graphs and can be used as a preprocessing step before application of a more sophisticated method.
To appear in: Ecosystems.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Publisher Info
Paper provided by Santa Fe Institute in its series Working Papers with number
98-07-067.