Results 1 
8 of
8
Effect ordering for data displays
 Comput. Statist. Data Anal., this
, 2003
"... This paper outlines a general framework for ordering information in visual displays (tables and graphs) according to the effects or trends which we desire to see. This idea, termed effectordered data displays, applies principally to the arrangement of unordered factors for quantitative data and fre ..."
Abstract

Cited by 25 (9 self)
 Add to MetaCart
This paper outlines a general framework for ordering information in visual displays (tables and graphs) according to the effects or trends which we desire to see. This idea, termed effectordered data displays, applies principally to the arrangement of unordered factors for quantitative data and frequency data, and to the arrangement of variables and observations in multivariate displays (star plots, parallel coordinate plots, and so forth). As examples of this principle, we present several techniques for ordering items, levels or variables “optimally”, based on some desired criterion. All of these may be based on eigenvalue or singularvalue decompositions. Along the way, we tell some stories about data display, illustrated by graphs—some surprisingly bad, and some surprisingly good—for showing patterns, trends, and anomalies in data. We hope to raise more questions than we can provide answers for.
The history of the cluster heat map
 The American Statistician
, 2009
"... The cluster heat map is an ingenious display that simultaneously reveals row and column hierarchical cluster structure in a data matrix. It consists of a rectangular tiling with each tile shaded on a color scale to represent the value of the corresponding element of the data matrix. The rows (column ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
The cluster heat map is an ingenious display that simultaneously reveals row and column hierarchical cluster structure in a data matrix. It consists of a rectangular tiling with each tile shaded on a color scale to represent the value of the corresponding element of the data matrix. The rows (columns) of the tiling are ordered such that similar rows (columns) are near each other. On the vertical and horizontal margins of the tiling there are hierarchical cluster trees. This cluster heat map is a synthesis of several different graphic displays developed by statisticians over more than a century. We locate the earliest sources of this display in late 19th century publications. And we trace a diverse 20th century statistical literature that provided a foundation for this most widely used of all bioinformatics displays. 1
Minimal Covers of Maximal Antichains for Interval Orders
, 1997
"... We address the problem of determining all sets which form minimal covers of maximal antichains for interval orders, i.e., sets no proper subsets of which form an element cover of the ordered set. This problem generalizes the minimum clique cover problem. We produce an algorithm enumerating all minim ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We address the problem of determining all sets which form minimal covers of maximal antichains for interval orders, i.e., sets no proper subsets of which form an element cover of the ordered set. This problem generalizes the minimum clique cover problem. We produce an algorithm enumerating all minimal covers using the minimal elements of the interval order. We characterize maximal removable sets, which are the complements of minimal covers, and produce a distinct algorithm which enumerates them. We use this characterization to provide bounds on the maximum number of minimal covers for an interval order with a given number of maximal antichains. Keywords: interval order, minimal cover, maximal antichain, minimum clique cover 1 Introduction An interval order is a partially ordered set, members of which can be identified with intervals of a linear order of the form [l i ; u i ], with the order relation OE given by [l i ; u i ] OE [l j ; u j ] whenever u i ! l j . Interval orders provide...
Social Networks
, 2005
"... Social networks provide a rich source of graph drawing problems, because they appear in an incredibly wide variety of forms and contexts. After sketching the scope of social network analysis, we establish some general principles for social network visualization before finally reviewing applications ..."
Abstract
 Add to MetaCart
Social networks provide a rich source of graph drawing problems, because they appear in an incredibly wide variety of forms and contexts. After sketching the scope of social network analysis, we establish some general principles for social network visualization before finally reviewing applications of, and challenges for, graph drawing methods in this area. Other accounts more generally relating to social network visualization are given, e.g., in [Klo81, BKR + 99a, Fre00, Fre05, BKR06].
Zur Erlangung des akademischen Grades DiplomInformatiker
, 2010
"... 2 Zusammenfassung. Seriation ist die Suche nach einer linearen Anordnung von Objekten, deren paarweise Ähnlichkeiten gegeben sind, sodass sich einander ähnliche Objekte in der Anordnung näher stehen als einander unähnliche. Seriation hat ihren Ursprung in der relativen Datierung archäologischer Arte ..."
Abstract
 Add to MetaCart
2 Zusammenfassung. Seriation ist die Suche nach einer linearen Anordnung von Objekten, deren paarweise Ähnlichkeiten gegeben sind, sodass sich einander ähnliche Objekte in der Anordnung näher stehen als einander unähnliche. Seriation hat ihren Ursprung in der relativen Datierung archäologischer Artefakte und kommt darüber hinaus in den Sozialwissenschaften, in der Psychologie, zum Zwecke technischer Diagnosen und in der Ökologie zum Einsatz. Existiert eine Anordnung von Objekten, sodass zwei beliebige Objekte sich nicht ähnlicher sind als alle dazwischen angeordneten Objektpaare, so heißt das gegebene
History Corner The History of the Cluster Heat Map
"... The cluster heat map is an ingenious display that simultaneously reveals row and column hierarchical cluster structure in a data matrix. It consists of a rectangular tiling, with each tile shaded on a color scale to represent the value of the corresponding element of the data matrix. The rows (colum ..."
Abstract
 Add to MetaCart
The cluster heat map is an ingenious display that simultaneously reveals row and column hierarchical cluster structure in a data matrix. It consists of a rectangular tiling, with each tile shaded on a color scale to represent the value of the corresponding element of the data matrix. The rows (columns) of the tiling are ordered such that similar rows (columns) are near each other. On the vertical and horizontal margins of the tiling are hierarchical cluster trees. This cluster heat map is a synthesis of several different graphic displays developed by statisticians over more than a century. We locate the earliest sources of this display in late 19th century publications, and trace a diverse 20th century statistical literature that provided a foundation for this most widely used of all bioinformatics displays. KEY WORDS: Cluster analysis; Heatmap; Microarray; Visualization. 1.