Self-Organizing Maps for Drawing Large Graphs

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: Information Processing Letters.

[1]  Bernd Becker,et al.  On the Optimal Layout of Planar Graphs with Fixed Boundary , 1987, SIAM J. Comput..

[2]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[3]  David Harel,et al.  Drawing graphs nicely using simulated annealing , 1996, TOGS.

[4]  Andreas Ludwig,et al.  A Fast Adaptive Layout Algorithm for Undirected Graphs , 1994, GD.

[5]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[6]  Peter Druschel,et al.  Implementing atomic sequences on uniprocessors using rollforward , 1996 .

[7]  Teuvo Kohonen,et al.  Self-Organization and Associative Memory , 1988 .

[8]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[9]  Pei-Yung Hsiao,et al.  VLSI circuit placement with rectilinear modules using three-layer force-directed self-organizing maps , 1997, IEEE Trans. Neural Networks.

[10]  Teuvo Kohonen,et al.  The self-organizing map , 1990 .

[11]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[12]  Tomihisa Kamada,et al.  Visualizing Abstract Objects and Relations , 1989, World Scientific Series in Computer Science.

[13]  W. T. Tutte.  How to Draw a Graph , 1963 .

[14]  Ahmed Hemani,et al.  Cell placement by self-organisation , 1990, Neural Networks.

[15]  Hans Jürgen Prömel,et al.  Finding clusters in VLSI circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[16]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[17]  Franz-Josef Brandenburg,et al.  An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms , 1995, GD.

[18]  Carlo Batini,et al.  Automatic graph drawing and readability of diagrams , 1988, IEEE Trans. Syst. Man Cybern..

[19]  N. Quinn,et al.  A forced directed component placement procedure for printed circuit boards , 1979 .

[20]  Dieter A. Mlynski,et al.  Mapping and hierarchical self-organizing neural networks for VLSI placement , 1997, IEEE Trans. Neural Networks.

[21]  D. Stott Parker,et al.  Aesthetics-Based Graph Layout for Human Consumption , 1996, Softw. Pract. Exp..