Deep Two-Way Matrix Reordering for Relational Data Analysis

03/26/2021
by   Chihiro Watanabe, et al.
0

Matrix reordering is a task to permute the rows and columns of a given observed matrix such that the resulting reordered matrix shows meaningful or interpretable structural patterns. Most existing matrix reordering techniques share the common processes of extracting some feature representations from an observed matrix in a predefined manner, and applying matrix reordering based on it. However, in some practical cases, we do not always have prior knowledge about the structural pattern of an observed matrix. To address this problem, we propose a new matrix reordering method, called deep two-way matrix reordering (DeepTMR), using a neural network model. The trained network can automatically extract nonlinear row/column features from an observed matrix, which can then be used for matrix reordering. Moreover, the proposed DeepTMR provides the denoised mean matrix of a given observed matrix as an output of the trained network. This denoised mean matrix can be used to visualize the global structure of the reordered observed matrix. We demonstrate the effectiveness of the proposed DeepTMR by applying it to both synthetic and practical datasets.

READ FULL TEXT

page 5

page 10

page 11

page 12

page 13

page 14

page 17

page 18

research
08/05/2021

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

Linear layouts are a graph visualization method that can be used to capt...
research
02/23/2021

Goodness-of-fit Test on the Number of Biclusters in Relational Data Matrix

Biclustering is a method for detecting homogeneous submatrices in a give...
research
06/27/2012

Inferring Latent Structure From Mixed Real and Categorical Relational Data

We consider analysis of relational data (a matrix), in which the rows co...
research
01/02/2021

Image-based Textile Decoding

A textile fabric consists of countless parallel vertical yarns (warps) a...
research
06/10/2019

Goodness-of-fit Test for Latent Block Models

Latent Block Models are used for probabilistic biclustering, which is sh...
research
10/04/2021

Row-clustering of a Point Process-valued Matrix

Structured point process data harvested from various platforms poses new...
research
05/28/2011

Using Hopfield to Solve Resource-Leveling Problem

Although the traditional permute matrix coming along with Hopfield is ab...

Please sign up or login with your details

Forgot password? Click here to reset