<!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>Visualizing criminal networks reconstructed from mobile phone records</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Emilio Ferrara</string-name>
          <email>ferrarae@indiana.edu</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pasquale De Meo</string-name>
          <email>pdemeo@unime.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Salvatore Catanese,</string-name>
          <email>fscatanese,g umarag@unime.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Ancient and</institution>
          ,
          <addr-line>Modern Civilizations</addr-line>
          ,
          <institution>University of Messina</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Giacomo Fiumara, Department of Mathematics</institution>
          ,
          <addr-line>and Computer Science</addr-line>
          ,
          <institution>University of Messina</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>School of Informatics and Computing, Indiana University Bloomington</institution>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In the ght against the racketeering and terrorism, knowledge about the structure and the organization of criminal networks is of fundamental importance for both the investigations and the development of e cient strategies to prevent and restrain crimes. Intelligence agencies exploit information obtained from the analysis of large amounts of heterogeneous data deriving from various informative sources including the records of phone tra c, the social networks, surveillance data, interview data, experiential police data, and police intelligence les, to acquire knowledge about criminal networks and initiate accurate and destabilizing actions. In this context, visual representation techniques coordinate the exploration of the structure of the network together with the metrics of social network analysis. Nevertheless, the utility of visualization tools may become limited when the dimension and the complexity of the system under analysis grow beyond certain terms. In this paper we show how we employ some interactive visualization techniques to represent criminal and terrorist networks reconstructed from phone tra c data, namely foci, sheye and geo-mapping network layouts. These methods allow the exploration of the network through animated transitions among visualization models and local enlargement techniques in order to improve the comprehension of interesting areas. By combining the features of the various visualization models it is possible to gain substantial enhancements with respect to classic visualization models, often unreadable in those cases of great complexity of the network.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Mobile phone networks</kwd>
        <kwd>criminal networks</kwd>
        <kwd>visualization</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Categories and Subject Descriptors</title>
      <p>[Information systems]: World Wide Web|Social
networks; [Networks]: Network types|Social media
networks</p>
    </sec>
    <sec id="sec-2">
      <title>1. INTRODUCTION</title>
      <p>
        Criminal Network Analysis allows to identify structure and
ow of information among the members of a criminal
network and to acquire the knowledge necessary to plan
proactive and reactive interventions. Among the more frequently
used analytic techniques there is the mapping of interactions
among the members of the organization and their activities
by means of a graph [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. A graph representation allows
to overview the network structure, to identify the cliques,
the groups, and the key players. The possibility of mapping
the attributes of data and metrics of the network using
visual properties of the nodes and edges makes this technique
a powerful investigative tool. Often, however, visualization
techniques become discouraging as a consequence of density
and dimensions of the network. Some obstacles such as the
overlap of nodes and the dense intersections of edges severely
reduce the readability of the graph. In other words, there
is a limit to the number of elements which can be distinctly
viewed from the human eye. An in uential theory about
the improvement of the quality of network visualization has
been suggested by Shneiderman in [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ], where the so-called
\Network Nirvana" is described. According to this theory,
some demanding targets must be pursued: i) the visibility
of each node; ii) the possibility of counting the degree of
each node; iii) the possibility of following each edge from
the source to the destination nodes and, iv) the possibility
of identifying the clusters. Although it can be challenging,
or even impossible, to satisfy all these conditions at the same
time as the network grows in size and complexity, an e
ective network analysis strategy should try to optimize the
visualization methods in order to incorporate these
guidelines. In this work, we present three visualization techniques
that yield better network representations that, in turn, allow
for enhanced data interpretability; we discuss these layout
techniques, namely sheye, foci and network geo-mapping,
speci cally in the context of criminal network analysis, but
we do not exclude a broader applicability to other domains
of social network analysis (SNA).
      </p>
    </sec>
    <sec id="sec-3">
      <title>1.1 Literature on criminal network analysis</title>
      <p>
        In the last thirty years academic research related to the
application of social network analysis to intelligence and study
of criminal organizations has constantly grown. One of the
most important studies is due to Malcolm Sparrow [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ],
related to the application of the techniques of analysis of
networks, and their vulnerabilities, for intelligence scopes.
Sparrow de ned four features peculiar of criminal networks
(CNs), namely: i) limited dimension | CNs are often
composed of at most few thousand nodes; ii) information
incompleteness | criminal or terrorist networks are unavoidably
incomplete due to fragmentary available information and
erroneous information; iii) unde ned borders | it is di cult
to determine all the relations of a node; and, iv) dynamics |
new connections imply a constant evolution of the structure
of the network.
      </p>
      <p>
        Thanks to Sparrow's work, other authors tried to study
criminal networks using the tools of SNA. For example,
Baker and Faulkner [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] studied illegal networks in the eld
of electric plants and Klerks [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] focused on criminal
organizations in The Netherlands. In 2001, Silke [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ] and Brennan
et al. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] acknowledged a slow growth in the ght against
terrorism, and examined the state of the art in the eld of
criminal network analysis.
      </p>
      <p>
        Arquilla and Ronfeldt [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] summarize prior research by
introducing the concept of Netwar and its applicability to
terrorism. They illustrate the di erence between social networks
and CNs, demonstrating the great utility of network models
to understand the nature of criminal organizations.
All these early studies somehow neglected the importance
of network visualization, stressing aspects related more to
statistical network characterization, or interpretation of
individuals' roles rooted in social theory. However, in 2006,
a popular work by Valdis Krebs [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] applied graph analysis
in conjunction with network visualization theory to analyze
the Al Qaeda cell responsible of the 2001-09-11 terrorist
attacks in the USA. This work represents a starting point of
a series of academic papers in which social network analysis
methods become applied to a real-world cases, di erently
from previous work where mostly toy models and ctitious
networks were used. Krebs' paper is one of the more cited
papers in the eld of application of social network
analysis to Criminal Networks and it inspired further research in
network visualization for the design and development of
better SNA tools applications to support intelligence agencies
in the ght against terror, and law enforcement agencies in
their quest ghting crime.
      </p>
    </sec>
    <sec id="sec-4">
      <title>2. THE PROBLEM</title>
      <p>
        In criminology and research on terrorism, SNA has been
proved a powerful tool to learn the structure of a criminal
organization. It allows analysts to understand the structural
relevance of single actors and the relations among members,
when regarded as individuals or members of (one or more)
subgroup(s). SNA de nes the key concepts to characterize
network structure and roles, such as centrality [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], node
and edge betweenness [
        <xref ref-type="bibr" rid="ref14 ref16 ref6">16, 6, 14</xref>
        ], and structural similarity
[
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]. The understanding of network structure derived from
these concepts would not be possible otherwise [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ]. The
above-mentioned structural properties are heavily employed
to visually represent social and criminal networks as a
support decision-making processes.
      </p>
      <p>
        SNA provides key techniques including the possibility to
detect clusters, identify the most important actors and their
roles and unveil interactions through various graphical
representation methodologies [
        <xref ref-type="bibr" rid="ref40">40</xref>
        ]. Some of these methods are
explicitly designed to identify groups within the network,
while others have been developed to show social positions of
group members. The most common graphical layouts have
historically been the node-link and the matrix
representations [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
      </p>
      <p>
        Visualization has become increasingly important to gain
information about the structure and the dynamics of social
networks: since the introduction of sociograms, it appeared
clear that a deep understanding of a social network was not
achievable only through some statistical network
characterization [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ].
      </p>
      <p>
        For all these reasons, a number of di erent challenges in
network visualization have been proposed [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ]. The study
of network visualization focuses on the solution of the
problems related to clarity and scalability of the methods of
automatic representation. The development of a visualization
system exploits various technologies and faces some
fundamental aspects such as: i) the choice of the layout; ii) the
exploration dynamics; and, iii) the interactivity modes
introduced to reduce the visual complexity.
      </p>
      <p>
        Recent studies tried to improve the exploration of networks
by adding views, user interface techniques and modes of
interaction more advanced than the conventional node-link
and force-directed [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] layouts. For example, in
SocialAction [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ] users are able to classify and lter the nodes of
the network according to the values of their statistical
properties. In MatrixExplorer [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] the node-link layout is
integrated with the matrix layout. Nonetheless, these
visualization systems have not been explicitly developed with the
aim of the exhaustive comprehension of all properties of the
network. Users need to synthesize the results coming from
some views and assemble metrics with the overall structure
of the network.
      </p>
      <p>
        Therefore, we believe that an e cient method to enhance
the comprehension and the study of social networks, and in
particular of criminal networks, is to provide a more explicit
and e ective node-link layout algorithm. This way,
important insights could be obtained from a unique layout rather
than from the synthesis derived from some di erent layouts.
We recently presented a framework, called LogAnalysis [
        <xref ref-type="bibr" rid="ref15 ref9">9,
15</xref>
        ], that incorporates various features of social network
analysis tools, but explicitly designed to handle criminal
networks reconstructed from phone call interactions. This
framework allows to visualize and analyze the phone tra c of a
criminal network by integrating the node-link layout
representation together with the navigation techniques of
zooming and focusing and contextualizing. The reduction of the
visual complexity is obtained by using hierarchical
clustering algorithms. In this paper we discuss three new network
layout methods that have been recently introduced in
LogAnalysis, namely sheye, foci and geo-mapping, and we
explain how these methods help investigators and law
enforcement agents in their quest to ght crime.
      </p>
      <p>
        It's worth noting that various tools to support network
analysis exist. However, only few of them have been developed
speci cally for criminal network investigations. We mention,
among others, commercial tools like COPLINK [
        <xref ref-type="bibr" rid="ref10 ref37">10, 37</xref>
        ],
Analyst's Notebook1, Xanalysis Link Explorer2 and Palantir
Government3. Other prototypes described in academic
papers include Sandbox [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ] and POLESTAR [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ]. Some of
these tools show similar features to LogAnalysis, but, to the
best of our knowledge, none of them yields the same e ective
and scalable network visualization with support to criminal
networks reconstructed from phone call records.
      </p>
    </sec>
    <sec id="sec-5">
      <title>2.1 Aspects of structural analysis</title>
      <p>A central node of a criminal network may play a key role
by acting as a leader, issuing orders, providing regulations
or by e ectively assuring the ow of information through
the various components of the CN. The removal of these
central nodes may e ciently fragment the organization and
interrupt the prosecution of a criminal activity.</p>
      <p>Apart from studying the roles of various members,
investigative o cers must pay particular attention to subgroups
or gangs each of which may be in charge of speci c tasks.
Members of the organization must interact and cooperate
in order to accomplish their illicit activities. Therefore, the
detection of subgroups whose members are tightly
interrelated may increase the comprehension of the organization
of the CN. Moreover, groups may interact according to
certain schemes. For example, the members of a clan could
frequently interact with the members of another and seldom
with the remaining members of the network. The detection
of interaction models and the relations among the subgroups
highlights information particularly useful about the overall
structure of the network.</p>
      <p>
        A signi cant aspect of the analysis of criminal networks is
that it requires, di erently from other networks, the ability
of integrating information deriving from other sources in
order to precisely understand its structure, operation and ow
of information. A typical process employed by an
investigator is to start from one, or a few, known entities; after
analyzing the associations these entities have with others, if
any interesting association emerges, one may follow such a
lead and keep expanding the associations until any signi
cant link is uncovered between seemingly unrelated entities.
Mobile phone networks and online platforms are constantly
used to perform or coordinate criminal activities [
        <xref ref-type="bibr" rid="ref26 ref38">38, 26</xref>
        ].
Phone networks can be used to connect individuals involved
in criminal activities in real time, often during real-world
criminal events, from simple robberies to terror attacks.
Online platforms, instead, can be exploited to carry out illicit
activities such as frauds, identity thefts or to access classi ed
information.
      </p>
      <p>The analysis of a criminal network is thus aimed at uncover
the structural schemes of the organization, its operations
and, even more importantly, the ow of communications
among its members. In modern investigative techniques the
analysis of phone records represents a rst approach that
precedes a more re ned scrutiny covering nancial
transactions and interpersonal relations. For these reasons a
structured approach is needed.
1ibm.com/software/products/analysts-notebook/
2http://www.xanalys.com/products/link-explorer/
3http://www.palantir.com/solutions/</p>
    </sec>
    <sec id="sec-6">
      <title>3. VISUALIZATION TECHNIQUES</title>
      <p>
        Typical network visualization tools rely on the popular
forcedirected layout [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. The force-directed model represents the
structure of the graph on the same foot as a physical system,
in which nodes are physical points subject to various forces;
nodes' coordinates (and therefore the layout itself) derive
from the search of an equilibrium con guration of the
physical system modeled by the algorithm [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. This particular
layout arrangement has the advantage of grouping users in
clusters which can be identi ed according to the heightened
connectivity. The Barnes-Hut algorithm [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] associated to
this layout simulates a repulsive N-body system in order to
continuously update the position of the elements.
To optimize the visualization, it is possible to interactively
modify the parameters relative to the tension of the springs
(edges). Nodes with low degree are associated a small
tension and the elements are located in peripheral positions
with respect to high degree nodes. Other parameters can be
tuned, such as spring tension, gravitational force and
viscosity. Our goal, in the following, is to suggest two methods to
improve force-directed based layouts. As we will show, these
techniques are especially well suited for criminal network
analysis; however, they could potentially be generalized for
broader usage in other domains of network analysis | for
example, for applications in social and political sciences.
      </p>
    </sec>
    <sec id="sec-7">
      <title>3.1 Focus and context based visualization</title>
      <p>
        The number of edges within a network usually grows faster
than the number of nodes. As a consequence, the network
layout would necessarily contain groups of nodes in which
some local details would easily become unreadable because
of density and overlap of the edges. As the size and
complexity of the network grow, eventually nodes and edges become
indistinguishable. This problem is known as visual
overload [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. A commonly used technique to work around visual
overload consists of employing a zoom-in function able to
enlarge the part of the graph of interest. The drawback of
this operation is the detriment of the visualization of the
global structure which, during the zooming, would not be
displayed. However, such a compromise is reasonable in a
number of situations including, in some cases, the domain
of criminal network analysis.
      </p>
      <p>During an investigation, it is crucial to narrow down the
analysis to the relevant suspects, to e ciently employ human
and computational resources. Police o cers typically draw
some hypotheses about an individual suspect of being part
of a criminal organization, or of being involved (or about
to) in some crime; they concentrate the initial investigation
on this individual, and on that person's social circles, as a
ground to build the social network object of analysis. The
main role of visual analysis lies in allowing the detection
of unknown relations, on the base of the available limited
information. A typical procedure starts from known entities,
to analyze the relations with other subjects and continue to
expand the network inspecting rst the edges appearing the
most between individuals apparently unrelated. During this
procedure, only some nodes are relevant and it is important
to focus on them rather than on the network as a whole.
Nevertheless, a spring embedded layout (including
forcedirected ones) does not provide any support to this kind
of focus and analysis. In these situations, focus and context
visualization techniques are needed in order to help a user
to explore a speci c part of a complex network. To this
purpose, we here introduce the sheye and the foci layouts.</p>
    </sec>
    <sec id="sec-8">
      <title>3.2 Fisheye layout</title>
      <p>
        Focus and context is an interactive visualization technique
[
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. It allows the user to focus on one or more areas of a
social network, to dynamically tune the layout as a
function of the focus, and to improve the visualization of the
neighboring context. The sheye view is a particular focus
and context visualization technique which has been applied
to visualize self-organizing maps in the Web sur ng [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ]. It
was rst proposed by Furnas [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] and successively enriched
by Brown et al. [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]. It is known as a visualization technique
that introduces distortion in the displayed information.
The sheye layout is a local linear enlargement technique
that, without modifying the size of the visualization canvas,
allows to enhance the region surrounding the focus, while
compressing the remote neighboring regions. The overall
structure of the network is nevertheless maintained. An
example of application of this technique is show in Figure 2.
The picture shows a moderately small criminal network
reconstructed from phone call interactions of about 75
individuals. The layout on the left panel is obtained by using a
force-directed method implemented in our framework,
LogAnalysis. The analyst can inspect the nodes of the network,
which contains known criminals, suspects, and their social
circles. When the focus is applied on a given node, the
visualization transitions to the sheye layout (see the right
panel). A tool-tip with additional information about the
node appears when the node is selected | it shows the phone
number, personal details, address, photo, etc. The layout
causes edges among remote nodes to experience stronger
distortions than local nodes. The upside of the presented
method is the possibility to achieve the three
recommendations of Network Nirvana [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ] when focusing on a given
node: all the nodes' neighbors are clearly visible, the node
degree is easily countable, and the edges incident on that
node can be identi ed and followed.
      </p>
      <p>Note that sheye and force-directed layouts can be used in
a complementary way. By combining the two methods, our
framework e ciently yields focus and context views.</p>
    </sec>
    <sec id="sec-9">
      <title>3.3 Foci layout</title>
      <p>
        The foci layout implements three network visualization
models: force-directed, semantic and clustered layouts. The
latter is based on the Louvain community detection algorithm
[
        <xref ref-type="bibr" rid="ref11 ref5">5, 11</xref>
        ]. Future implementations will explore other methods
[
        <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
        ]. Our model supports multilayer analysis of the
network through interactive transitions from the force-directed
layout, with a single gravitational center, to the clustered
one with more force centers placed in predetermined distinct
areas. This layout allows to analyze the network on various
layering levels depending on speci ed node attributes.
Figure 3 shows the phone tra c network of some clans the
previous criminal network, in which the color of the nodes
denotes the type of crime committed by the members.
In this example, the clustering truthfully re ects the known
territorial division among the groups belonging to the
organization. In Figure 3 the focus is on a speci c node. Using
this layout it is possible to contextually analyze the
community structure, the type of committed crime in respect to the
members of the clan, and the direct relations of each single
individual. This layout integrates also the forth Network
Nirvana recommendation, namely the possibility to identify
clusters and to highlight the community structure.
      </p>
    </sec>
    <sec id="sec-10">
      <title>3.4 Network geo-mapping</title>
      <p>
        It is possible to extend the phone tra c analysis to include
the phone logs recorded by the BTS (Base Transceiver
Station), in which the GPS coordinates of the cell are reported.
All base stations are provided with directional antennas and
each cell has two or more sectors. For each cell it is known
the azimuth (direction) corresponding to the central axis of
each sector, together with the width of the beam of each
antenna, which determines the coverage angle of the sector.
These data do not allow to localize the geo-referenced
position of the phones involved in the events recorded in the logs.
Nevertheless, it is possible, within a certain approximation,
to localize the users falling within the coverage area.
Zang et al. [
        <xref ref-type="bibr" rid="ref41">41</xref>
        ] described a technique based on Bayesian
interference to localize mobile phones using additional
information, such as the round-trip-time of data transmission
packets and the measure of SINR (Signal to Interference plus
Noise Ratio). The parameters obtained experimentally have
been compared with the records of phone calls and the
corresponding GPS entries to ascertain their distribution. This
localization technique produces satisfactory results with a
reduction of the error amounting to a 20% with respect to
the blind approach. Traag et al. in [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ] used Bayesian
interference to deduce, starting from phone tra c data, pro les
about the places and the proximity of a given social event.
Our framework provides network geo-mapping by using this
type of techniques to infer the spatial origin of each call. We
here describe the network geo-mapping visualization method
adopted in LogAnalysis. This layout allows to
simultaneously carry out spatial and temporal relational analysis of
phone call logs. It places nodes of the network on a map,
in correspondence of the coordinates of the cells linked
during the events recorded in the logs. Nodes are connected
by links related to displacements. Contacts falling within
the sectors of a given zone are represented with nodes of
the same color. Information about displacements, routines
and areas of interest for the investigation are displayed. The
adoption of network geo-mapping has proved extremely
useful during real investigations. Figure 4 shows, as an
example, a case study in which larger nodes identify zones in
which, in the time period of the investigation, a high
number of contacts has been recorded among some members of
the CN. Unsurprisingly, the inspection by police o cers of
such high-pro le locations provided crucial insights on the
investigation. Unfolding the temporal evolution of the
geomapped phone tra c network also allows to reproduce
individuals' movements and communication dynamics during
speci c criminal events embedded in space and time, like
robberies, assaults, or homicides.
      </p>
    </sec>
    <sec id="sec-11">
      <title>4. CONCLUSIONS</title>
      <p>Criminal network analysis bene ts from visualization
methods used to support the investigations, especially when
dealing with networks reconstructed from heterogeneous data
sources, characterized by increasing size and complexity. In
this paper we integrated the spring embedded algorithm
with the sheye and foci layouts to allow interactive
exploration of criminal networks through our network
analysis framework. The combination of these techniques proved
helpful to support investigators in the extraction of useful
information and critical insights, to identify key members
in terrorist groups, and to discover speci c paths of
interaction among members of criminal organizations.
Experimental results show that the combination of force-directed
layouts, distortion techniques and multi-force systems yield
better performance in terms of both e ciency and e cacy.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Arquilla</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Ronfeldt</surname>
          </string-name>
          .
          <article-title>Networks and netwars: The future of terror, crime, and militancy</article-title>
          .
          <source>Survival</source>
          ,
          <volume>44</volume>
          (
          <issue>2</issue>
          ):
          <volume>175</volume>
          {
          <fpage>176</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Assa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cohen-Or</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Milo</surname>
          </string-name>
          .
          <article-title>Displaying data in multidimensional relevance space with 2d visualization maps</article-title>
          .
          <source>In Proc. Visualization '97</source>
          , pages
          <fpage>127</fpage>
          {
          <fpage>134</fpage>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>W.</given-names>
            <surname>Baker</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Faulkner</surname>
          </string-name>
          .
          <article-title>The social organization of conspiracy: illegal networks in the heavy electrical equipment industry</article-title>
          .
          <source>Am. Social. Rev., 58</source>
          ,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Barnes</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Hut</surname>
          </string-name>
          .
          <article-title>A hierarchical o(n log n) force calculation algorithm</article-title>
          .
          <source>Nature</source>
          ,
          <volume>324</volume>
          :
          <fpage>446</fpage>
          {
          <fpage>449</fpage>
          ,
          <year>1986</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>V. D.</given-names>
            <surname>Blondel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-L.</given-names>
            <surname>Guillaume</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Lambiotte</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Lefebvre</surname>
          </string-name>
          .
          <article-title>Fast unfolding of communities in large networks</article-title>
          .
          <source>Journal of Statistical Mechanics: Theory and Experiment</source>
          ,
          <year>2008</year>
          (
          <volume>10</volume>
          ):P10008+,
          <year>July 2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>U.</given-names>
            <surname>Brandes</surname>
          </string-name>
          .
          <article-title>A faster algorithm for betweenness centrality</article-title>
          .
          <source>Journal of Mathematical Sociology</source>
          ,
          <volume>25</volume>
          (
          <issue>2</issue>
          ):
          <volume>163</volume>
          {
          <fpage>177</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>U.</given-names>
            <surname>Brandes</surname>
          </string-name>
          .
          <article-title>Drawing on physical analogies</article-title>
          .
          <source>In Drawing Graphs</source>
          , pages
          <volume>71</volume>
          {
          <fpage>86</fpage>
          . Springer,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D. W.</given-names>
            <surname>Brannan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. F.</given-names>
            <surname>Esler</surname>
          </string-name>
          , and
          <string-name>
            <given-names>N. T. Anders</given-names>
            <surname>Strindberg</surname>
          </string-name>
          .
          <article-title>Talking to terrorists: Towards an independent analytical framework for the study of violent substate activism</article-title>
          .
          <source>Studies in Con ict and Terrorism</source>
          ,
          <volume>24</volume>
          (
          <issue>1</issue>
          ):3{
          <fpage>24</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Catanese</surname>
          </string-name>
          , E. Ferrara, and
          <string-name>
            <given-names>G.</given-names>
            <surname>Fiumara</surname>
          </string-name>
          .
          <article-title>Forensic analysis of phone call networks</article-title>
          .
          <source>Social Network Analysis and Mining</source>
          ,
          <volume>3</volume>
          (
          <issue>1</issue>
          ):
          <volume>15</volume>
          {
          <fpage>33</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>H.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zeng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Atabakhsh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wyzga</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Schroeder</surname>
          </string-name>
          .
          <article-title>Coplink: managing law enforcement data and knowledge</article-title>
          .
          <source>Comm. ACM</source>
          ,
          <volume>46</volume>
          (
          <issue>1</issue>
          ):
          <volume>28</volume>
          {
          <fpage>34</fpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>P. De Meo</surname>
            , E. Ferrara,
            <given-names>G.</given-names>
          </string-name>
          <article-title>Fiumara, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Provetti</surname>
          </string-name>
          .
          <article-title>Generalized Louvain method for community detection in large networks</article-title>
          .
          <source>In Proc. 11th International Conference on Intelligent Systems Design and Applications</source>
          , pages
          <volume>88</volume>
          {
          <fpage>93</fpage>
          . IEEE,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>P. De Meo</surname>
            , E. Ferrara,
            <given-names>G.</given-names>
          </string-name>
          <article-title>Fiumara, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Provetti</surname>
          </string-name>
          .
          <article-title>Enhancing community detection using a network weighting strategy</article-title>
          .
          <source>Information Sciences</source>
          ,
          <volume>222</volume>
          :
          <fpage>648</fpage>
          {
          <fpage>668</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>P. De Meo</surname>
            , E. Ferrara,
            <given-names>G.</given-names>
          </string-name>
          <article-title>Fiumara, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Provetti</surname>
          </string-name>
          .
          <article-title>Mixing local and global information for community detection in large networks</article-title>
          .
          <source>Journal of Computer and System Sciences</source>
          ,
          <volume>80</volume>
          (
          <issue>1</issue>
          ):
          <volume>72</volume>
          {
          <fpage>87</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>P. De Meo</surname>
            , E. Ferrara,
            <given-names>G.</given-names>
          </string-name>
          <article-title>Fiumara, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Ricciardello</surname>
          </string-name>
          .
          <article-title>A novel measure of edge centrality in social networks</article-title>
          .
          <source>Knowl-based Syst</source>
          ,
          <volume>30</volume>
          :
          <fpage>136</fpage>
          {
          <fpage>150</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>E.</given-names>
            <surname>Ferrara</surname>
          </string-name>
          , P. De Meo,
          <string-name>
            <given-names>S.</given-names>
            <surname>Catanese</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Fiumara</surname>
          </string-name>
          .
          <article-title>Detecting criminal organizations in mobile phone networks</article-title>
          .
          <source>Expert Systems with Applications</source>
          ,
          <volume>41</volume>
          (
          <issue>13</issue>
          ):
          <volume>5733</volume>
          {
          <fpage>5750</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>L.</given-names>
            <surname>Freeman</surname>
          </string-name>
          .
          <article-title>A set of measures of centrality based on betweenness</article-title>
          .
          <source>Sociometry</source>
          , pages
          <volume>35</volume>
          {
          <fpage>41</fpage>
          ,
          <year>1977</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>L. C.</given-names>
            <surname>Freeman</surname>
          </string-name>
          .
          <article-title>Visualizing social networks</article-title>
          .
          <source>Journal of Social Structure</source>
          ,
          <volume>1</volume>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>T.</given-names>
            <surname>Fruchterman</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.</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>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>G. W.</given-names>
            <surname>Furnas</surname>
          </string-name>
          .
          <article-title>Generalized sheye views</article-title>
          .
          <source>SIGCHI Bull.</source>
          ,
          <volume>17</volume>
          (
          <issue>4</issue>
          ):
          <volume>16</volume>
          {
          <fpage>23</fpage>
          ,
          <string-name>
            <surname>Apr</surname>
          </string-name>
          .
          <year>1986</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>N.</given-names>
            <surname>Henry</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.-D.</given-names>
            <surname>Fekete</surname>
          </string-name>
          .
          <article-title>Matrixexplorer: A dual-representation system to explore social networks</article-title>
          .
          <source>IEEE Transactions on Visualization and Computer Graphics</source>
          ,
          <volume>12</volume>
          (
          <issue>5</issue>
          ):
          <volume>677</volume>
          {
          <fpage>684</fpage>
          ,
          <string-name>
            <surname>Sept</surname>
          </string-name>
          .
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>P.</given-names>
            <surname>Klerks</surname>
          </string-name>
          and
          <string-name>
            <surname>E. Smeets.</surname>
          </string-name>
          <article-title>The network paradigm applied to criminal organizations: Theoretical nitpicking or a relevant doctrine for investigators?</article-title>
          <source>Connections</source>
          ,
          <volume>24</volume>
          :
          <fpage>53</fpage>
          {
          <fpage>65</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>V.</given-names>
            <surname>Krebs</surname>
          </string-name>
          .
          <article-title>Mapping networks of terrorist cells</article-title>
          .
          <source>Connections</source>
          ,
          <volume>24</volume>
          (
          <issue>3</issue>
          ):
          <volume>43</volume>
          {
          <fpage>52</fpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>Y. K.</given-names>
            <surname>Leung and M. D. Apperley</surname>
          </string-name>
          .
          <article-title>A review and taxonomy of distortion-oriented presentation techniques</article-title>
          .
          <source>ACM Trans. Comput</source>
          .-Hum. Interact.,
          <volume>1</volume>
          (
          <issue>2</issue>
          ):
          <volume>126</volume>
          {
          <fpage>160</fpage>
          ,
          <year>June 1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>F.</given-names>
            <surname>Lorrain</surname>
          </string-name>
          and
          <string-name>
            <given-names>H. C.</given-names>
            <surname>White</surname>
          </string-name>
          .
          <article-title>Structural equivalence of individuals in social networks</article-title>
          .
          <source>The Journal of Mathematical Sociology</source>
          ,
          <volume>1</volume>
          (
          <issue>1</issue>
          ):
          <volume>49</volume>
          {
          <fpage>80</fpage>
          ,
          <year>1971</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>J.</given-names>
            <surname>Mena</surname>
          </string-name>
          .
          <article-title>Investigative Data Mining for Security and Criminal Detection</article-title>
          . Butterworth-Heinemann,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>C.</given-names>
            <surname>Morselli</surname>
          </string-name>
          .
          <article-title>Assessing vulnerable and strategic positions in a criminal network</article-title>
          .
          <source>Journal of Contemporary Criminal Justice</source>
          ,
          <volume>26</volume>
          (
          <issue>4</issue>
          ):
          <volume>382</volume>
          {
          <fpage>392</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>A.</given-names>
            <surname>Perer</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Shneiderman</surname>
          </string-name>
          .
          <article-title>Balancing systematic and exible exploration of social networks</article-title>
          .
          <source>IEEE Trans. Visual. and Computer Graphics</source>
          , pages
          <volume>693</volume>
          {
          <fpage>700</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>N. J.</given-names>
            <surname>Pioch</surname>
          </string-name>
          and
          <string-name>
            <given-names>J. O.</given-names>
            <surname>Everett</surname>
          </string-name>
          .
          <article-title>Polestar: collaborative knowledge management and sensemaking tools for intelligence analysts</article-title>
          .
          <source>In Proc. 15th ACM international conference on Information and knowledge management</source>
          , pages
          <volume>513</volume>
          {
          <fpage>521</fpage>
          . ACM,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>M.</given-names>
            <surname>Sarkar</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. H.</given-names>
            <surname>Brown</surname>
          </string-name>
          .
          <article-title>Graphical sheye views</article-title>
          .
          <source>Comm. ACM</source>
          ,
          <volume>37</volume>
          (
          <issue>12</issue>
          ):
          <volume>73</volume>
          {
          <fpage>84</fpage>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>F.</given-names>
            <surname>Schneider</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Feldmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Krishnamurthy</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W.</given-names>
            <surname>Willinger</surname>
          </string-name>
          .
          <article-title>Understanding online social network usage from a network perspective</article-title>
          .
          <source>In Proc. 9th SIGCOMM conference on Internet measurement conference</source>
          , pages
          <volume>35</volume>
          {
          <fpage>48</fpage>
          . ACM,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>B.</given-names>
            <surname>Shneiderman</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Aris</surname>
          </string-name>
          .
          <article-title>Network visualization by semantic substrates</article-title>
          .
          <source>IEEE Trans. Visual. and Computer Graphics</source>
          ,
          <volume>12</volume>
          (
          <issue>5</issue>
          ):
          <volume>733</volume>
          {
          <fpage>740</fpage>
          ,
          <string-name>
            <surname>Sept</surname>
          </string-name>
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>A.</given-names>
            <surname>Slike</surname>
          </string-name>
          .
          <article-title>The devil you know: Continuing problems with research on terrorism</article-title>
          .
          <source>Terrorism and Political Violence</source>
          ,
          <volume>13</volume>
          :1{
          <fpage>14</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>M. K.</given-names>
            <surname>Sparrow</surname>
          </string-name>
          .
          <article-title>The application of network analysis to criminal intelligence: An assessment of the prospects</article-title>
          .
          <source>Social Networks</source>
          ,
          <volume>13</volume>
          (
          <issue>3</issue>
          ):
          <volume>251</volume>
          {
          <fpage>274</fpage>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>V. A.</given-names>
            <surname>Traag</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Browet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Calabrese</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Morlot</surname>
          </string-name>
          .
          <article-title>Social event detection in massive mobile phone data using probabilistic location inference</article-title>
          .
          <source>In 2011 IEEE 3rd international conference on social computing (socialcom)</source>
          , pages
          <fpage>625</fpage>
          {
          <fpage>628</fpage>
          . IEEE,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>S.</given-names>
            <surname>Wasserman</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>Faust</surname>
          </string-name>
          .
          <article-title>Social network analysis: methods and applications</article-title>
          . Cambridge Univ. Pr.,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>W.</given-names>
            <surname>Wright</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Schroh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Proulx</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Skaburskis</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Cort</surname>
          </string-name>
          .
          <article-title>The sandbox for analysis: concepts and methods</article-title>
          .
          <source>In Proc. SIGCHI Conference on Human Factors in Computing Systems</source>
          , pages
          <fpage>801</fpage>
          {
          <fpage>810</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>Crimenet explorer: a framework for criminal network knowledge discovery</article-title>
          .
          <source>ACM Trans. on Information Systems</source>
          ,
          <volume>23</volume>
          (
          <issue>2</issue>
          ):
          <volume>201</volume>
          {
          <fpage>226</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>Criminal network analysis and visualization</article-title>
          .
          <source>Comm. ACM</source>
          ,
          <volume>48</volume>
          (
          <issue>6</issue>
          ):
          <volume>100</volume>
          {
          <fpage>107</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>C.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Chen</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Hong</surname>
          </string-name>
          .
          <article-title>Visualization of large category map for internet browsing</article-title>
          .
          <source>Decis. Support Syst</source>
          .,
          <volume>35</volume>
          (
          <issue>1</issue>
          ):
          <volume>89</volume>
          {
          <fpage>102</fpage>
          ,
          <string-name>
            <surname>Apr</surname>
          </string-name>
          .
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <given-names>C.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Liu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Sageman</surname>
          </string-name>
          .
          <article-title>Analyzing the terrorist social networks with visualization tools</article-title>
          .
          <source>In Intelligence &amp; security informatics</source>
          .
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>H.</given-names>
            <surname>Zang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Baccelli</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Bolot</surname>
          </string-name>
          .
          <article-title>Bayesian inference for localization in cellular networks</article-title>
          .
          <source>In 2010 Proceedings IEEE INFOCOM</source>
          , pages
          <article-title>1{9</article-title>
          . IEEE,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>