Self-organizing maps for drawing large graphs

DOI10.1016/S0020-0190(98)00108-2zbMATH Open1338.68212MaRDI QIDQ293353FDOQ293353

Authors: Eric Bonabeau, Florian Hénaux 

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001082?np=y

Recommendations

• Graph multidimensional scaling with self-organizing maps
• Self-organizing map for clustering in the graph domain
• Self-organizing maps.
• Self-organizing maps, theory and applications
• SOM-based data visualization methods

zbMATH Keywords

neural networksself-organizing mapsgraph drawingforce-directed algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Self-organization and associative memory.
• Algorithms for drawing graphs: An annotated bibliography
• An algorithm for drawing general undirected graphs
• On the Optimal Layout of Planar Graphs with Fixed Boundary
• Title not available (Why is that?)
• A forced directed component placement procedure for printed circuit boards
• How to Draw a Graph

Cited In (7)

• Using the metro-map metaphor for drawing hypergraphs
• Title not available (Why is that?)
• Advances in Neural Networks – ISNN 2005
• Self-organizing map for clustering in the graph domain
• Graph multidimensional scaling with self-organizing maps
• Using SOMbrero for clustering and visualizing graphs
• Title not available (Why is that?)

This page was built for publication: Self-organizing maps for drawing large graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293353)