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

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)

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

Cites work

• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• A forced directed component placement procedure for printed circuit boards
• Algorithms for drawing graphs: An annotated bibliography
• An algorithm for drawing general undirected graphs
• How to Draw a Graph
• On the Optimal Layout of Planar Graphs with Fixed Boundary
• Self-organization and associative memory.

Cited in

(7)

• scientific article; zbMATH DE number 1860775 (Why is no real title available?)
• Advances in Neural Networks – ISNN 2005
• Self-organizing map for clustering in the graph domain
• Using the metro-map metaphor for drawing hypergraphs
• scientific article; zbMATH DE number 2013281 (Why is no real title available?)
• Graph multidimensional scaling with self-organizing maps
• Using SOMbrero for clustering and visualizing graphs

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)