AutoLL: Automatic Linear Layout of Graphs based on Deep Neural Network
- URL: http://arxiv.org/abs/2108.02431v1
- Date: Thu, 5 Aug 2021 08:04:15 GMT
- Title: AutoLL: Automatic Linear Layout of Graphs based on Deep Neural Network
- Authors: Chihiro Watanabe, Taiji Suzuki
- Abstract summary: We 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.
- Score: 41.60125423028092
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- Discrete Graph Auto-Encoder [52.50288418639075]
We introduce a new framework named Discrete Graph Auto-Encoder (DGAE)
We first use a permutation-equivariant auto-encoder to convert graphs into sets of discrete latent node representations.
In the second step, we sort the sets of discrete latent representations and learn their distribution with a specifically designed auto-regressive model.
arXiv Detail & Related papers (2023-06-13T12:40:39Z) - Graph Polynomial Convolution Models for Node Classification of
Non-Homophilous Graphs [52.52570805621925]
We investigate efficient learning from higher-order graph convolution and learning directly from adjacency matrix for node classification.
We show that the resulting model lead to new graphs and residual scaling parameter.
We demonstrate that the proposed methods obtain improved accuracy for node-classification of non-homophilous parameters.
arXiv Detail & Related papers (2022-09-12T04:46:55Z) - Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix.
Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
arXiv Detail & Related papers (2022-05-21T01:47:17Z) - A Deep Generative Model for Matrix Reordering [26.86727566323601]
We develop a generative model that learns a latent space of diverse matrix reorderings of a graph.
We construct an intuitive user interface from the learned latent space by creating a map of various matrix reorderings.
This paper introduces a fundamentally new approach to matrix visualization of a graph, where a machine learning model learns to generate diverse matrix reorderings of a graph.
arXiv Detail & Related papers (2021-10-11T02:55:24Z) - Adaptive Attribute and Structure Subspace Clustering Network [49.040136530379094]
We propose a novel self-expressiveness-based subspace clustering network.
We first consider an auto-encoder to represent input data samples.
Then, we construct a mixed signed and symmetric structure matrix to capture the local geometric structure underlying data.
We perform self-expressiveness on the constructed attribute structure and matrices to learn their affinity graphs.
arXiv Detail & Related papers (2021-09-28T14:00:57Z) - Unfolding Projection-free SDP Relaxation of Binary Graph Classifier via
GDPA Linearization [59.87663954467815]
Algorithm unfolding creates an interpretable and parsimonious neural network architecture by implementing each iteration of a model-based algorithm as a neural layer.
In this paper, leveraging a recent linear algebraic theorem called Gershgorin disc perfect alignment (GDPA), we unroll a projection-free algorithm for semi-definite programming relaxation (SDR) of a binary graph.
Experimental results show that our unrolled network outperformed pure model-based graph classifiers, and achieved comparable performance to pure data-driven networks but using far fewer parameters.
arXiv Detail & Related papers (2021-09-10T07:01:15Z) - Deep Two-way Matrix Reordering for Relational Data Analysis [41.60125423028092]
Matrix reordering is a task to permute rows and columns of a given observed matrix.
We propose a new matrix reordering method, Deep Two-way Matrix Reordering (DeepTMR), using a neural network model.
We demonstrate the effectiveness of proposed DeepTMR by applying it to both synthetic and practical data sets.
arXiv Detail & Related papers (2021-03-26T01:31:24Z) - Adaptive Graph-based Generalized Regression Model for Unsupervised
Feature Selection [11.214334712819396]
How to select the uncorrelated and discriminative features is the key problem of unsupervised feature selection.
We present a novel generalized regression model imposed by an uncorrelated constraint and the $ell_2,1$-norm regularization.
It can simultaneously select the uncorrelated and discriminative features as well as reduce the variance of these data points belonging to the same neighborhood.
arXiv Detail & Related papers (2020-12-27T09:07:26Z) - Bipartite Link Prediction based on Topological Features via 2-hop Path [0.8223798883838329]
Linear-Graph Autoencoder(LGAE) has promising performance on challenging tasks such as link prediction and node clustering.
In this paper, we consider the case of bipartite link predictions where node attributes are unavailable.
Our approach consistently outperforms Graph Autoencoder and Linear Graph Autoencoder model in 10 out of 12 bipartite dataset and reaches competitive performances in 2 other bipartite dataset.
arXiv Detail & Related papers (2020-03-19T05:07:54Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.