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

Oh Hyun Kwon, Tarik Crnovrsanin, Kwan-Liu Ma

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a 'good' layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.

Original languageEnglish (US)
Article number8017580
Pages (from-to)478-488
Number of pages11
JournalIEEE Transactions on Visualization and Computer Graphics
Volume24
Issue number1
DOIs
StatePublished - Jan 1 2018

Fingerprint

Learning systems
Visualization
Inspection

Keywords

  • aesthetics
  • graph kernel
  • graph layout
  • Graph visualization
  • graphlet
  • machine learning

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design

Cite this

What Would a Graph Look Like in this Layout? A Machine Learning Approach to Large Graph Visualization. / Kwon, Oh Hyun; Crnovrsanin, Tarik; Ma, Kwan-Liu.

In: IEEE Transactions on Visualization and Computer Graphics, Vol. 24, No. 1, 8017580, 01.01.2018, p. 478-488.

Research output: Contribution to journalArticle

@article{f5e2fb4979f641cd9c0bb20abde54cdc,
title = "What Would a Graph Look Like in this Layout? A Machine Learning Approach to Large Graph Visualization",
abstract = "Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a 'good' layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.",
keywords = "aesthetics, graph kernel, graph layout, Graph visualization, graphlet, machine learning",
author = "Kwon, {Oh Hyun} and Tarik Crnovrsanin and Kwan-Liu Ma",
year = "2018",
month = "1",
day = "1",
doi = "10.1109/TVCG.2017.2743858",
language = "English (US)",
volume = "24",
pages = "478--488",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",
number = "1",

}

TY - JOUR

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

AU - Kwon, Oh Hyun

AU - Crnovrsanin, Tarik

AU - Ma, Kwan-Liu

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a 'good' layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.

AB - Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a 'good' layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.

KW - aesthetics

KW - graph kernel

KW - graph layout

KW - Graph visualization

KW - graphlet

KW - machine learning

UR - http://www.scopus.com/inward/record.url?scp=85028724487&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85028724487&partnerID=8YFLogxK

U2 - 10.1109/TVCG.2017.2743858

DO - 10.1109/TVCG.2017.2743858

M3 - Article

C2 - 28866499

AN - SCOPUS:85028724487

VL - 24

SP - 478

EP - 488

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 1

M1 - 8017580

ER -