Matrix Reordering Methods for Table and Network Visualization

Computer Graphics Forum

Volumn 35, Issue 3, 2016, Pages 693-716

  Behrisch, Michael ^a   Bach, Benjamin ^b   Henry Riche, Nathalie ^c   Schreck, Tobias ^d   Fekete, Jean Daniel ^e  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b Parc Orsay Université   (France)

^c MICROSOFT RESEARCH   (United States)

^d GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^e INRIA   (France)

Author keywords

Categories and Subject Descriptors (according to ACM CCS); Visualization Human centered computing : Visualization Techniques

Indexed keywords

BIOINFORMATICS; COMPUTATION THEORY; GRAPH THEORY; MATRIX ALGEBRA; SURVEYS; VISUALIZATION;

ADJACENCY MATRICES; DESCRIPTORS; HUMAN-CENTERED COMPUTING; MATRIX REORDERING; NETWORK VISUALIZATION; PRACTICAL GUIDANCE; RESEARCH FIELDS; SOFTWARE LIBRARIES;

ALGORITHMS;

EID: 84979066943     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/cgf.12935     Document Type: Article

References (113)

1. Atkins J., Boman E., Hendrickson B.: A spectral algorithm for seriation and the consecutive ones problem. SIAM Journal on Computing 28, 1 (1998), 297–310. 5, 7, 9, 10
2. Alper B., Bach B., Henry Riche N., Isenberg T., Fekete J.-D.: Weighted graph comparison techniques for brain connectivity analysis. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (New York, NY, USA, 2013), CHI ’13, ACM, pp. 483–492. 1
3. Applegate D., Cook W., Rohe A.: Chained lin-kernighan for large traveling salesman problems. INFORMS Journal on Computing 15, 1 (2003), 82–92. 15
4. Andrecut M.: Parallel gpu implementation of iterative pca algorithms. Journal of Computational Biology 16, 11 (2009), 1593–1599. 10
5. Breiger R.L., Boorman S.A., Arabie P.: An algorithm for clustering relational data with applications to social Network analysis and comparison with multidimensional scaling. Journal of mathematical psychology 12, 3 (1975), 328–383. 5, 9
6. Bentley J.J.: Fast algorithms for geometric traveling salesman problems. ORSA Journal on computing 4, 4 (1992), 387–411. 5, 15, 17
7. Bertin J.: Sémiologie Graphique – Les diagrammes, les reseaux, les cartes. Éditions Gauthier-Villars, Paris, 1973. 1, 4, 5, 15
8. Bertin J.: Théorie matricielle de la graphique. Communication et langages 48, 1 (1981), 62–74. 4, 5, 20
9. Bar-Joseph Z., Gifford D.K., Jaakkola T.S.: Fast optimal leaf ordering for hierarchical clustering. Bioinformatics 17, suppl 1 (2001), S22–S29. 5, 7, 8
10. Brusco M.J., Köhn H.-F., Stahl S.: Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis. Psychometrika 73, 3 (2008), 503–522. 5, 7, 12, 13
11. Behrisch M., Krstajic M., Schreck T., Keim D.A.: The News Auditor: Visual Exploration of Clusters of Stories. In Proc. EuroVA International Workshop on Visual Analytics (2012), Eurographics, pp. 61–65. 5, 20
12. Borg I., Lingoes J.: Multidimensional similarity structure analysis. Springer Science & Business Media, 2012. 11
13. Batagelj V., Mrvar A.: Pajek-program for large Network analysis. Connections 21, 2 (1998), 47–57. 17
14. BOOST C++ Library:. http://www.boost.org. 17
15. Brandes U., Pich C.: Eigensolver methods for progressive multidimensional scaling of large data. In Graph Drawing (2007), Springer, pp. 42–53. 11
16. Brandes U.: Optimal leaf ordering of complete binary trees. Journ. of Discrete Algorithms 5, 3 (2007), 546–552. 5, 8
17. Brusco M.J., Stahl S.: Optimal least-squares unidimensional scaling: Improved branch-and-bound procedures and comparison to dynamic programming. Psychometrika 70, 2 (2005), 253–270. 5, 7, 17
18. BRUSCO M., Stahl S.: Branch-and-Bound Applications in Combinatorial Data Analysis. Statistics and Computing. Springer, 2006. 5
19. Brakel R.B., J. V., Westenberg M.A.: COMBat: Visualizing Co-Occurrence of Annotation Terms. 17–24. 5, 20
20. Cheng Y., Church G.M.: Biclustering of expression data. In Ismb (2000), vol. 8, pp. 93–103. 5, 15, 16
21. Chan W.-M., George A.: A linear time implementation of the reverse cuthill-mckee algorithm. BIT Numerical Mathematics 20, 1 (1980), 8–14. 5, 13
22. Chen C.H.: Generalized association plots: information visualization via iteratively generated correlation matrices. Statistica Sinica 12 (2002), 7–29. 5, 9
23. Cuthill E., McKee J.: Reducing the bandwidth of sparse symmetric matrices. In Proceedings of the 1969 24th National Conference (New York, NY, USA, 1969), ACM ’69, ACM, pp. 157–172. 5, 13, 14, 17
24. Caraux G., Pinloche S.: Permutmatrix: a graphical environment to arrange gene expression profiles in optimal linear order. Bioinformatics 21, 7 (2005), 1280–1281. 5, 7, 20
25. Croes G.A.: A method for solving traveling-salesman problems. Operations research 6, 6 (1958), 791–812. 15
26. Deutsch S.B., Martin J.J.: An ordering algorithm for analysis of data arrays. Operations Research 19, 6 (1971), 1350–1362. 5, 11, 12
27. Díaz J., Petit J., Serna M.: A survey of graph layout problems. ACM Comput. Surv. 34, 3 (Sept. 2002), 313–356. 13
28. Elmqvist N., Do T.-N., Goodell H., Henry N., Fekete J.-D.: ZAME: Interactive Large-Scale Graph Visualization. IEEE Pacific Visualization Symposium (Mar. 2008), 215–222. 5, 10
29. Eisen M.B., Spellman P.T., Brown P.O., Botstein D.: Cluster analysis and display of genome wide expression patterns. Proceedings of the National Academy of Sciences 95, 25 (1998), 14863–14868. 5, 8, 17, 20
30. Eades P., Wormald N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11, 4 (1994), 379–403. URL:http://dx.doi.org/10.1007/BF01187020, doi: 10.1007/BF01187020. 12
31. Fekete J.-D.: Reorder.js: A JavaScript Library to Reorder Tables and Networks. IEEE VIS 2015, Oct. 2015. Poster. URL:https://hal.inria.fr/hal-01214274. 5
32. Fiedler M.: Algebraic connectivity of graphs. Czechoslovak mathematical journal 23, 2 (1973), 298–305. 10
33. Friendly M., Kwan E.: Effect ordering for data displays. Computational statistics & data analysis 43, 4 (2003), 509–539. 5
34. Friendly M.: Corrgrams: Exploratory displays for correlation matrices. The American Statistician 56, 4 (2002), 316–324. 5, 9, 10
35. Gelfand A.E.: Rapid seriation methods with archaeological applications. Hodson, FR, Kendall, DG and Tautu (eds), Mathematics in the Archaeological and Historical Sciences. Edinburgh University Press, Edinburgh (1971), 186–201. 5, 20
36. GEORGE J.A.: Computer implementation of the finite element method. PhD thesis, Stanford University, 1971. 5, 13, 14
37. Ghoniem M., Fekete J., Castagliola P.: A comparison of the readability of graphs using node-link and matrix-based representations. In Information Visualization, 2004. INFOVIS 2004. IEEE Symposium on (2004), IEEE, pp. 17–24. 1, 4
38. Gansner E.R., Koutsofios E., North S.C., Vo K.-P.: A technique for drawing directed graphs. IEEE Trans. Softw. Eng. 19, 3 (Mar. 1993), 214–230. URL:http://dx.doi.org/10.1109/32.221135, doi: 10.1109/32.221135. 12
39. Gregor R., Lamprecht A., Sipiran I., Schreck T., Bustos B.: Empirical evaluation of dissimilarity measures for 3d object retrieval with application to multi-feature retrieval. In Content-Based Multimedia Indexing (CBMI), 2015 13th International Workshop on (2015), IEEE, pp. 1–6. 20
40. Gibbs N.E., Poole Jr W.G., Stockmeyer P.K.: An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM Journal on Numerical Analysis 13, 2 (1976), 236–250. 5, 13
41. Gruvaeus G., Wainer H.: Two additions to hierarchical cluster analysis. British Journal of Mathematical and Statistical Psychology 25, 2 (1972), 200–206. 5, 7, 8
42. Harper L.H.: Optimal assignments of numbers to vertices. Journal of the Society for Industrial and Applied Mathematics (1964), 131–135. 5
43. Hartigan J.A.: Direct clustering of a data matrix. Journal of the american statistical association 67, 337 (1972), 123–129. 5
44. Hahsler M., Buchta C., Hornik K.: Infrastructure for seriation, r package version 1.0-14. ed., 2014. 17
45. Henry N., Fekete J.-D.: MatrixExplorer: a dual-representation system to explore social Networks. IEEE transactions on visualization and computer graphics 12, 5 (2006), 677–84. 5, 15, 20
46. Hubert L.J., Golledge R.G.: Matrix reorganization and dynamic programming: Applications to paired comparisons and unidimensional seriation. Psychometrika 46, 4 (1981), 429–441. 5, 12
47. Hahsler M., Hornik K., Buchta C.: Getting things in order: An introduction to the r package seriation. Journal of Statistical Software 25, 3 (March 2008), 1–34. 5, 10, 18
48. Hill M.O.: Correspondence analysis: A neglected multivariate method. Journal of the Royal Statistical Society. Series C (Applied Statistics) 23, 3 (1974), pp. 340–354. 5
49. Hill M.O.: Decorana-a fortran program for detrended correspondence analysis and reciprocal averaging. 5
50. Harel D., Koren Y.: Graph drawing by high-dimensional embedding. In Revised Papers from the 10th International Symposium on Graph Drawing (London, uK, UK, 2002), GD ’02, Springer-Verlag, pp. 207–219. 5, 8, 9, 10
51. Hubert L.: Some applications of graph theory and related nonmetric techniques to problems of approximate seriation the case of symmetric proximity measures. British Journal of Mathematical and Statistical Psychology 27, 2 (1974), 133–153. 5, 7, 17
52. Jin R., Xiang Y., Fuhry D., Dragan F.F.: Overlapping matrix pattern visualization: A hypergraph approach. In Data Mining, 2008. ICDM’08. Eighth IEEE International Conference on (2008), IEEE, pp. 313–322. 5, 16
53. KAISER S.: Biclustering: Methods, Software and Application. PhD thesis, lmu, 2011. 5, 16
54. Koren Y., Carmel L., Harel D.: Ace: a fast multiscale eigenvectors computation for drawing huge graphs. In Information Visualization, 2002. INFOVIS 2002. IEEE Symposium on (2002), pp. 137–144. 14, 18
55. Kendall D.G.: A statistical approach to flinders petries sequence-dating. Bulletin of the International Statistical Institute 40, 2 (1963), 657–681. 5
56. Koren Y., Harel D.: A multi-scale algorithm for the linear arrangement problem. In Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (London, UK, UK, 2002), WG ’02, Springer-Verlag, pp. 296–309. 14, 17
57. King I.P.: An automatic reordering scheme for simultaneous equations derived from Network systems. International Journal for Numerical Methods in Engineering 2, 4 (1970), 523–533. 5, 13
58. Kaiser S., Leisch F.: A toolbox for bicluster analysis in r, 2008. 5, 17, 18
59. Knyazev A.V.: Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method. SIAM Journal on Scientific Computing 23, 2 (2001), 517–541. 8
60. Koren Y.: Drawing graphs by eigenvectors: Theory and practice. Comput. Math. Appl. 49, 11-12 (June 2005), 1867–1888. 5
61. KIM D., YUM B.-J.: Collaborative filtering based on iterative principal component analysis. Expert Systems with Applications 28, 4 (2005), 823–830. 10
62. Lozano M., Duarte A., Gortázar F., Martí R.: Variable neighborhood search with ejection chains for the antibandwidth problem. Journal of Heuristics 18, 6 (2012), 919–938. 5, 14
63. Lozano M., Duarte A., Gortázar F., Martí R.: A hybrid metaheuristic for the cyclic antibandwidth problem. Knowledge-Based Systems 54 (2013), 103–113. 5, 14
64. Lenstra J.: Technical note—clustering a data array and the traveling-salesman problem. Operations Research 22, 2 (1974), 413–414. 5, 14
65. Liu L., Hawkins D.M., Ghosh S., Young S.S.: Robust singular value decomposition analysis of microarray data. Proceedings of the National Academy of Sciences 100, 23 (2003), 13167–13172. 5, 10
66. Liiv I.: Seriation and matrix reordering methods: An historical overview. Statistical analysis and data mining 3, 2 (2010), 70–91. 1, 2
67. Lenstra J.K., Kan A.R.: Some simple applications of the travelling salesman problem. Operational Research Quarterly (1975), 717–733. 5, 14
68. Lazzeroni L., Owen A., et al.: Plaid models for gene expression data. Statistica sinica 12, 1 (2002), 61–86. 5, 15, 16
69. Lee B., PLAISANT C., PARR C.S., FEKETE J.-D., HENRY N.: Task taxonomy for graph visualization. In Proceedings of the 2006 AVI workshop on BEyond time and errors: novel evaluation methods for information visualization (2006), ACM, pp. 1–5. 4, 5, 21
70. Liu W.-H., Sherman A.H.: Comparative analysis of the cuthill-mckee and the reverse cuthill-mckee ordering algorithms for sparse matrices. SIAM Journal on Numerical Analysis 13, 2 (1976), 198–213. 5, 13
71. Leung J.y., Vornberger O., Witthoff J.D.: On some variants of the bandwidth minimization problem. SIAM Journal on Computing 13, 3 (1984), 650–667. 5, 13, 14
72. McGrath C., Blythe J., Krackhardt D.: The effect of spatial arrangement on judgments and errors in interpreting graphs. Social Networks 19, 3 (1997), 223–242. 2
73. McQuitty L.L.: Multiple clusters, types, and dimensions from iterative intercolumnar correlational analysis. Multivariate Behavioral Research 3, 4 (1968), 465–477. 5, 9
74. McCormick W.T., Deutsch S.b., Martin J.J., SCHWEITZER P.J.: Identification of Data Structures and Relationships by Matrix Reordering Techniques. Tech. rep., DTIC Document, 1969. 5, 12
75. Murali T., Kasif S.: Extracting conserved gene expression motifs from gene expression data. In Pacific Symposium on Biocomputing (2003), vol. 8, World Scientific, pp. 77–88. 5, 16
76. Mueller C., Martin b., Lumsdaine A.: A comparison of vertex ordering algorithms for large graph visualization. In Visualization, 2007. APVIS’07. 2007 6th International Asia-Pacific Symposium on (2007), IEEE, pp. 141–148. 1, 2
77. Mueller C., Martin b., Lumsdaine a.: Interpreting large visual similarity matrices. 2007 6th International Asia-Pacific Symposium on Visualization (Feb. 2007), 149–152. 2, 4
78. Madeira S.C., Oliveira A.L.: Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) 1, 1 (2004), 24–45. 15, 16
79. Mäkinen E., Siirtola H.: Reordering the reorderable matrix as an algorithmic problem. In Theory and Application of Diagrams. Springer, 2000, pp. 453–468. 5, 12
80. Mäkinen E., Siirtola H.: The barycenter heuristic and the reorderable matrix. Informatica (Slovenia) 29, 3 (2005), 357–364. 12
81. Mafteiu-Scai L.O.: The bandwidths of a matrix. a survey of algorithms. Annals of West University of Timisoara-Mathematics 52, 2 (2014), 183–223. 12, 14
82. McCormick W.T., Schweitzer P.J., White T.W.: Problem decomposition and data reorganization by a clustering technique. Operations Research 20, 5 (1972), 993–1009. 5, 12
83. Mueller C.: Sparse matrix reordering algorithms for cluster identification. For I532, Machine Learning in Bioinformatics (2004). 2
84. NetworkX: NetworkX. https://networkx.github.io/. online, last visited November 19, 2015. 17
85. Niermann S.: Optimizing the ordering of tables with evolutionary computation. The American Statistician 59, 1 (2005). 5, 12
86. Osei-Kuffuor D., Li R., Saad Y.: Matrix reordering using multilevel graph coarsening for ilu preconditioning. SIAM Journal on Scientific Computing 37, 1 (2015), A391–A419. 14
87. Prelić A., Bleuler s., Zimmermann P., Wille a., Bühlmann P., Gruissem w., Hennig L., Thiele L., Zitzler E.: A systematic comparison and evaluation of biclustering methods for gene expression data. Bioinformatics 22, 9 (2006), 1122–1129. 5, 16
88. Perin C., Dragicevic P., Fekete J.-D.: Revisiting Bertin matrices: New Interactions for Crafting Tabular Visualizations. IEEE Transactions on Visualization and Computer Graphics (Nov. 2014). 1, 5, 8, 20
89. Petit J.: Experiments on the minimum linear arrangement problem. J. Exp. Algorithmics 8 (Dec. 2003). 2, 4, 17
90. PICH C.: Applications of Multidimensional Scaling to Graph Drawing. PhD thesis, Universität Konstanz, Konstanz, 2009. 11
91. Pop P., Matei O.: An efficient metaheuristic approach for solving a class of matrix optimization problems. Metaheuristics and Engineering (2014), 17. 5, 14
92. Rao R., Card S.K.: The table lens: merging graphical and symbolic representations in an interactive focus+ context visualization for tabular information. In Proceedings of the SIGCHI conference on Human factors in computing systems (1994), ACM, pp. 318–322. 5, 20
93. Robinson W.S.: A method for chronologically ordering archaeological deposits. American antiquity 16, 4 (1951), 293–301. 5
94. Rosen R.: Matrix bandwidth minimization. In Proceedings of the 1968 23rd ACM national conference (1968), ACM, pp. 585–595. 5, 13
95. Raspaud A., Schröder h., Sỳkora O., Torok L., Vrt'o I.: Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discrete Mathematics 309, 11 (2009), 3541–3552. 14
96. Rodgers J.L., Thompson T.D.: Seriation and multidimensional scaling: A data analysis approach to scaling asymmetric proximity matrices. Applied psychological measurement 16, 2 (1992), 105–117. 5, 11
97. Spenke M., Beilken C., Berlage T.: Focus: the interactive table for product comparison and selection. In Proceedings of the 9th annual ACM symposium on User interface software and technology (1996), ACM, pp. 41–50. 20
98. Spence I., Graef J.: The determination of the underlying dimensionality of an empirically obtained matrix of proximities. Multivariate Behavioral Research 9, 3 (1974), 331–341. 5, 11
99. Siirtola H.: Interaction with the reorderable matrix. In Proceedings of the 1999 International Conference on Information Visualisation (Washington, DC, USA, 1999), IV ’99, IEEE Computer Society, pp. 272-. 5
100. Siek J.g., Lee L.-Q., Lumsdaine A.: Boost Graph Library: User Guide and Reference Manual, The. Pearson Education, 2001. 5, 18
101. Sloan S.W.: An algorithm for profile and wavefront reduction of sparse matrices. International Journal for Numerical Methods in Engineering 23, 2 (1986), 239–251. 5, 14, 15
102. Sloan S.: A fortran program for profile and wavefront reduction. International Journal for Numerical Methods in Engineering 28, 11 (1989), 2651–2679. 5, 14
103. Sternin H.: Statistical Methods of Time Sequencing. Tech. rep., DTIC Document, 1965. 5, 9
104. Steiglitz K., Weiner P.: Some improved algorithms for computer solution of the traveling salesman problem. 15
105. Turner H., Bailey T., Krzanowski W.: Improved biclustering of microarray data demonstrated through systematic performance tests. Computational statistics & data analysis 48, 2 (2005), 235–254. 5, 16
106. Tanay A., Sharan R., Shamir R.: Biclustering algorithms: A survey. Handbook of computational molecular biology 9, 1–20 (2005), 122–124. 8, 16
107. von Rüden L., Hermanns M.-A., Behrisch M., Keim D., Mohr B., Wolf F.: Separating the wheat from the chaff: Identifying relevant and similar performance data with visual analytics. In Proceedings of the 2nd Workshop on Visual Performance Analysis (New York, NY, USA, 2015), VPA ’15, ACM, pp. 4:1–4:8. 14
108. Watkins D.S.: Fundamentals of Matrix Computations. John Wiley & Sons, Inc., New York, NY, USA, 1991. 8
109. Wei T.: Corrplot: Visualization of a correlation matrix, R package version 0.73. ed., Oct 2013. 5, 17, 18
110. Wilkinson L., Friendly M.: The history of the cluster heat map. The American Statistician (2009). 2
111. WILKINSON L.: The Grammar of Graphics (Statistics and Computing). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2005. 2, 4, 5, 8, 10, 11, 13
112. Wong P.C., Mackey P., Foote H., May R.: Visual matrix clustering of social networks. IEEE computer graphics and applications 33, 4 (2013), 88–96. 15
113. Wu H.-M., Tzeng S., Chen C.-H.: Handbook of Data Visualization. Springer, 2008, ch. Matrix Visualization, pp. 681–708. 2