Self-organizing maps for drawing large graphs

被引:15
作者
Bonabeau, E
Henaux, F
机构
[1] Santa Fe Inst, Santa Fe, NM 87501 USA
[2] ATR, Adapt Commun Res, Kyoto 61902, Japan
[3] Ecole Natl Super Telecommun, F-75634 Paris, France
关键词
neural networks; self-organizing maps; graph drawing; force-directed algorithm; algorithms;
D O I
10.1016/S0020-0190(98)00108-2
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Self-organizing maps (SOM) are unsupervised, competitive neural networks used to project high-dimensional data onto a low-dimensional space. In this article we show how SOM can be used 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. (C) 1998 Published by Elsevier Science B.V. All rights reserved.
引用
收藏
页码:177 / 184
页数:8
相关论文
共 20 条
[1]   ON THE OPTIMAL LAYOUT OF PLANAR GRAPHS WITH FIXED BOUNDARY [J].
BECKER, B ;
HOTZ, G .
SIAM JOURNAL ON COMPUTING, 1987, 16 (05) :946-972
[2]  
Brandenburg FJ, 1996, LECT NOTES COMPUT SC, V1027, P76, DOI 10.1007/BFb0021792
[3]   VLSI circuit placement with rectilinear modules using three-layer force-directed self-organizing maps [J].
Chang, RI ;
Hsiao, PY .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1997, 8 (05) :1049-1064
[4]  
COLEMAN MK, 1996, SOFTWARE PRACTICE EX, V26, P1
[5]   Drawing graphs nicely using simulated annealing [J].
Davidson, R ;
Harel, D .
ACM TRANSACTIONS ON GRAPHICS, 1996, 15 (04) :301-331
[6]  
Eades Peter, 1984, Congressus Numerantium, V42, P149, DOI DOI 10.1007/3-540-63938-1_
[7]  
FRICK A, 1994, LECT NOTES COMPUTER, V894, P388
[8]   GRAPH DRAWING BY FORCE-DIRECTED PLACEMENT [J].
FRUCHTERMAN, TMJ ;
REINGOLD, EM .
SOFTWARE-PRACTICE & EXPERIENCE, 1991, 21 (11) :1129-1164
[9]  
GARBERS J, 1990, P IEEE INT C COMP AI, P520
[10]   CELL PLACEMENT BY SELF-ORGANIZATION [J].
HEMANI, A ;
POSTULA, A .
NEURAL NETWORKS, 1990, 3 (04) :377-383