Evaluating the Readability of Force Directed Graph Layouts: A Deep Learning Approach

by   Hammad Haleem, et al.

Existing graph layout algorithms are usually not able to optimize all the aesthetic properties desired in a graph layout. To evaluate how well the desired visual features are reflected in a graph layout, many readability metrics have been proposed in the past decades. However, the calculation of these readability metrics often requires access to the node and edge coordinates and is usually computationally inefficient, especially for dense graphs. Importantly, when the node and edge coordinates are not accessible, it becomes impossible to evaluate the graph layouts quantitatively. In this paper, we present a novel deep learning-based approach to evaluate the readability of graph layouts by directly using graph images. A convolutional neural network architecture is proposed and trained on a benchmark dataset of graph images, which is composed of synthetically-generated graphs and graphs created by sampling from real large networks. Multiple representative readability metrics (including edge crossing, node spread, and group overlap) are considered in the proposed approach. We quantitatively compare our approach to traditional methods and qualitatively evaluate our approach using a case study and visualizing convolutional layers. This work is a first step towards using deep learning based methods to evaluate images from the visualization field quantitatively.


page 1

page 2

page 3

page 4


Untangling Force-Directed Layouts Using Persistent Homology

Force-directed layouts belong to a popular class of methods used to posi...

What Would a Graph Look Like in This Layout? A Machine Learning Approach to Large Graph Visualization

Using different methods for laying out a graph can lead to very differen...

DeepGD: A Deep Learning Framework for Graph Drawing Using GNN

In the past decades, many graph drawing techniques have been proposed fo...

Snapshot Visualization of Complex Graphs with Force-Directed Algorithms

Force-directed algorithms are widely used for visualizing graphs. Howeve...

Visualizing Evolving Trees

Evolving trees arise in many real-life scenarios from computer file syst...

Node Overlap Removal Algorithms: A Comparative Study

Many algorithms have been designed to remove node overlapping, and many ...

TimeLighting: Guidance-enhanced Exploration of 2D Projections of Temporal Graphs

In temporal (or event-based) networks, time is a continuous axis, with r...

Please sign up or login with your details

Forgot password? Click here to reset