<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Facilitating Graph Interpretation via Interactive Hierarchical Edges</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Thomas S. McTavish</string-name>
          <email>tom.mctavish@pearson.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Center for Digital Data, Analytics &amp; Adaptive Learning Pearson</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Graphs visualizations can become di cult to interpret when they fail to highlight patterns. Additionally, the data to be visualized may be hierarchical in nature. Therefore, graphs with hierarchical data need to o er means of telescoping that collapse or expand subgraphs while aggregating their data. In this paper, we demonstrate an interactive hierarchical edge graph on book prerequisite data, which can be generalized to a variety of hierarchical data. We illustrate the importance of ordering nodes (when possible) and coloring by various features. We then demonstrate various ways of performing exploratory data analysis by delivering various pieces of information on mouseovers and utilizing telescoping and ltering.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Hierarchical edge bundling</kwd>
        <kwd>prerequisite relationships</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        When graphs contain many nodes and edges { especially
different types of nodes and edges { they can quickly become
di cult to visually interpret [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The common term is
\hairball" as nodes and edges jumble into a tangled morass that
occlude any meaningful patterns. Force-directed graphs
operate to keep nodes with strong edges closer and nodes with
weak or absent edges further apart [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. This layout can aid
in some contexts, but frequently exacerbates the hairball
phenomenon. There are two striking visualization designs
by Krzywinski and colleagues that aim at revealing
interpretable patterns in graphs. At the core of each is at least
one meaningful axis on which to align nodes. The rst is
Circos, which arranges sorted nodes along a circle [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Nodes
are often displayed as arcs along the circle and edges
between the arcs are visualized as chords or ribbons that cut
through the middle of the circle. Circos has been used in
over 500 publications, many related to large-scale genomic
data. By arranging nodes along one axis in a circle, Circos
easily discriminates nearby and distant edges. The widths of
the nodes (length of the arc) can carry meaning and so can
the width of the chord between connected arcs. Nodes and
edges can also be colored to highlight features such as the
node type, the source, and the target. It is also common to
display many node features such as histograms of di erent
measures within an arc, for example, Figure 3 in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
The other design by Krzywinski is hive plots [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Hive plots
are comprised of multiple axes, each radiating from an inner
ring. A given node may exist on one or more axes, aligned
along the axis in some meaningful way. For example, an
axis might sort nodes by di erent graph features such as a
node's closeness { the average distance between a node and
all others reachable from it. By placing nodes on various
axes, a representation of where a node resides along some
feature is captured. When edges are added, it may bring out
relationships between adjacently-placed features. For
example, anti-correlations of two features compared side-by-side
will have many criss-crossed edges. In short, ordering nodes
in some meaningful way(s) permits Circos and hive plots to
better reveal patterns. Circos and hive plots, however, do
not capture hierarchical relationships very well.
      </p>
      <p>
        Hierarchical edge bundling is a visualization technique on
hierarchical data that skews edges toward their parent nodes,
which may be invisible in the graph [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The visual e ect is
that edges are channeled into larger, striking swaths while
avoiding the direct clutter of the parent nodes. Any
topology can be employed, but simpler geometric structures are
most commonly used.
      </p>
      <p>In this paper, we demonstrate an interactive hybrid of Circos
plots with hierarchical edge bundling on mathematical book
prerequisites. The books are structured hierarchically as a
table of contents with chapters, sections, objectives, and
exercises. Prerequisites map between objectives. The goal was
to provide a means of highlighting prerequisites at the
various levels, to call out important objectives, and also reveal
holes. Through coloring, it is simple to discriminate chapters
or to highlight nodes by features such as learner interaction
frequency. Through telescoping, it is straightforward to
determine those prerequisites that map across chapters, within
a chapter, and within sections. Through ltering it is
possible to display nodes and edges by their degree. Collectively,
by aligning a curriculum along a circle, we demonstrate how
this template can be used for displaying various relationships
and features of hierarchical, educational data.</p>
    </sec>
    <sec id="sec-2">
      <title>2. METHODS</title>
      <p>
        Two higher education math books were selected that
contained a table of contents and prerequisites as mapped by
content matter experts. Interactivity data came from
students, largely from the U.S., who were enrolled in courses
spanning Fall semester 2012 through 2013 that used these
books and the accompanying Pearson MathXL R homework
system. All data was translated into JSON format for use in
a web browser. The graph and its interactivity functionality
was programmed using D3.js [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. DEMONSTRATION</title>
      <p>Figure 1 shows a screen shot of the graph and user
controls. Displayed is a developmental math book with
chapters starting at 12 o'clock and progressing clockwise. Nodes
are colored by chapter and have ample spacing to easily
discriminate them. Most nodes displayed are at the
objective level. Within a chapter, slight separations between the
nodes delineate the sections. Edges within a section are
shown as little arcs. Edges within the chapter have a larger
arc, and edges across chapters bend so that they bundle near
to where a chapter node would be. We see various features
at a glance. For example, the online appendix has no pre- or
post-requisites across chapters. This is because it is shared
across several books and is independent from this book.
Chapters 2, 11, and 13 are displayed at the chapter level
hiding all of their section and objective nodes, whereas chapters
4 and 7 are at the section level. Chapters can be shown or
hidden in the column of checkboxes on the right. For
example, some appendix items have been removed from this
display. The radio buttons correspond to the level of the
hierarchy to display.</p>
      <p>In Figure 1, the user has centered the mouse over the
Chapter 2 node. The color of the node is green, so bold green
edges reveal other chapters to which Chapter 2 is a
prerequisite. Also shown are bold orange lines from Chapter 1
objectives coming into Chapter 2. The text of these
preand post-requisites are listed on the left. We see at a glance
that while Chapter 2 is prerequisite to Chapter 3, it links
to other sections and objectives in a punctate fashion,
completely ignoring the middle chapters of the book.
Edges are colored by their outgoing node color. Of course,
they can be colored by their incoming node color or other
feature. We have also colored nodes by their degree,
highlighting critical objectives and important chapters. We have
also colored nodes by performance measures such as the
frequency of user interactions. Coloring can be selected
through the pulldown menu on the top-left.</p>
      <p>This utility also has some ltering capabilities to show/hide
edges within sections, within chapters, and across chapters.
Nodes can also be ltered out their degree or feature by
which they are colored. Similarly, edges can be ltered out
if they are below a weight threshold.</p>
    </sec>
    <sec id="sec-4">
      <title>3.1 Limitations</title>
      <p>While this visualization works well with book prerequisites,
making graphs interactive as we have demonstrated,
limits the quantity of nodes and edges because they have to
be large enough to be selectable. Additionally, while edge
bundling facilitates an interpretation of convergence, it also
makes it di cult to select or hover over any individual edge
for information. As presented, more than 3000 edges begins
to be problematic. Similarly, when there are over 500 nodes
along the circle, it can become di cult to select a node of
interest with a mouse.</p>
    </sec>
    <sec id="sec-5">
      <title>3.2 Next steps</title>
      <p>This plot and circos plots have only one axis. Avenues to
explore include reordering nodes along this axis by di erent
features. Alternatively, hive plots could be extended with
the ideas presented here, where various axes could utilize
hierarchical data by swapping child nodes with aggregated
parent nodes.</p>
    </sec>
    <sec id="sec-6">
      <title>4. CONCLUSION</title>
      <p>It is di cult to interpret graphs without an adequate
visualization. In this work, we demonstrated a template that can
be used on hierarchical data aligned along the axis of a circle.</p>
      <p>At a glance, it can reveal a lot of features, but through
ltering, telescoping, and interactivity, exploratory data analysis
can be performed to reveal features at various scales. As a
template, it is quite useful for contrasting several graphs, or
alternatively, illuminating various features within a general
structure. For example, in our case using prerequisite data,
nodes and edges might be colored by di culty, fraction
correct, time-on-task, or other measures of students interacting
with these book objectives. Furthermore, this technique can
be generically applied to other datasets.</p>
      <p>Figure 1: Screen shot of the interactive, hierarchical edge bundling graph.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Bostock</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Ogievetsky</surname>
          </string-name>
          , and
          <string-name>
            <surname>J. Heer.</surname>
          </string-name>
          <article-title>D3: Data-driven documents</article-title>
          .
          <source>IEEE Transactions on Visualization and Computer Graphics</source>
          ,
          <volume>17</volume>
          (
          <issue>12</issue>
          ):
          <volume>2301</volume>
          {
          <fpage>2309</fpage>
          ,
          <string-name>
            <surname>Dec</surname>
          </string-name>
          .
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T. M. J.</given-names>
            <surname>Fruchterman</surname>
          </string-name>
          and
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Reingold</surname>
          </string-name>
          .
          <article-title>Graph drawing by force-directed placement</article-title>
          .
          <source>Software: Practice and Experience</source>
          ,
          <volume>21</volume>
          (
          <issue>11</issue>
          ):
          <volume>1129</volume>
          {
          <fpage>1164</fpage>
          ,
          <string-name>
            <surname>Nov</surname>
          </string-name>
          .
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Holten</surname>
          </string-name>
          .
          <article-title>Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data</article-title>
          .
          <source>IEEE Transactions on Visualization and Computer Graphics</source>
          ,
          <volume>12</volume>
          (
          <issue>5</issue>
          ):
          <volume>741</volume>
          {
          <fpage>748</fpage>
          ,
          <string-name>
            <surname>Sept</surname>
          </string-name>
          .
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Krzywinski</surname>
          </string-name>
          , I. Birol,
          <string-name>
            <given-names>S. J.</given-names>
            <surname>Jones</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Marra</surname>
          </string-name>
          .
          <article-title>Hive plots|rational approach to visualizing networks</article-title>
          .
          <source>Brie ngs in Bioinformatics</source>
          ,
          <volume>13</volume>
          (
          <issue>5</issue>
          ):
          <volume>627</volume>
          {
          <fpage>644</fpage>
          ,
          <string-name>
            <surname>Sept</surname>
          </string-name>
          .
          <year>2012</year>
          . PMID:
          <volume>22155641</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Krzywinski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schein</surname>
          </string-name>
          , I_. Birol,
          <string-name>
            <given-names>J.</given-names>
            <surname>Connors</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Gascoyne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Horsman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. J.</given-names>
            <surname>Jones</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Marra</surname>
          </string-name>
          . Circos:
          <article-title>An information aesthetic for comparative genomics</article-title>
          .
          <source>Genome Research</source>
          ,
          <volume>19</volume>
          (
          <issue>9</issue>
          ):
          <volume>1639</volume>
          {
          <fpage>1645</fpage>
          ,
          <string-name>
            <surname>Sept</surname>
          </string-name>
          .
          <year>2009</year>
          . PMID:
          <volume>19541911</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>E. S.</given-names>
            <surname>Mace</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Tai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. K.</given-names>
            <surname>Gilding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Prentis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. C.</given-names>
            <surname>Campbell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. J.</given-names>
            <surname>Innes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Cruickshank,
          <string-name>
            <given-names>C.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Frere</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. H.</given-names>
            <surname>Hunt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Shatte</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. D.</given-names>
            <surname>Godwin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Jordan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and J.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Whole-genome sequencing reveals untapped genetic potential in africa's indigenous cereal crop sorghum</article-title>
          .
          <source>Nature Communications</source>
          ,
          <volume>4</volume>
          , Aug.
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>D.</given-names>
            <surname>Merico</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Gfeller</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G. D.</given-names>
            <surname>Bader</surname>
          </string-name>
          .
          <article-title>How to visually interpret biological data using networks</article-title>
          .
          <source>Nature Biotechnology</source>
          ,
          <volume>27</volume>
          (
          <issue>10</issue>
          ):
          <volume>921</volume>
          {
          <fpage>924</fpage>
          ,
          <string-name>
            <surname>Oct</surname>
          </string-name>
          .
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>