Graph multidimensional scaling with self-organizing maps

DOI10.1016/S0020-0255(02)00191-3zbMath1006.68649MaRDI QIDQ1857090

Eric Bonabeau

Publication date: 11 February 2003

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

graphsmultidimensional scalingself-organizing maps

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Cites Work

• Self-organizing maps for drawing large graphs
• Self-organization and associative memory
• Algorithms for drawing graphs: An annotated bibliography
• An algorithm for drawing general undirected graphs
• A stochastic heuristic visualising graph clusters in a bi-dimensional space prior to partitioning
• On the Optimal Layout of Planar Graphs with Fixed Boundary
• An Efficient Heuristic Procedure for Partitioning Graphs
• A forced directed component placement procedure for printed circuit boards
• How to Draw a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph multidimensional scaling with self-organizing maps