<!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>Interactive Analysis and Exploration of Experimental Evaluation Results</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Emanuele Di Buccio</string-name>
          <email>dibuccio@dei.unipd.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ivano Masiero</string-name>
          <email>masieroi@dei.unipd.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco Dussin</string-name>
          <email>dussinma@dei.unipd.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giuseppe Santucci</string-name>
          <email>santucci@dis.uniroma1.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nicola Ferro</string-name>
          <email>ferro@dei.unipd.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giuseppe Tino</string-name>
          <email>tino@dis.uniroma1.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ranking, Visual Analytics, Interaction, Discounted Cumu-</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Sapienza University of Rome</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Padua</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>lated Gain</institution>
          ,
          <addr-line>Experimental Evaluation, DIRECT</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper proposes a methodology based on discounted cumulated gain measures and visual analytics techniques in order to improve the analysis and understanding of IR experimental evaluation results. The proposed methodology is geared to favour a natural and e ective interaction of the researchers and developers with the experimental data and it is demonstrated by developing an innovative application based on Apple iPad.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>H.3.3 [Information Search and Retrieval]: [Search
process]; H.3.4 [Systems and Software]: [Performance
evaluation (e ciency and e ectiveness)]</p>
    </sec>
    <sec id="sec-2">
      <title>General Terms Keywords</title>
    </sec>
    <sec id="sec-3">
      <title>1. INTRODUCTION</title>
      <p>The Information Retrieval (IR) eld has a strong and
longlived tradition, that dates back to late 50s/early 60s of the
last century, as far as the assessment of the performances of
an IR system is concerned. In particular, in the last 20 years,
large-scale evaluation campaigns, such as the Text REtrieval
Conference (TREC)1 in the United States and the
CrossLanguage Evaluation Forum (CLEF)2 in Europe, have
conducted cooperative evaluation e orts involving hundreds of</p>
      <sec id="sec-3-1">
        <title>1http://trec.nist.gov/</title>
      </sec>
      <sec id="sec-3-2">
        <title>2http://www.clef-campaign.org/</title>
        <p>Copyright c 2011 for the individual papers by the papers’ authors.
Copying permitted only for private and academic purposes. This volume is
published and copyrighted by the editors of euroHCIR2011.
research groups and industries, producing a huge amount of
valuable data to be analysed, mined, and understood.</p>
        <p>The aim of this work is to explore how we can improve
the comprehension of and the interaction with the
experimental results by IR researchers and IR system developers.
We imagine the following scenarios: (i) a researcher or a
developer is attending the workshop of one of the large-scale
evaluation campaigns and s/he wants to explore and
understand the experimental results as s/he is listening at the
presentation discussing them; (ii) a team of researchers or
developers is working on tuning and improving an IR
system and they need tools and applications that allow them
to investigate and discuss the performances of the system
under examination in a handy and e ective way.</p>
        <p>These scenarios call for: (a) proper metrics that allow
us to understand the behaviour of a system; (b) e ective
analysis and visualization techniques that allow us to get an
overall idea of the main factors and critical areas which have
in uenced performances in order to be able to dig into
details; (c) for tools and applications that allow us to interact
with the experimental result in a both e ective and natural
way.</p>
        <p>
          To this end, we propose a methodology which allows us to
quickly get an idea of the distance of an IR system with
respect to both its own optimal performances and the best
performances possible. We rely on the (normalized) discounted
cumulated gain (n)DCG family of measures [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] because they
have shown to be especially well-suited not only to quantify
system performances but also to give an idea of the
overall user satisfaction with a given ranked list considering the
persistence of the user in scanning the list.
        </p>
        <p>
          The contribution of this paper is to improve on the
previous work [
          <xref ref-type="bibr" rid="ref11 ref7">7,11</xref>
          ] by trying to better understand what happens
when you ip documents with di erent relevance grades in
a ranked list. This is achieved by providing a formal model
that allows us to properly frame the problem and quantify
the gain/loss with respect to an optimal ranking, rank by
rank, according to the actual result list produced by an IR
system.
        </p>
        <p>
          The proposed model provides the basis for the
development of Visual Analytics (VA) techniques that give us the
possibility to get a quick and intuitive idea of what
happened in a result list and what determined its perceived
performances. Visual Analytics [
          <xref ref-type="bibr" rid="ref10 ref14 ref8">8, 10, 14</xref>
          ] is an emerging
multi-disciplinary area that takes into account both ad-hoc
and classical Data Mining (DM) algorithms and
Information Visualization (IV) techniques, combining the strengths
of human and electronic data processing. Visualisation
becomes the medium of a semi-automated analytical process,
where human beings and machines cooperate using their
respective distinct capabilities for the most e ective results.
Decisions on which direction analysis should take in order
to accomplish a certain task are left to nal user. While IV
techniques have been extensively explored [
          <xref ref-type="bibr" rid="ref13 ref4">4,13</xref>
          ], combining
them with automated data analysis for speci c application
domains is still a challenging activity [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. Moreover, the
Visual Analytics community acknowledges the relevance of
interaction for visual data analysis, and that the current
research activities very often focus only on visual
representation, neglecting the interaction design, as clearly stated
in [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. This refers to two di erent typologies of interaction:
1) interaction within a visualization and, 2), closer to the
paper contribution, interaction between the visual and the
analytical components.
        </p>
        <p>
          The idea of exploring and applying VA techniques to the
experimental evaluation in the IR eld is quite innovative
since it has never been attempted before and, due to the
complexity of the evaluation measures and the amount of
data produced by large-scale evaluation campaigns, there is
a strong need for better and more e ective representation
techniques. Moreover, visualizing and assessing ranked list
of items, to the best of the authors' knowledge, has not been
addressed by the VA community. The few related
proposals, see, e.g., [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], use rankings for presenting the user with
the most relevant visualizations, or for browsing the ranked
result, see, e.g., [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], but do not deal with the problem of
observing the ranked item position, comparing it with an
ideal solution, to assess and improve the ranking quality. A
rst attempt in such a direction is in [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], where the authors
explored the basic issues associated with the problem,
providing basic metrics and introducing a VA web based system
that allows for exploring the quality of a ranking with
respect to an optimal solution.
        </p>
        <p>On top of the proposed model, we have built a running
prototype where the experimental results and data are stored
in a dedicated system accessible via standard Web services.
This allows for the design and development of various client
applications and tools for exploiting the managed data. In
particular, in this paper, we have started to explore the
possibility of adopting the Apple iPad3 as an appropriate device
to allow users to easily and naturally interact with the
experimental data and we have developed an initial prototype
that allows us for interactively inspecting the actual
experimental data in order to get insights about the behaviour of
a IR system.</p>
        <p>Overall, the proposed model, the proposed visualization
techniques, and the implemented prototype meet all the
(ac) requirements for the two scenarios introduced above.</p>
        <p>The paper is organized as follows. Section 2 introduces the
model underlying the system together with its visualization
techniques; Section 3 describes the interaction strategies of
the system, Section 4 describes the overall architecture of
the system, and Section 5 concludes the paper, pointing out
ongoing research activities.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>THE PROTOTYPE</title>
      <p>
        According to [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] we model the retrieval results as a ranked
      </p>
      <sec id="sec-4-1">
        <title>3http://www.apple.com/ipad/</title>
        <p>
          vector of n documents V , i.e., V [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] contains the identi er of
the document predicted by the system to be most relevant,
V [n] the least relevant one. The ground truth GT function
assigns to each document V [i] a value in the relevance
interval f0::kg, where k represents the highest relevance score,
e.g. k = 3 in [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. The basic assumption is that the greater
the position of a document the less likely it is that the user
will examine it, because of the required time and e ort and
the information coming from the documents already
examined. As a consequence, the greater the rank of a relevant
document the less useful it is for the user. This is
modeled through a discounting function DF that progressively
reduces the relevance of a document, GT (V [i]) as i increases:
DF (V [i]) =
        </p>
        <p>GT (V [i]); if i x
GT (V [i])= logx(i); if i &gt; x
(1)
The quality of a result can be assessed using the discounted
cumulative gain function DCG(V; i) = Pij=1 DF (V [j]) that
estimates the information gained by a user that examines
the rst i documents of V .</p>
        <p>The DCG function allows for comparing the performances
of di erent search engines, e.g., plotting the DCG(i) values
of each engine and comparing the curve behavior.</p>
        <p>However, if the user's task is to improve the ranking
performance of a single search engine, looking at the misplaced
documents (i.e., ranked too high or too low with respect to
the other documents) the DCG function does not help: the
same value DCG(i) could be generated by di erent
permutations of V and it does not point out the loss in cumulative
gain caused by misplaced elements. To this aim, we
introduce the following de nitions and novel metrics.</p>
        <p>We denote with OptP erm(V ) the set of optimal
permutations of V such as that 8OV 2 OptP erm(V ) it holds
that GT (OV [i]) GT (OV [j])8i; j &lt;= n V i &lt; j, that
is, OV maximizes the values of DCG(OV; i)8i. In other
words, OptP erm(V ) represents the set of the optimal
rankings for a given search result. It is worth noting that each
vector in OptP erm(V ) is composed by k + 1 intervals of
documents sharing the same GT values. As an example,
assuming a result vector composed by 12 elements and k = 3,
a possible sequence of GT values of an optimal vector OV
is &lt;3,3,3,3,2,2,2,2,1,1,0,0&gt;; according to this we de ne the
max index(V; r) and min index(V; r) functions, with 0
r k, that return the greatest and the lowest indexes of
elements in a vector belonging to OptP erm(V ) that share the
same GT value r. As an example, considering the above 12
GT values, min index(V; 2) = 5 and max index(V; 2) = 8.</p>
        <p>Using the above de nitions we can de ne the relative
position R P os(V [i]) function for each document in V as follows:
( 0; if min index(V; GT (V [i]) i max index(V; GT (V [i])
min index(V; GT (V [i]) i; if i &lt; min index(V; GT (V [i])
max index(V; GT (V [i]) i; if i &gt; max index(V; GT (V [i])
R P os(V [i]) allows for pointing out misplaced elements
and understanding how much they are misplaced: 0 values
denote documents that are within the optimal interval,
negative and positive values denote elements that are respectively
below and above the optimal interval. The absolute value
of R P os(V [i]) gives the minimum distance of a misplaced
element from its optimal interval.</p>
        <p>According to the actual relevance and rank position, the
same value of R P os(V [i]) can produce di erent variations
of the DCG function. We measure the contributions of
misplaced elements with the function Gain(V; i) that
compares 8i the actual values of DF (V [i]) with the
corresponding values in OV , DF (OV [i]): Gain(V; i) = DF (V [i])
DF (OV [i]).</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>3. INTERACTION</title>
      <p>A multi-touch prototype interface based on the model
presented in section 2 has been designed for the iPad device. It
has been developed and tested on the iOS 4.24 with the
integration of the Core Plot5 plotting framework for the
graphical visualization of data. The interface allows the end user
for comparing the curve of the ranked results, for a given
experiment/topic, with the optimal one and with the ideal
one. This facilitates the activities of failure analysis,
easily locating misplaced elements, blue or red items, that pop
up from the visualization together with the extent of their
displacement and the impact they have on DCG.</p>
      <p>Figure 1 shows a screenshot of the current interface: the
main list on the left represents the top n = 200 ranked result
for a given experiment/topic and it can be easily scrolled by
the user. Each row corresponds to a document ID, a short
snippet of the content is included in the subtitle of each
cell and more information on a speci c result (i.e. relevance
score, DCG, R P os, Gain) can be viewed by touching the
row. On the right side there are two coloured vectors which
show the R P os and Gain functions. The R P os
vector presents the results using di erent color shadings: light
green, light red and light blue respectively for documents
that are within, below and above the optimal interval. It
allows for locating misplaced documents and, thanks to the
shading, understanding how they are far from the optimal
4http://developer.apple.com/
5http://code.google.com/p/core-plot/
position. Similarly, the Gain vector codes the function
using colors: light blue refers to positive values, light red
codes negative values, and green 0 values. Moreover, if the
user touches a speci c area of the R P os vector (that is
simulated by the gray round in Figure 1), the main results list
automatically scrolls back, providing the end user with a
detailed view on the corresponding documents. The rightmost
part of the screen shows the DCG graphs of the ideal, the
optimal and the experiment vector, i.e. the ranking curves.
The navigation bar displays a back button on the right which
let the user visualize the results for a di erent topic.
4.</p>
    </sec>
    <sec id="sec-6">
      <title>ARCHITECTURE</title>
      <p>
        The design of the architecture of the system bene ts from
what has been learned in ten years of work for the CLEF and
in the design and implementation of Distributed Information
Retrieval Evaluation Campaign Tool (DIRECT), the system
developed in CLEF since 2005 to manage all the aspects of
an evaluation campaign [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ].
      </p>
      <p>The approach to the architecture is the implementation
of a modular design, as sketched in Figure 2, with the aim
to clearly separate the logic entailed by the application into
three levels of abstraction { data, application, and interface
logic { able to reciprocally communicate, easily extensible
and implementable using modular and reusable components.
The Data Logic layer, depicted at the bottom of Figure 2,
deals with the persistence of the information coming from
the other layers. From the implementation point of view,
data stored into databases and indexes are mapped to
resources and communicate with the upper levels through the
mechanism granted by the Data Access Object (DAO)
pattern6 | see point (1) in Figure 2. The Application Logic</p>
      <sec id="sec-6-1">
        <title>6http://java.sun.com/blueprints/corej2eepatterns/</title>
        <p>
          layer is in charge of the high-level tasks made by the
system, such as the enrichment of raw data, the calculation
of metrics and the carrying out of statistical analyses on
experiments. These resources (2) are therefore accessible
via HTTP through a RESTful Web service [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], sketched at
point (3). After the validation of credentials and permissions
made by the access control mechanism (4), it is possible for
remote devices such as web browsers or custom clients (5)
to create, modify, or delete resources attaching their
representation in XML7 or JSON8 format to the body of an
HTTP request, and to read them as response of speci c
queries. A logging infrastructure (6) grants the tracking of
all the activities made at each layer and can be used to
obtain information about the provenance of all the managed
resources.
        </p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>CONCLUSIONS</title>
      <p>We have presented a model and a prototype which allow
users to easily interact with the experimental results and to
work together in a cooperative way while actually accessing
the data. This rst step uncovers new and interesting
possibilities for the experimental evaluation and for the way in
which researchers and developers usually carry out such
activities. For example, the proposed techniques may alleviate
the burden of certain tasks, such as failure analysis, which
are often overlooked due to their demanding nature, thus
making easier and more common to perform them and, as a
consequence, improving the overall comprehension of system
behaviour. This will be explored in the future work.
Patterns/DataAccessObject.html</p>
      <sec id="sec-7-1">
        <title>7http://www.w3.org/XML/</title>
      </sec>
      <sec id="sec-7-2">
        <title>8http://www.ietf.org/rfc/rfc4627.txt</title>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgements</title>
      <p>The work reported in this paper has been partially
supported by the PROMISE network of excellence (contract
n. 258191), as a part of the 7th Framework Program of the
European commission (FP7/2007-2013).
6.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sabetta</surname>
          </string-name>
          , G. Santucci, G. Tino, and
          <string-name>
            <given-names>F.</given-names>
            <surname>Veltri</surname>
          </string-name>
          .
          <article-title>Visual comparison of ranked result cumulated gains</article-title>
          .
          <source>In Proc. of EuroVA 2011. Eurographics</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Agosti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. Di</given-names>
            <surname>Nunzio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dussin</surname>
          </string-name>
          , and
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          .
          <article-title>10 Years of CLEF Data in DIRECT: Where We Are and Where We Can Go</article-title>
          .
          <source>In Proc. of EVIA</source>
          <year>2010</year>
          , pages
          <fpage>16</fpage>
          {
          <fpage>24</fpage>
          . Tokyo, Japan,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Agosti</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          .
          <article-title>Towards an Evaluation Infrastructure for DL Performance Evaluation. In Evaluation of Digital Libraries: An Insight to Useful Applications and Methods</article-title>
          .
          <source>Chandos Publishing</source>
          , Oxford, UK,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Card</surname>
          </string-name>
          and
          <string-name>
            <surname>J. Mackinlay.</surname>
          </string-name>
          <article-title>The structure of the information visualization design space</article-title>
          .
          <source>In Proc. of InfoVis '97</source>
          , pages
          <fpage>92</fpage>
          {
          <fpage>99</fpage>
          , Washington, DC, USA,
          <year>1997</year>
          . IEEE Computer Society.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Derthick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. G.</given-names>
            <surname>Christel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. G.</given-names>
            <surname>Hauptmann</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H. D.</given-names>
            <surname>Wactlar</surname>
          </string-name>
          .
          <article-title>Constant density displays using diversity sampling</article-title>
          .
          <source>In Proc. of the IEEE Information Visualization</source>
          , pages
          <volume>137</volume>
          {
          <fpage>144</fpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R. T.</given-names>
            <surname>Fielding</surname>
          </string-name>
          and
          <string-name>
            <given-names>R. N.</given-names>
            <surname>Taylor</surname>
          </string-name>
          .
          <article-title>Principled design of the modern web architecture</article-title>
          .
          <source>ACM TOIT</source>
          ,
          <volume>2</volume>
          :
          <fpage>115</fpage>
          {
          <fpage>150</fpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>K.</given-names>
            <surname>Ja</surname>
          </string-name>
          <article-title>rvelin and</article-title>
          J. Kekalainen.
          <source>Cumulated Gain-Based Evaluation of IR Techniques. ACM TOIS</source>
          ,
          <volume>20</volume>
          (
          <issue>4</issue>
          ):
          <volume>422</volume>
          {
          <fpage>446</fpage>
          ,
          <year>October 2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D.</given-names>
            <surname>Keim</surname>
          </string-name>
          , G. Andrienko,
          <string-name>
            <surname>J.-D. Fekete</surname>
            , C. Gorg, J. Kohlhammer, and
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Melancon</surname>
          </string-name>
          . Information visualization. chapter Visual Analytics: De nition, Process, and Challenges, pages
          <volume>154</volume>
          {
          <fpage>175</fpage>
          . Springer-Verlag, Berlin, Heidelberg,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Keim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kohlhammer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Santucci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Mansmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wanner</surname>
          </string-name>
          , and
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Schafer. Visual Analytics Challenges</article-title>
          .
          <source>In Proc. of eChallenges</source>
          <year>2009</year>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Keim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Mansmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schneidewind</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Ziegler</surname>
          </string-name>
          .
          <article-title>Challenges in visual data analysis</article-title>
          .
          <source>In Proc. of IV'06</source>
          , pages
          <fpage>9</fpage>
          {
          <fpage>16</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>H.</given-names>
            <surname>Keskustalo</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          <article-title>Jarvelin, A. Pirkola, and</article-title>
          <string-name>
            <surname>J. Keka</surname>
          </string-name>
          <article-title>lainen. Intuition-Supporting Visualization of User's Performance Based on Explicit Negative Higher-Order Relevance</article-title>
          .
          <source>In Proc. of SIGIR '08</source>
          , pages
          <fpage>675</fpage>
          {
          <fpage>681</fpage>
          . ACM Press, NY, USA,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Seo</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Shneiderman</surname>
          </string-name>
          .
          <article-title>A rank-by-feature framework for interactive exploration of multidimensional data</article-title>
          .
          <source>In Proc. of the IEEE Information Visualization</source>
          , pages
          <volume>65</volume>
          {
          <fpage>72</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>B.</given-names>
            <surname>Shneiderman</surname>
          </string-name>
          .
          <article-title>The eyes have it: a task by data type taxonomy for information visualizations</article-title>
          .
          <source>In Proc. of the 1996 IEEE Symposium on Visual Languages</source>
          , pages
          <volume>336</volume>
          {
          <fpage>343</fpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Thomas</surname>
          </string-name>
          and
          <string-name>
            <given-names>K. A.</given-names>
            <surname>Cook</surname>
          </string-name>
          .
          <article-title>A visual analytics agenda</article-title>
          .
          <source>IEEE Computer Graphics and Applications</source>
          ,
          <volume>26</volume>
          :
          <fpage>10</fpage>
          {
          <fpage>13</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>