Clustering matrices through optimal permutations
Flaviano Morone

TL;DR
This paper introduces a theoretical framework and a fast algorithm for clustering matrices into interpretable geometric patterns through optimal permutations, demonstrated on neuronal data with biologically meaningful results.
Contribution
It presents a novel approach to matrix clustering via optimal permutations and a versatile, efficient algorithm applicable to various matrix types.
Findings
Successfully clustered neuronal matrices into biologically relevant groups
The algorithm handles non-normal and singular matrices efficiently
Clustering revealed patterns matching known neuron classifications
Abstract
Matrices are two-dimensional data structures allowing one to conceptually organize information. For example, adjacency matrices are useful to store the links of a network; correlation matrices are simple ways to arrange gene co-expression data or correlations of neuronal activities. Clustering matrix values into geometric patterns that are easy to interpret helps us to understand and explain the functional and structural organization of the system components described by matrix entries. Here we introduce a theoretical framework to cluster a matrix into a desired pattern by performing a similarity transformation obtained by solving a minimization problem named the optimal permutation problem. On the computational side, we present a fast clustering algorithm that can be applied to any type of matrix, including non-normal and singular matrices. We apply our algorithm to the neuronal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenetics, Aging, and Longevity in Model Organisms
