<!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>A Visualization Platform For Exploring Cooperation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Remy Cazabet</string-name>
          <email>remy.cazabet@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hideaki Takeda</string-name>
          <email>takeda@nii.ac.jp</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Institute of Informatics</institution>
          ,
          <addr-line>2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, japan</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper, we present a platform designed to explore visually massive cooperation between individuals. With the increasing importance of the Internet, new types of cooperation are becoming common, in which hundreds, thousands or millions of individuals act together in interaction, and produces content in a decentralized manner. As these processes are happening in real-time and without organization, individuals involved in them often do not have a clear vision of what is happening, or even which role they play in it. The visualization we propose would allow users to take back the power of understanding the processes to which they participate in. We combine time series visualization, together with custom network visualization, in a way generic enough to adapt to many situations, while o ering numerous possibilities.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>Since the advent of the digital era, both the technical
possibilities and the introduction of new behaviors have
participated in the production of large databases storing
tremendous amounts of varied information. Recent hot topics such
as Big Data, Complex Systems and Network Analysis have
been stimulated by this new access to information. One
particular topic of interest is the study of how crowds are
involved in massive generation of content, whether it be on
Wikipedia, Twitter, Facebook, YouTube, or even through
the publication of ever growing number of scienti c
publications. If these datasets are a stimulating opportunity, they
are also a challenge. While many research has been done on
these topics, we feel there is no simple, generic method to
explore this decentralized creation of content, and in
particular its dynamic. The platform we propose is generic enough
to take input from many kinds of sources, such as scienti c
publications, online social networks, and many others. The
platform is developed with internet based tools only, and
could therefore be adapted to provide a user-friendly
interface to explore a large dataset of content creation available
on the internet.</p>
    </sec>
    <sec id="sec-2">
      <title>1.1 Related Works</title>
      <p>Several visualizations have been proposed to understand
complex systems and large data in general. We introduce the
most closely related to our proposition.</p>
      <p>
        ThemeRiver [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] is probably the most famous of these. It
allows to represents the dynamic of topics in large collections
of documents.
      </p>
      <p>
        History ows [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]also focuses on dynamic aspects. It is a
tool to visualize cooperation and con ict between authors
in the process of collaboration, in particular on the web.
In the work by Rosvall et al.[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], alluvial diagrams are used
to represent the evolution of communities in networks, and
is applied in particular for the visualization of the evolution
of research topics in science.
      </p>
      <p>
        On a more static perspective, numerous tools, frameworks
and softwares have been proposed to represent networks in
the best possible way. We can cite some of them, among the
most famous ones: Gephi[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], Cytoscape[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], Tulip [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
Several works have also been done on the visualization of
dynamic networks; we can cite [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] as a reference on the
domain.
      </p>
      <p>The tools we have cited above are either specialized on the
visualization of longitudinal aspects, but without
information on the internal structure, or, on the contrary, represent
this internal structure (network visualization), but only with
a static point of view. Our platform is designed to
encompass both aspects.</p>
    </sec>
    <sec id="sec-3">
      <title>2. MASS COOPERATION DATASETS</title>
      <p>In order to illustrate the possibilities and possible practical
applications of the tools presented in this paper, we applied
them to three large datasets from di erent elds. In this
section, we will present brie y these datasets, and the type
of data we extract from them.</p>
      <p>For a dataset to be visualized using our platform, it needs
to be composed of several productions, that we call
Cooperative Productions (CPs). It can be a video, an article,
a website, a message, or any other item which can make a
reference and be referenced. These CPs are de ned by the
following properties:</p>
      <sec id="sec-3-1">
        <title>Time of publication</title>
        <p>Category (a chain of character, can be omitted)</p>
      </sec>
      <sec id="sec-3-2">
        <title>List of references it makes to other CPs</title>
        <p>Additionally, we need to group these CPs in Cooperation
processes. A cooperation process is a set of CPs
corresponding to a same topic, a same goal, or any other way
of grouping them relevant to the studied dataset. In the
following sections, we will detail these properties in 3 example
datasets.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>2.1 NicoNico</title>
      <p>
        NicoNico, or Nico Nico Douga, is a Japanese video-sharing
platform, with functionalities similar to those of YouTube.
With o cially more than 20 Million registered users, and
being ranked among the top 15 most visited websites of Japan,
it is a major Web 2.0 platform. It is especially famous for
the important community of people cooperating in the
creation of complex Music Videos centered on the character of
Hatsune Miku. Starting from an original song, many people
create videos based on it, with innovation such as dancing,
singing, creating new graphics, etc. More information about
this character and phenomenon can be found in [
        <xref ref-type="bibr" rid="ref10 ref6 ref8">8, 10, 6</xref>
        ].
We use the dataset described in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] which covers all 2,622,495
videos published on the network between January 2007 and
December 2012.
      </p>
      <sec id="sec-4-1">
        <title>De nition of a cooperation process</title>
        <p>In NicoNico, tags are associated with videos. We
automatically detect tags corresponding to songs with more than
500 related videos. These videos compose the cooperation
processes.</p>
      </sec>
      <sec id="sec-4-2">
        <title>De nition of a CP</title>
        <sec id="sec-4-2-1">
          <title>Name : Name of the Video</title>
        </sec>
        <sec id="sec-4-2-2">
          <title>Time : Upload time</title>
          <p>Category : extracted from keywords, examples are:
Dancing, Singing, 3D, Animation...</p>
          <p>References: authors include references to other videos
in their comments.</p>
        </sec>
      </sec>
      <sec id="sec-4-3">
        <title>Statistics</title>
        <p>We obtain 165 cooperation processes, composed by 500 to
7654 videos, with an average of 865 videos.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>2.2 Twitter</title>
      <p>
        Twitter is one of the most famous and largest Online
Social Networks. In this paper, we consider the di usion of
a particular tweet as our cooperation processes. We used
a dataset covering the period between March 5, 2011 and
March 24, and which covers most tweets published in Japan
during this period. Authors of this dataset claim to have
validated that 80% to 90% of all published tweets appear in
their dataset. For more information, please refer to [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <sec id="sec-5-1">
        <title>De nition of a cooperation Process</title>
        <p>
          We rst counted for each tweet in our dataset the number of
time they were retweeted, following the method described in
[
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. For all tweets retweeted more than 500 times, we collect
all the involved tweets and their information. Each of these
sets of tweet form a cooperation ow.
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>De nition of a CP</title>
        <sec id="sec-5-2-1">
          <title>Name : Retweeter's name</title>
        </sec>
        <sec id="sec-5-2-2">
          <title>Time : Time of the Retweet</title>
          <p>Category : Distance in the follower network between
original author and retweeter</p>
        </sec>
        <sec id="sec-5-2-3">
          <title>References: a retweet</title>
        </sec>
      </sec>
      <sec id="sec-5-3">
        <title>Statistics</title>
        <p>
          45 cooperation processes corresponding to retweet chains are
detected, involving between 500 and 2100 tweets, with an
average of 755 tweets.
2.3 DBLP
Massive cooperation predates the apparition of the World
Wide Web. Thousands of researchers around the world
cooperate to improve the global scienti c knowledge. We use
as a dataset the DBLP database [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], and in particular the
version including links between papers, as described in [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
This database is composed of 2,084,055 articles linked by
2,244,018 citations.
        </p>
      </sec>
      <sec id="sec-5-4">
        <title>De nition of a cooperation Process</title>
        <p>As we lack topic information, we de ne a cooperation
process for each article, with all other papers making a direct
reference to it composing the cooperation processes. This
de nition is not perfect, but, as we know that seminal
papers tend to act as " ags", that must be cited by everyone
working on a speci c topic, looking at all papers citing a
seminal one is an approximation of a group of works in the
same topic. We ltered out all cooperation processes with
less than 500 elements.</p>
      </sec>
      <sec id="sec-5-5">
        <title>De nition of a CP</title>
        <sec id="sec-5-5-1">
          <title>Name : Publication Title</title>
        </sec>
        <sec id="sec-5-5-2">
          <title>Time : Date of Publication</title>
        </sec>
        <sec id="sec-5-5-3">
          <title>Category : Venue of publication</title>
        </sec>
        <sec id="sec-5-5-4">
          <title>References: a citation to another paper</title>
        </sec>
      </sec>
      <sec id="sec-5-6">
        <title>Statistics</title>
        <p>After ltering, we obtained 41 citation ows, composed of
between 500 and 3651 papers, with an average of 664 papers.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>3. DESCRIPTION OF THE PLATFORM</title>
      <p>The platform we propose is composed of two parts: the time
series visualization and the cooperation ow visualization.
The time series provides a global understanding of the
different cooperation processes studied, together with global
indicators on them. In this view, only the global properties
are represented, not the individual agents and their
interactions. From this global view, it is then possible to select any
cooperation process and to visualize its inner details in the
cooperation ow view.</p>
      <p>In this second tool, in which the details of the cooperation
is displayed, several options are possible such as positioning
according to time or to step of cooperation, selecting the
number of nodes displayed, etc. The navigation between
these di erent displays in represented in Fig. 1</p>
    </sec>
    <sec id="sec-7">
      <title>3.1 Temporal trends</title>
      <p>
        When we are interested in a cooperation process, it is
often useful to have rst a global vision of it. We would like
to be able to answer general questions such as: when did
this process started? Is it already nished? Is it becoming
more or less popular? Are there some patterns in its
popularity? These are the global properties of this particular
cooperation.
3.1.1 Macro-level visualization: time series
The visualization we propose excludes the role of each
speci c element, to represents the process as a whole. To do
so, we choose to transform our data in time series, as much
work exists on the topic of time series analysis. For a given
dataset, we de ne a time step, which can be any period of
time (minute, day, year, etc.) and count the number of CPs
published for each category in each time step. For each
Cooperation Flow, we obtain as many time series as there are
categories. We display them as a shape, as shown in Fig.
7. The shape is constructed as a cumulative area chart
augmented with a mirror image of itself, to have a symmetric
shape. The lecture of it is identical to a normal
cumulative area chart. We choose this shape instead of a normal
cumulative area chart because we want to represent
several of these shapes on a same plot with a single time axis.
Therefore, the shape is not framed by the axis, and when
displayed on top of each other, it becomes more natural to
have a horizontally symmetrical shape, as represented on
Fig. 8. A similar observation has been done by the authors
of ThemeRiver [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>By displaying several shapes on the same chart, we are able
to visually compare them. Examples of interesting
observable facts include (but are not limited to):
The presence of bursts at a particular location, or
following a x period
Di erences between cooperation processes starting at
di erent times</p>
      <sec id="sec-7-1">
        <title>We complete this tool with some metrics:</title>
        <p>3.1.2 metrics and graphics</p>
        <sec id="sec-7-1-1">
          <title>Lifespan</title>
          <p>For each cooperative Process, we compute its lifespan,
dened as the time between the rst not null value of the time
series to the last occurrence of 3 consecutive not null values.
This limit is arbitrary, but the objective is to give an end
to a time series, potentially in nite, as a new CPs can
always occurs in the future. If these 3 non-null values are the
last 3 values of the time series, we consider the cooperation
process as "still alive". The distribution of the lifespans is
displayed as a bar chart.</p>
        </sec>
        <sec id="sec-7-1-2">
          <title>Normalized centroid</title>
          <p>We compute the normalized centroid of each cooperative
ow. The centroid of the time series is the step such as
there is as many CPs before and after it. We normalize it
by computing:</p>
          <p>N ormalizedCentroid =
centroidT ime
deathT ime</p>
          <p>birthT ime
birthT ime
:
A normalized centroid inferior or superior to 0.5 re ect the
fact that most of the CPs where produced in the beginning
or in the end of the lifespan of the cooperation process. The
distribution of the normalized centroid is displayed as a bar
chart.</p>
        </sec>
        <sec id="sec-7-1-3">
          <title>Burst detection</title>
          <p>
            Burst detection is a common problem on time series. A burst
is de ned as a period of time during which the time series
reach temporarily exceptionally high values. In a
cooperation ow, such a burst can typically appears in the beginning
(initial burst), at a given moment, driven by internal events
(new popular CP), or external factors. An interesting case
is when this external factor is not unique but periodic,
typically daily or yearly events. We therefore implemented a
research of such periodic bursts. We implemented the burst
detection with a simple but e ective technique, presented in
[
            <xref ref-type="bibr" rid="ref17">17</xref>
            ]. We represent the bursting period with a translucent
color as seen in 2. We compute normalize burst positions in
a similar manner as we computed normalized centroid, and
the summary of the most common burst positions detected
is also represented as a bar chart.
          </p>
          <p>The relative importance of di erent categories along
time
We found 5 cooperation processes with periodic bursts in
the NicoNico dataset, and we checked that all of them
corresponded to yearly events (songs about Christmas,
Halloween, etc.).</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>3.2 Micro-level visualization</title>
      <p>Whereas the time series visualization allow us to have a
quick understanding of global properties, it is often useful to
have more insights in the details of what is happening inside
each cooperative topic. In this second display, we combine a
visualization called cooperation ow together with some
alternatives displays and indicators, each of them emphasizing
one aspect of the studied cooperative topic.</p>
      <p>Original nodes (roots) Level 1</p>
      <p>Level 0</p>
      <p>Level 2</p>
      <p>Time (for a same level)</p>
      <p>
        Levels of cooperation
3.2.1 Cooperation Flow
To represent the details of the process of cooperation, we use
a type of visualization described in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. This visualization,
called Cooperation ow, allows us to represent in a single
visualization the key points of the details of the process. Its
mechanism is represented in Fig.3. The idea is that, through
the interface, we specify the maximum number of nodes that
we want to display, n. An algorithm compute which are the
n most important elements for the cooperation in the current
process. These nodes are then displayed, together with their
relations, as a network organized by steps of cooperation.
More formally, the step of a node is de ned as the length of
the shortest path between this node and a root, that is to
say a node without any reference to other nodes. The nodes
which are not considered important enough to be displayed
are, however, not simply omitted. By using a feature called
Reuse Indicator Torus (RI-Torus), a summary of these nodes
appears around their last displayed ancestor, as summarized
in Fig. 4.
3.2.2 Temporal Cooperation Flow
One interesting property of this visualization is that nodes
situated on overlapping y values are necessarily ordered in a
chronological order from left to right. Therefore, it is
possible to switch to a temporal representation without changing
the y position of nodes. This is illustrated on gure 5.
3.2.3 Complementary visualizations and metrics
We added to this visualization a set of informative
visualization and metrics, each of them focusing on a speci c aspect
of the cooperation. These tools are based on the same data
as the cooperation ow visualization. All of these tools are
not a ected by the selection of nodes we make for the ow
visualization, they are based on all available information.
      </p>
      <sec id="sec-8-1">
        <title>Impact of main CPs</title>
        <p>We observed that one characteristic which can vary greatly
between cooperation ows is the importance taken by the
most important productions. In some cases, a single
production, or a small subset of them, can generate most of the
CPs, that is, most of the CPs will directly reference it as a
unique source, either during the whole lifetime of the ow,
or just during a given period. To study this, we propose
a visualization in stacked area of the impact along time of
the top 5 nodes, toped by the impact of all remaining nodes
(Fig. 6). The lifetime of the ow is split in 10 sections. The
impact of a given CP during a given section is computed as
the number of CPs published during this period that
reference it. We use a black and white scale to avoid confusion
with the categories of CPs, already represented by colors.
Together with this visualization, we propose a metric to
measure this e ect, called CSC, for Cooperation Source
Concentration.</p>
        <p>CSC =</p>
        <p>Pv2T op1 jfu : (u; v) 2 Egj
jV j
1
Where T op1 is the set of the 1% nodes with the highest
indegree. This metric vary between lim0 and 1, where lim0
is the case where all nodes have the same in-degree, and 1
is reached when all nodes are successors of a single original
source. (star-like network) We give the average values of
CSC for our 3 datasets in Table 1. We can observe large
di erences, with NicoNico having the strongest CSC and
Twitter the lowest.</p>
      </sec>
      <sec id="sec-8-2">
        <title>Sustainability of the cooperation</title>
        <p>We observed that in some cooperation ow, there is not
much cooperation after the rst few levels -the number of
CP by level follows a fast shrinking trend- while, in others,
it is not the case. This might re ect the ability to renew the</p>
        <sec id="sec-8-2-1">
          <title>Average CSC</title>
          <p>NicoNico
0.92</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>4. EXAMPLE VISUALIZATIONS</title>
      <p>In this section, we brie y present some examples to show
the interest of our visualization.
interest in the trend by new CPs. We propose a visualization
of this e ect by a stacked bar chart graph (Fig. 6). Each
bar represent a level, and we simply count the number of
videos of each type published in each level. Together with
the general trend, this chart allows to see a change in the
categories correlated with the level. The color used for the
categories are coherent with the ones used in the cooperation
ow chart.</p>
      <p>The indicator we propose to summarize this chart is SC,
Sustainability of Cooperation. It is de ned as the average
of the variations of the number of CPs between successive
levels, pondered by the number of CPs in the rst of the
two:</p>
      <p>SC =</p>
      <p>Pnl 1 nbCP (i+1)
i=1 nbCP (i)</p>
      <p>(nbCP (i + 1) + nbCP (i))
nbCP (1) + 2 Pin=l 2 2 nbCP (i) + nbCP (nl
1)
with nbCP (i) the number of CPs at level i, and nl the
number of levels. SC=0 if there is no production after the rst
level. SC &gt;1 if the number of CPs tends to grow with each
level. The lower the SC value, the less CPs tend to generate
new cooperation. In Table 2, we represent the average value
of SC for our datasets.</p>
      <sec id="sec-9-1">
        <title>Average SC</title>
        <p>NicoNico
0.23
Twitter
0.39
DBLP
0.44</p>
      </sec>
    </sec>
    <sec id="sec-10">
      <title>4.2 Cooperation flows</title>
      <p>4.2.1 Deep study of one dataset: NicoNico
NicoNico is the richest and the most complex of our datasets.
In g. 9, we show 2 typical ow from this network. We can
make the following observations, also valid on most other
ows:
1. There is only one original source, and most of the
cooperation is made directly from this source, as we can
judge by the large RI-Torus
2. Most important nodes for the collaboration are on the
rst level, they directly reference the original node only
3. The cooperation is more wide than deep, there is not
much cooperation at a level greater than 3.
4. Although many categories (colors) are present, each
node seems to generate a specialized cooperation:
RITorus are mostly of a single color, not always the same.
5. There is no strong correlation between the number of
view of a video (area of inner circle) and its capacity
to generate cooperative behavior (torus area)
4.2.2 Comparison of datasets
In g. 10, we present two visualizations typical of the other
datasets. We can immediately spot some di erences. In
the tweet dataset, cooperation is deeper, and we tend to
see the formation of chains, long but without many
bifurcations. More important nodes are not necessarily situated
at the rst step, but can occur deeper. There seems to be
a stronger relation between the popularity of the node and
its role in the cooperation. There is not a single source.
In the citation dataset, we immediately spot a large
number of nodes making references to several others. These
nodes with many references are important in the
cooperation. Nodes at a deep level seem to generate as much
cooperation as those in the rst levels. There also seems to be a
lesser concentration in the cooperation generation: a larger
fraction of nodes are referenced by other important nodes,
and the gap is less important between the top in uential
nodes and the ordinary ones. Exploring in further details
the properties of the di erent datasets is beyond the scope
of this paper.</p>
    </sec>
    <sec id="sec-11">
      <title>5. CONCLUSION</title>
      <p>In this paper, we have presented a platform to explore mass
cooperation, and a set of tools to explore di erent aspects
of this type of cooperation. Our conception of such
visualization was driven by our previous experiences in the
exploration of large datasets formed by cooperation, and the
di culties encountered to understand the underlying
mechanisms.</p>
      <p>We also presented some complementary visualizations and
metrics that focus on several aspects of the data, with
different granularities, and can also help to apprehend it.
In the future, we hope that other researchers will use this
platform and help to improve it, either by their remarks or
extending the possibilities. In this prospect, we release its
source code, altogether with an interactive online version,
so as interested researchers could work with it as easily as
possible. In particular, it could be interesting to add metrics
and statistics, such as a one could choose the more
interesting indicators in his case. The source code and browsable
example is available on the website of the rst author.
Another future possibility is to propose Internet applications
based on this visualization to the destination of nal end
users. For example, one can think of a plug-in for Google
Scholar allowing to browse research topics.</p>
    </sec>
    <sec id="sec-12">
      <title>6. ACKNOWLEDGMENTS</title>
      <p>We thank Fujio Toriumi for collecting the Twitter dataset,
and allowing us to make use of it in this work.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Auber</surname>
          </string-name>
          .
          <article-title>Tulip, a huge graph visualization framework</article-title>
          .
          <source>In Graph Drawing Software</source>
          , pages
          <volume>105</volume>
          {
          <fpage>126</fpage>
          . Springer,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Bastian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Heymann</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Jacomy</surname>
          </string-name>
          .
          <article-title>Gephi: an open source software for exploring and manipulating networks</article-title>
          .
          <source>In ICWSM</source>
          , pages
          <volume>361</volume>
          {
          <fpage>362</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bender-deMoll</surname>
          </string-name>
          and
          <string-name>
            <given-names>D. A.</given-names>
            <surname>McFarland</surname>
          </string-name>
          .
          <article-title>The art and science of dynamic network visualization</article-title>
          .
          <source>Journal of Social Structure</source>
          ,
          <volume>7</volume>
          (
          <issue>2</issue>
          ):1{
          <fpage>38</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>R.</given-names>
            <surname>Cazabet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Pervin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Toriumi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Takeda</surname>
          </string-name>
          .
          <article-title>Information di usion on twitter: everyone has its chance, but all chances are not equal</article-title>
          .
          <source>In Signal-Image Technology &amp; Internet-Based Systems (SITIS)</source>
          , 2013 International Conference on, pages
          <volume>483</volume>
          {
          <fpage>490</fpage>
          . IEEE,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>R.</given-names>
            <surname>Cazabet</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Takeda</surname>
          </string-name>
          .
          <article-title>Understanding mass cooperation through visualization</article-title>
          .
          <source>ACM Conference on Hypertex and Social Media</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.</given-names>
            <surname>Cazabet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Takeda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hamasaki</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Amblard</surname>
          </string-name>
          .
          <article-title>Using dynamic community detection to identify trends in user-generated content</article-title>
          .
          <source>Social Network Analysis and Mining</source>
          ,
          <volume>2</volume>
          (
          <issue>4</issue>
          ):
          <volume>361</volume>
          {
          <fpage>371</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hamasaki</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Goto</surname>
          </string-name>
          .
          <article-title>Songrium: a music browsing assistance service based on visualization of massive open collaboration within music content creation community</article-title>
          .
          <source>In Proceedings of the 9th International Symposium on Open Collaboration, page 4. ACM</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hamasaki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Takeda</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Nishimura</surname>
          </string-name>
          .
          <article-title>Network analysis of massively collaborative creation of multimedia contents: case study of hatsune miku videos on nico nico douga</article-title>
          .
          <source>In Proceedings of the 1st international conference on Designing interactive user experiences for TV and video</source>
          , pages
          <volume>165</volume>
          {
          <fpage>168</fpage>
          . ACM,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Havre</surname>
          </string-name>
          , E. Hetzler,
          <string-name>
            <given-names>P.</given-names>
            <surname>Whitney</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Nowell</surname>
          </string-name>
          . Themeriver:
          <article-title>Visualizing thematic changes in large document collections</article-title>
          .
          <source>Visualization and Computer Graphics</source>
          , IEEE Transactions on,
          <volume>8</volume>
          (
          <issue>1</issue>
          ):9{
          <fpage>20</fpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>H.</given-names>
            <surname>Kenmochi</surname>
          </string-name>
          .
          <article-title>Vocaloid and hatsune miku phenomenon in japan</article-title>
          .
          <source>Proc. of InterSinging</source>
          <year>2010</year>
          , pages
          <issue>1{4</issue>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ley</surname>
          </string-name>
          .
          <article-title>The dblp computer science bibliography: Evolution, research issues, perspectives</article-title>
          .
          <source>In String Processing and Information Retrieval</source>
          , pages
          <fpage>1</fpage>
          <lpage>{</lpage>
          10. Springer,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>M.</given-names>
            <surname>Rosvall</surname>
          </string-name>
          and
          <string-name>
            <given-names>C. T.</given-names>
            <surname>Bergstrom</surname>
          </string-name>
          .
          <article-title>Mapping change in large networks</article-title>
          .
          <source>PloS one</source>
          ,
          <volume>5</volume>
          (
          <issue>1</issue>
          ):e8694,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>P.</given-names>
            <surname>Shannon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Markiel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Ozier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. S.</given-names>
            <surname>Baliga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ramage</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Amin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Schwikowski</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Ideker</surname>
          </string-name>
          .
          <article-title>Cytoscape: a software environment for integrated models of biomolecular interaction networks</article-title>
          .
          <source>Genome research</source>
          ,
          <volume>13</volume>
          (
          <issue>11</issue>
          ):
          <volume>2498</volume>
          {
          <fpage>2504</fpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , L. Yao,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Su</surname>
          </string-name>
          .
          <article-title>Arnetminer: extraction and mining of academic social networks</article-title>
          .
          <source>In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          , pages
          <volume>990</volume>
          {
          <fpage>998</fpage>
          . ACM,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>F.</given-names>
            <surname>Toriumi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Sakaki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Shinoda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kazama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kurihara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and I.</given-names>
            <surname>Noda</surname>
          </string-name>
          .
          <article-title>Information sharing on twitter during the 2011 catastrophic earthquake</article-title>
          .
          <source>In Proceedings of the 22nd international conference on World Wide Web companion</source>
          , pages
          <volume>1025</volume>
          {
          <fpage>1028</fpage>
          . International World Wide Web Conferences Steering Committee,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>F. B.</given-names>
            <surname>Viegas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wattenberg</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Dave</surname>
          </string-name>
          .
          <article-title>Studying cooperation and con ict between authors with history ow visualizations</article-title>
          .
          <source>In Proceedings of the SIGCHI conference on Human factors in computing systems</source>
          , pages
          <volume>575</volume>
          {
          <fpage>582</fpage>
          . ACM,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhu</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Shasha</surname>
          </string-name>
          .
          <article-title>E cient elastic burst detection in data streams</article-title>
          .
          <source>In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          , pages
          <volume>336</volume>
          {
          <fpage>345</fpage>
          . ACM,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>