AutoLL: Automatic Linear Layout of Graphs based on Deep Neural Network

08/05/2021
by   Chihiro Watanabe, et al.
8

Linear layouts are a graph visualization method that can be used to capture an entry pattern in an adjacency matrix of a given graph. By reordering the node indices of the original adjacency matrix, linear layouts provide knowledge of latent graph structures. Conventional linear layout methods commonly aim to find an optimal reordering solution based on predefined features of a given matrix and loss function. However, prior knowledge of the appropriate features to use or structural patterns in a given adjacency matrix is not always available. In such a case, performing the reordering based on data-driven feature extraction without assuming a specific structure in an adjacency matrix is preferable. Recently, a neural-network-based matrix reordering method called DeepTMR has been proposed to perform this function. However, it is limited to a two-mode reordering (i.e., the rows and columns are reordered separately) and it cannot be applied in the one-mode setting (i.e., the same node order is used for reordering both rows and columns), owing to the characteristics of its model architecture. In this study, we extend DeepTMR and propose a new one-mode linear layout method referred to as AutoLL. We developed two types of neural network models, AutoLL-D and AutoLL-U, for reordering directed and undirected networks, respectively. To perform one-mode reordering, these AutoLL models have specific encoder architectures, which extract node features from an observed adjacency matrix. We conducted both qualitative and quantitative evaluations of the proposed approach, and the experimental results demonstrate its effectiveness.

READ FULL TEXT

page 10

page 11

page 12

page 13

page 15

page 16

page 17

page 18

research
03/26/2021

Deep Two-Way Matrix Reordering for Relational Data Analysis

Matrix reordering is a task to permute the rows and columns of a given o...
research
06/13/2022

Graph Comparison Based on Adjacency Function Matrix

In this paper, we present a new metric distance for comparing two large ...
research
01/20/2023

Exploring ordered patterns in the adjacency matrix for improving machine learning on complex networks

The use of complex networks as a modern approach to understanding the wo...
research
06/05/2018

Graph Compression Using Pattern Matching Techniques

Graphs can be used to represent a wide variety of data belonging to diff...
research
09/24/2021

Simultaneous Matrix Orderings for Graph Collections

Undirected graphs are frequently used to model networks. The topology of...
research
10/11/2021

A Deep Generative Model for Matrix Reordering

Depending on the node ordering, an adjacency matrix can highlight distin...
research
10/25/2021

Accelerate 3D Object Processing via Spectral Layout

3D image processing is an important problem in computer vision and patte...

Please sign up or login with your details

Forgot password? Click here to reset