Matrix Reordering Methods for Table and Network Visualization
This survey provides a description of algorithms to reorder visual matrices of tabular data and adjacency matrix of Networks. The goal of this survey is to provide a comprehensive list of reordering algorithms published in different fields such as statistics, bioinformatics, or graph theory. While s...
Saved in:
Published in | Computer graphics forum Vol. 35; no. 3; pp. 693 - 716 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
Oxford
Blackwell Publishing Ltd
01.06.2016
Wiley |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This survey provides a description of algorithms to reorder visual matrices of tabular data and adjacency matrix of Networks. The goal of this survey is to provide a comprehensive list of reordering algorithms published in different fields such as statistics, bioinformatics, or graph theory. While several of these algorithms are described in publications and others are available in software libraries and programs, there is little awareness of what is done across all fields. Our survey aims at describing these reordering algorithms in a unified manner to enable a wide audience to understand their differences and subtleties. We organize this corpus in a consistent manner, independently of the application or research field. We also provide practical guidance on how to select appropriate algorithms depending on the structure and size of the matrix to reorder, and point to implementations when available. |
---|---|
Bibliography: | ArticleID:CGF12935 istex:41DB72F2C645E3B58FA647CAE4474CD1190FABD9 ark:/67375/WNG-3WV121PB-J SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 0167-7055 1467-8659 |
DOI: | 10.1111/cgf.12935 |