scholarly journals A Multilevel Algorithm for Force-Directed Graph Drawing

Author(s):  
C. Walshaw
Author(s):  
Atsushi Shibata ◽  
◽  
Fangyan Dong ◽  
Kaoru Hirota ◽  

A hierarchical force-directed graph drawing is proposed for the analysis of a neural network structure that expresses the relationship between multitask and processes in neural networks represented as neuron clusters. The process revealed by our proposal indicates the neurons that are related to each task and the number of neurons or learning epochs that are sufficient. Our proposal is evaluated by visualizing neural networks learned on the Mixed National Institute of Standards and Technology (MNIST) database of handwritten digits, and the results show that inactive neurons, namely those that do not have a close relationship with any tasks, are located on the periphery part of the visualized network, and that cutting half of the training data on one specific task (out of ten) causes a 15% increase in the variance of neurons in clusters that react to the specific task compared to the reaction to all tasks. The proposal aims to be developed in order to support the design process of neural networks that consider multitasking of different categories, for example, one neural network for both the vision and motion system of a robot.


2014 ◽  
Vol 722 ◽  
pp. 338-343
Author(s):  
Jie Wu ◽  
Qiu Quan Wang

Automatic drawing algorithm has been one of the hotspot in research of drawing. So far there is no completely effective method. Force-directed graph drawing algorithm is based on physics model, makes the drawing problem into force for solving the problem in physics, then into unconstrained optimization for solving the problem in mathematics. Its advantage is based on people familiar with the physical model, and the principle is easy to understand. We can draw large-scale graphics with symmetrical and beautiful appearance through certain set and the improvement. At the advantages of Force-directed algorithm, this paper presents force-directed algorithm can be applied to automatic drawing in scheduling network, and explores the image style in a more intuitive graphical way to show the connection between scheduling network vertices.


Algorithms ◽  
2016 ◽  
Vol 9 (3) ◽  
pp. 53 ◽  
Author(s):  
Fabian Lipp ◽  
Alexander Wolff ◽  
Johannes Zink
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document