Visual Analytics - Think Pair Share
Visual Analytics - Think Pair Share
Network
The dataset type of networks is well suited for specifying that there is
some kind of relationship between two or more items in a network is often
called a node. A link is a relation between two items. For example, in an
articulated social network the nodes are people, and links mean friendship. In a
gene interaction network, the nodes are genes, and links between them mean
that these genes have been observed to interact with each other. In a computer
network, the nodes are computers, and the links represent the ability to send
messages directly between two computers using physical cables or a wireless
connection.
Network nodes can have associated attributes, just like items in a table.
In addition, the links themselves could also be considered to have attributes
associated with them; these may be partly or wholly disjoint from the node
attributes.
It is again important to distinguish between the abstract concept of a
network and any particular visual layout of that network where the nodes and
edges have particular spatial positions. This chapter concentrates on the former.
Trees
Heat Maps
Tree maps
Treemaps are ideal for displaying large amounts of hierarchically
structured (tree-structured) data. The space in the visualization is split up into
rectangles that are sized and ordered by a quantitative variable.
The levels in the hierarchy of the treemap are visualized as rectangles
containing other rectangles. Each set of rectangles on the same level in the
hierarchy represents a column or an expression in a data table. Each individual
rectangle on a level in the hierarchy represents a category in a column. For
example, a rectangle representing a continent may contain several rectangles
representing countries in that continent. Each rectangle representing a country
may in turn contain rectangles representing cities in these countries. You can
create a treemap hierarchy directly in the visualization, or use an already
defined hierarchy. To learn more, see the section To Create a Treemap
Hierarchy.
A number of different algorithms can be used to determine how the
rectangles in a treemap should be sized and ordered. The treemap in Spotfire
uses a squarified algorithm.
The rectangles in the treemap range in size from the top left corner of
the visualization to the bottom right corner, with the largest rectangle positioned
in the top left corner and the smallest rectangle in the bottom right corner. For
hierarchies, that is, when the rectangles are nested, the same ordering of the
rectangles is repeated for each rectangle in the treemap. This means that the
size, and thereby also position, of a rectangle that contains other rectangles is
decided by the sum of the areas of the contained rectangles.
Example:
Below is a treemap where the rectangles represent cities and are sized and
colored by the column Sales. In this case, the aggregation method Sum was
selected for the Sales column. This treemap only contains data on one level.