<!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>Socio-semantic network data visualization</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alexey Drutsa</string-name>
          <email>alexey.drutsa@witology.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Konstantin Yavorskiy</string-name>
          <email>konstantin.yavorskiy@witology.com</email>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Moscow State University, Dep. of mech. &amp; math</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>The paper is devoted to some information visualization problems arising in the course of the development of the software package WitoAnalytics that enables to analyze and visualize data resulting from the socio-semantic network of the Witology web-platform. The work on the software is in progress. The article contains a short overview of the first software capabilities to visualize some types of socio-semantic network subgraphs.</p>
      </abstract>
      <kwd-group>
        <kwd>information visualization</kwd>
        <kwd>data visualization</kwd>
        <kwd>socio-semantic network</kwd>
        <kwd>graph</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>The Witology company is engaged in solution of some specific real-world
problems by constructing active human community, while developing collective mind
of participants. In order to achieve the goal a collaborative software platform
has been developed and used in the company. Its essential difference from other
similar systems consists in direct involvement of specifically trained facilitators
in the community. In connection with a possible large number of community
members, there is a need of a visual representation of data on their activity on
the platform. The data can be used by facilitators as analytical material allowing
them to quickly make the right decisions.</p>
      <p>
        At the present time, there is a large number of software designed for
analysis and visualization of social networks data (Social Network Analysis, SNA).
They include both wide-section programs to analyze all kinds of graphs such
as, for example, UCINet [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], Pajek [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and Cytoscape [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], and programs for the
text analysis, for example, Discourse Network Analyzer [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and AutoMap [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
Furthermore the class of SNA programs includes specialized software for the
analysis of social networks, for example, NodeXL [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], which allows you to
retrieve, analyze and visualize data from networks such as Twitter and Facebook.
Since the Witology platform is a socio-semantic network [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], then it requires a
special analysis software package, adjusted to analysis and visualization of this
type of network. Note that the main focus of the research is the scientific field
named information visualization [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ], rather than technological problems of
implementation of various methods.
      </p>
    </sec>
    <sec id="sec-2">
      <title>Problem statement</title>
      <p>
        In the paper [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] a general model of socio-semantic network is defined as a triplet
G = (G, C, A), such that
– G = {V, E1, . . . , Ek; π, δ1, . . . , δk} is a social network — weighted oriented
multi-graph, where V is a set of network members, E1, . . . , Ek ⊂ V × V are
different relations between the members, π : V → Π is a user profile function
and δi : Ei → Δi (i ∈ {1, . . . , k}) denotes parameters of corresponding
relation;
– C = {T, R1, . . . , Rm; θ, γ1, . . . , γm} is a content multi-graph, where T is a
set of all generated content elements (texts, media, evaluations, tags etc),
R1, . . . , Rm ⊂ T × T are different relations between the content elements, θ :
T → Θ denotes a function that corresponds to content element parameters
and γi : Ri → Γi (i ∈ {1, . . . , k}) denotes parameters of corresponding
relation;
– A ⊂ V × T is a authorship relation between the social graph and the content.
      </p>
      <p>For such graph analysis the following task is posed: to develop a series of
visualizations for the most significant activity of the participants in the platform
that would convey the activity in the most informative manner. For instance it
could be user evaluations, text generation and etc. Such visualizations should
demonstrate both time slices of the database and data change over time.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Results</title>
      <p>In order to solve the task a specialized software package (hereinafter referred to
WitoAnalytics) was developed. As mentioned above, the software developed by
paper authors could be regarded as one of many SNA softwares, but adjusted
to the analysis and visualization of a particular type of graph — socio-semantic
network of the Witology platform. The network presented in the current article
has more than 500 members and, but the visualizations contains around 200
major network members. At the moment the package allows you to build
multiple WitoAnalytics monocot graph visualization and visualization of a bipartite
graph.
3.1</p>
      <sec id="sec-3-1">
        <title>User estimation graph</title>
        <p>Consider the following oriented weighted subgraph of socio-semantic network:
Ge = {Ve, Ee, δe}, where δe : Ee → [−k, k] × N is a bidimensional edge weight,
the first component corresponding to the average value of vertex estimates (in
some range [−k, k]) and the second component corresponding to the number of
the estimates. Hereinafter the subgraph will be called as user estimation graph.
Such graph could result from user content estimation data taking into account
the author relations for the estimations and for the content which is estimated
(like texts, etc).</p>
        <p>The two following visualizations of user estimation graph are proposed. The
first is a bipartite representation, where each element from Ve is associated with
two nodes situated on a plain, their vertical coordinates being equal. In this case
the direction of edges coincides with direction of horizontal axis. The
visualization is named as ”Elka” (spruce, rus.) and its example is presented in figure 1
(A). Here the edge thickness corresponds to the number of estimates between
nodes, and the edge color corresponds to the average value, diagonal edges being
marked out with special color. Histograms of out-estimate distribution (on the
left) and in-estimate distribution (on the right) are displayed near the nodes.
A local user neighborhood of the user estimation graph is presented in figure 1
(B), that is only the edges connected with a fixed user are displayed and the
nodes without visible edges are removed. Figure 2 contains a scaled-up part of
the visualization ”Elka” presented in figure 1 (A).</p>
        <p>The second variant of user estimation graph visualization is a monocot
representation, where each element from Ve is associated with only one node situated
on a circumference. In order to distinguish in-edges and out-edges for a node all
the in-edges have same joining angle to the node and all the out-edges have
another same joining angle, in-angle and out-angle being not coincided and defining
directions, that are symmetric with respect to the radius connected the node.
The visualization is named as ”Solntse” (sun, rus.) and its example is presented
on the figure 3.</p>
        <p>The visualization ”Elka” allows us to quickly and accurately provide overall
picture of estimations between users, and to identify the nature of evaluations
of individual users stood out against a background of other users. Thus, for
instance, one can see in figure 1, that all users on average have neutrally
estimated each other. At the same time, some nodes stand out among them, their
estimates are almost completely negative, or, conversely, are positive. Such users,
for example, may be taken under special control by facilitators. In addition, such
visualization could be used in order to instantly find a negative evaluation
conspiracy of a user group against an individual node. This would be expressed in
several broad red lines, leading to one of the nodes in the right column, and
other its in-edges on average would not have red color.</p>
        <p>Unfortunately, the visualization ”Elka” cannot identify so-called ”mark up”
groups, in which an agreement between users on mutual positive estimation
exists. Thus, even a group with two members must be a kind of thick green
intersecting edges in the visualization, their symmetry check is quite time-consuming
process for a large amount of nodes. To solve this problem the visualization
”Solntse” can be very suitable, because in this case incoming and outgoing edge
ends of a node coincide.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Idea support graph</title>
        <p>Let’s consider a restriction of socio-semantic graph G¯ = (G¯, C¯, A), where content
C¯ contains only one relation R¯, which is strict partial order relation on the set
T¯, and G¯ contains also only one relation E¯ induced by the ratio of A as follows:
vE¯w ⇐⇒ ∃t, τ ∈ T¯ | vAτ ∧ wAt ∧ tR¯τ ∧ τ ∈ T¯0,
where T¯0 — the set of all maximum elements from T¯ relatively R¯. Then such
subgraph G¯ will be called as idea support graph. Idea support graph is visualized
by WitoAnalytics as follows. The nodes V¯ are allocated on an outer concentric
circumference, and the nodes T¯0 are allocated on an inner concentric
circumference. Size of the nodes and their deviation from the line of the circumference
corresponds to the number of edges. The visualization is named as ”Glaz” (eye,
rus.) and its example is presented in figure 5.
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Short review of current WitoAnalytics capabilities</title>
        <p>
          In the current state WitoAnalytics has the following list of capabilities:
– visualizations of user text estimation (5 types, that include both general view
of the graph, and individual user view);
– visualizations of user actions like ”content creation”, ”content evaluation”,
”content commenting” and etc;
– visualization of user group diversity (dendogram visualizations, adjacency
matrix visualizations, histograms and densities);
– valued graph clusterization (3 methods, that include random max-clique
search algorithm);
– N-gram and word extracting from user content.
Since Witology is a relatively young company the work on the analysis and
visualization of socio-semantic network data of the platform is the unfinished
project, in the framework of which one has to solve many analytical problems
and problems of visualization known as information visualization problems [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
They include the following questions:
– what data to visualize, for example, to detect collusion and ”mark up” groups
of participants for many different subgraphs of the platform;
– how to place nodes and edges;
– which thresholds and for which the parameters of nodes and edges should
be set.
        </p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Alexey</given-names>
            <surname>Drutsa</surname>
          </string-name>
          , Konstantin Yavorskiy,
          <article-title>Visualizatsia dannikh sociosemanticheskoy seti, Dokladi po komputernim naukam i informatsionnim tekhnologiyam</article-title>
          ,
          <source>Natsionalniy Otkritiy Universitet ”INTUIT”</source>
          , Moscow, 1,
          <year>2012</year>
          , pp.
          <fpage>112</fpage>
          -
          <lpage>118</lpage>
          (in russian).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Rostislav</surname>
            <given-names>Yavorskiy</given-names>
          </string-name>
          , Research Challenges of Dynamic Socio-Semantic Networks, http://www.witology.com.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Steve</given-names>
            <surname>Borgatti</surname>
          </string-name>
          ,
          <source>Martin Everett and Lin Freeman</source>
          ,
          <string-name>
            <surname>UCINET</surname>
          </string-name>
          , Analytic Technologies, http://www.analytictech.com/ucinet/.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>4. Pajek, http://vlado.fmf.uni-lj.si/pub/networks/pajek/.</mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>5. Cytoscape, http://www.cytoscape.org/.</mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Philip</given-names>
            <surname>Leifeld</surname>
          </string-name>
          , Discourse Network Analyzer, http://www.philipleifeld.de/ discourse-network-analyzer/.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Auto</given-names>
            <surname>Map</surname>
          </string-name>
          , Casos, http://www.casos.cs.cmu.edu/projects/automap/.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>8. NodeXL, CodePlex, http://nodexl.codeplex.com/.</mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>Z. V.</given-names>
            <surname>Apanovich</surname>
          </string-name>
          , Metodi visualizatsii informatsii - naukoemkoe
          <string-name>
            <surname>napravlenie</surname>
            <given-names>IT</given-names>
          </string-name>
          ,
          <article-title>Komp'uternie instrumenti v obrazovanii, No 2, 2010 (in russian).</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>Z. V.</given-names>
            <surname>Apanovich</surname>
          </string-name>
          ,
          <article-title>Ot risovania graphov k visualizatsii informatsii</article-title>
          ,
          <source>(preprint) Novosibirsk</source>
          , 27 p.,
          <year>2007</year>
          (http://www.iis.nsk.su/files/preprints/148.pdf) (in russian).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>