Matrix Reordering Methods for Table and Network Visualization

被引:140
作者
Behrisch, Michael [1 ]
Bach, Benjamin [2 ]
Riche, Nathalie Henry [3 ]
Schreck, Tobias [4 ]
Fekete, Jean-Daniel [5 ]
机构
[1] Univ Konstanz, Constance, Germany
[2] Microsoft Res Inria Joint Ctr, Orsay, France
[3] Microsoft Res, Redmond, WA USA
[4] Graz Univ Technol, A-8010 Graz, Austria
[5] Inria, Le Chesnay, France
关键词
ALGORITHM; SERIATION; PROFILE;
D O I
10.1111/cgf.12935
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:693 / 716
页数:24
相关论文
共 111 条
[1]  
Alper B., 2013, P SIGCHI C HUM FACT, P483
[2]   Parallel GPU Implementation of Iterative PCA Algorithms [J].
Andrecut, M. .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2009, 16 (11) :1593-1599
[3]  
[Anonymous], AM STAT
[4]  
[Anonymous], BIT, DOI DOI 10.1007/BF01933580
[5]  
[Anonymous], 1998, Connections
[6]  
[Anonymous], 2003, J EXPER ALGOR
[7]  
[Anonymous], 2008, A toolbox for bicluster analysis in r
[8]  
[Anonymous], 1971, THESIS
[9]  
[Anonymous], 2001, The Boost Graph Library: User Guide and Reference Manual, Portable Documents
[10]  
[Anonymous], AM STAT