Competitive learning of network diagram layout

Proceedings - 1998 IEEE Symposium on Visual Languages, VL 1998

Volumn 1998-September, Issue , 1998, Pages 56-63

  Meyer, B ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS;

AUTOMATIC LAYOUT; COMPETITIVE LEARNING; COMPUTATIONAL RESOURCES; DIAGRAMMATIC REPRESENTATIONS; LAYOUT ALGORITHMS; OBJECTIVE FUNCTIONS; SELF ORGANIZATIONS; UNSUPERVISED NEURAL NETWORKS;

VISUAL LANGUAGES;

EID: 61849103779     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/VL.1998.706134     Document Type: Conference Paper

References (27)

1. J. Anderson and E. Rosenfeld, editors. Neurocomputing. MIT Press, Cambridge/MA, 1988.
2. F. Brandenburg. Designing graph drawings by layout graph grammars. In R. Tamassia and I. Tollis, editors, Graph Drawing (GD'94), pages 416-427, Princeton/NJ, October 1994. Springer.
3. F. Brandenburg, editor. Graph Drawing (GD'95). Springer, Passau, Germany, September 1995.
4. F. Brandenburg, M. Himsolt, C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In [3], pages 76-87.
5. I. Cruz and J. Twarog. 3D graph drawing with simulated annealing. In [3], pages 162-165.
6. R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301-331, October 1996.
7. G. DiBattista, P. Eades, R. Tamassia, G. Tollis. Algorithms for drawing graphs: An annotated bibliography. Journal of Computational Geometry Theory and Applications, 4:235-282, 1994.
8. M. Dorigo, V. Maniezzo, A. Colorni. The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, Cybernetics, 26(1):29-41, 1996.
9. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
10. A. Frick, C. Keskin, V. Vogelmann. Integration of declarative approaches. In [24].
11. B. Fritzke. Some competitive learning methods. unpublished manuscript. http://www. neuroinformatik. ruhr-unibochum. de/ini/VDM/research/gsn/JavaPaper/, April 1997.
12. G. Goodhill and T. Sejnowski. A unifying objective function for topographic mappings. Neural Computation, 9:1291-1303, 1997.
13. S. Grossberg. Competitive learning: From interactive activation to adaptive resonance. Cognitive Science, 11:23-63, 1987.
14. W. He and K. Marriott. Constrained graph layout. In [24].
15. J. Hertz, A. Krogh, R. Palmer. Introduction to the Theory of Neural Computation. Addison-Wesley, Redwood City/CA, 1991.
16. D. Hubel and T. Wiesel. Receptive fields, binocular interaction and functional architecture in the cat's visual cortex. Journal of Physiology, 160:173-181, 1962.
17. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7-15, 1989.
18. T. Kohonen. Self-organized formation of topologically correct feature maps. Biological Cybernetics, 43:59-69, 1982.
19. T. Kohonen. Self-Organization and Associative Memory. Springer, New York, 1989.
20. T. Kohonen. Self-Organizing Maps. Springer, New York, 1997.
21. C. Kosak, J. Marks, S. Shieber. Automating the layout of network diagrams with specified visual organization. IEEE Transactions on Systems, Man, Cybernetics, 24(2):440-454, 1994.
22. S. Luttrell. A bayesian analysis of self-organizing maps. Neural Computation, 6:767-794, 1994.
23. T. Masui. Graphic object layout with interactive genetic algorithms. In IEEE Symposium on Visual Languages, pages 74-80, Seattle/WA, 1992.
24. S. North, editor. Graph Drawing (GD'96). Springer, Berkeley, September 1996.
25. K. Sugiyama. A cognitive approach for graph drawing. Cybernetics and Systems: An International Journal, 18:447-488, 1987.
26. R. Tamassia. Constraints in graph drawing algorithms. Constraints, An International Journal, 3:87-120, 1998.
27. C. von der Malsburg. Self-organization of orientation sensitive cells in the striate cortex. Kybernetik, 14:85-100, 1973.