Deep Two-way Matrix Reordering for Relational Data Analysis

• URL: http://arxiv.org/abs/2103.14203v1
• Date: Fri, 26 Mar 2021 01:31:24 GMT
• Title: Deep Two-way Matrix Reordering for Relational Data Analysis
• Authors: Chihiro Watanabe, Taiji Suzuki
• Abstract summary: 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.
• Score: 41.60125423028092
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Matrix reordering is a task to permute rows and columns of a given observed matrix so that the resulting reordered matrix shows some meaningful or interpretable structural patterns. Most of the existing matrix reordering techniques share a common process of extracting some feature representation from an observed matrix in some pre-defined way, and applying matrix reordering based on it. However, in some practical cases, we would not always have a prior knowledge about the structural pattern that an observed matrix has. In this paper, to address this problem, we propose a new matrix reordering method, 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 be used for matrix reordering. Moreover, and proposed DeepTMR provides us with the denoised mean matrix of a given observed matrix as an output of the trained network. Such a denoised mean matrix can be used for visualizing the global structure of the reordered observed matrix. We demonstrate the effectiveness of proposed DeepTMR by applying it to both synthetic and practical data sets.

Related papers

• Efficient Adaptation of Pre-trained Vision Transformer via Householder Transformation [53.88562288388169]
  A common strategy for. Efficient Fine-Tuning (PEFT) of pre-trained Vision Transformers (ViTs) involves adapting the model to downstream tasks. We propose a novel PEFT approach inspired by Singular Value Decomposition (SVD) for representing the adaptation matrix. SVD decomposes a matrix into the product of a left unitary matrix, a diagonal matrix of scaling values, and a right unitary matrix.
  arXiv  Detail & Related papers  (2024-10-30T12:08:30Z)
• One-sided Matrix Completion from Two Observations Per Row [95.87811229292056]
  We propose a natural algorithm that involves imputing the missing values of the matrix $XTX$. We evaluate our algorithm on one-sided recovery of synthetic data and low-coverage genome sequencing.
  arXiv  Detail & Related papers  (2023-06-06T22:35:16Z)
• 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)
• Matrix Decomposition Perspective for Accuracy Assessment of Item Response Theory [0.0]
  This paper focuses on the performance of the reconstructed response matrix. We have found that the performance of the singular value decomposition method and the matrix decomposition method is almost the same when the response matrix is a complete matrix.
  arXiv  Detail & Related papers  (2022-03-07T03:17:41Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• 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)
• AutoLL: Automatic Linear Layout of Graphs based on Deep Neural Network [41.60125423028092]
  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.
  arXiv  Detail & Related papers  (2021-08-05T08:04:15Z)
• Meta-learning for Matrix Factorization without Shared Rows or Columns [39.56814839510978]
  The proposed method uses a neural network that takes a matrix as input, and generates prior distributions of factorized matrices of the given matrix. The neural network is meta-learned such that the expected imputation error is minimized. In our experiments with three user-item rating datasets, we demonstrate that our proposed method can impute the missing values from a limited number of observations in unseen matrices.
  arXiv  Detail & Related papers  (2021-06-29T07:40:20Z)
• Non-PSD Matrix Sketching with Applications to Regression and Optimization [56.730993511802865]
  We present dimensionality reduction methods for non-PSD and square-roots" matrices. We show how these techniques can be used for multiple downstream tasks.
  arXiv  Detail & Related papers  (2021-06-16T04:07:48Z)
• Deep Learning Approach for Matrix Completion Using Manifold Learning [3.04585143845864]
  This paper introduces a new latent variables model for data matrix which is a combination of linear and nonlinear models. We design a novel deep-neural-network-based matrix completion algorithm to address both linear and nonlinear relations among entries of data matrix.
  arXiv  Detail & Related papers  (2020-12-11T01:01: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.