<!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>An Exploratory Search User Interface Concept Supporting Vague Querying and a Novel Result Representation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Timo Luddecke</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Markus Juttner</string-name>
          <email>markus.juettnerg@st.ovgu.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marcus Nitsche</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andreas Nurnberger</string-name>
          <email>andreas.nuernbergerg@ovgu.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Data and Knowledge Engineering Group, Faculty of Computer Science, Otto von Guericke University Magdeburg</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Common search engines deliver quite good results when the user has a precise notion of what he is looking for. However, the user might have in mind additional prior information regarding the importance of speci c terms. Consequently, it seems desirable to avoid the latter and incorporate the knowledge into the query instead. Therefore, we propose a search user interface concept that supports users in modelling their uncertainty in a comfortable way, foster exploratory search and provide a compact yet informative representation of results. An implemented prototype demonstrates the feasibility of the concept. We also present results of a rst twostep usability study. The results indicate a good usability of the concept and show that even this novel concept meets user's expectations.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Modern search engines have become very powerful
tools, providing excellent results - even in areas beyond
basic document queries like nding a nearby dentist or
checking for the weather of next weekend. However,
they require textual input of keywords by the user,
who is not necessarily capable of formulating suitable
terms at the begin of the search, for instance because
he is new to the domain. Search engines also lack in
the ability to support the formulation of importance
of selected search terms as every term has potentially
the same impact on the result (apart from
contextsensitivity). Also functions for explicitly excluding
terms are either hidden - in most cases unknown to
users - or do not exist at all. A study on search query
logs conducted by Jansen et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] found that the
boolean operators "NOT" or "-" were only used in
3.34% of all queries. However, we believe that term
exclusion could turn out to be useful in a much higher
number of cases. It appears that non-uniform term
importance, especially exclusion are desirable in
numerous scenarios, e.g. when searching for recipes with
a favourite and another nice-to-have ingredient while
being allergic to a third component. The weighting of
a term does not necessarily encode it's (known)
relevance by the user. It might also specify the user's
(un)certainty about the suitability of single terms.
      </p>
      <p>Another aspect of search engines is the presentation
of results. It comprises in most cases just text
containing the title, a text snippet and the URL. This gives
no clue about the visual appearance of the actual
document, which nevertheless could be helpful for a user's
relevance estimation and recognition of previously
visited websites.</p>
      <p>
        In this paper, we present a concept designed to
overcome these disadvantages of current web search
user interfaces by introducing a novel query
formulation mechanism and a compact representation of a web
page's content as well as visual appearance. Both
being integrated into a search user interface prototype
that addresses some aspects of exploratory search [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]
by providing support in expressing uncertainty. In [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]
a brief overview of exploratory search tools and
evaluation techniques are provided.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        The VIBE-system by [
        <xref ref-type="bibr" rid="ref12 ref17">12, 17</xref>
        ] also supports users in
interactive nding and ltering relevant information.
Here, magnets are used to attract relevant documents
to speci c screen points.
      </p>
      <p>
        Nitsche &amp; Nurnberger [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] introduced QUEST - a
user interface concept where terms are placed radially
around a center with the distance to it encoding the
uncertainty: The closer a term is, the higher it's
speci c weight in the whole search query. Also results
are represented by small dots or favicons in the radial
layout, whereby the distance to the center maps the
relevance of the current query constellation. As only
the distance is taken into account, an arbitrary
angle can be chosen without changing the semantics of a
query formulation. Therefore, multiple arrangements
of terms can encode the very same query, which might
be a shortcoming of this approach. It generates also
just a weak structure for user's decision which search
result to survey rst.
      </p>
      <p>
        The problem of reducing a web page's content to
a compact representation has been addressed in
various publications [
        <xref ref-type="bibr" rid="ref10 ref19 ref2">10, 19, 2</xref>
        ]. These representations are
- in most cases - based on a screenshot of the entire
web page or an extraction of a salient region combined
with the title, while being only remotely related to
the textual content. Both, evaluations conducted by
Dziadosz &amp; Chandrasekar [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and Aula et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]
suggest though that combining text and image enables the
user to judge relevance best. Dork et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] presented
an exploratory search environment with a result
representation heavily relying on zooming in various maps:
in temporal, spatial and semantic domain. However,
with books, blogs and photos, only fairly structured
types of content are considered { at least compared to
arbitrary web pages.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>System</title>
      <p>Our system consists of three major components (Fig.
1): A crawler, a backend and a frontend. This section
deals with the rst ones, while the frontend will be
described separately in section 4.</p>
      <p>
        Crawler. The rich result representation prohibits
the utilization of APIs of common search engines as
they deliver too little information about the web page
and crawling these in real time is infeasible given a
reasonable number of results. Therefore, we
developed our own crawler computing a colour histogram, a
salient extract of the web page and a wordcloud as well
as the text document for indexing. First, a screenshot
of the web page is taken. For the colour histogram only
the top 600 pixels of the web page are considered as
most websites have a characteristic header. The pixel
values are clustered by KMeans [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] into ten groups
and stored in a database. The computation of a salient
region is carried out by the algorithm of Achanta et
al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], where saliency is de ned as a pixel's distance
to the image's mean colour in lab space. The saliency
map is searched for areas of high saliency on multiple
scales. The best candidate is selected and extracted
from the screenshot. For text extraction the html
content is rst converted to plain text by nltk [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and fed
into the database. The text is further processed by
removing stop-words and each remaining word is scored
by it's frequency in the Brown corpus [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], which
contains roughly one million words. The score is
computed similar to tf-idf calculation [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] by the following
formula:
score(w) =
      </p>
      <p>tf (w)(logjBj + 1);
(tf (w)log(jBj=tfB(w)); if w 2 B
else
(1)
With B being the set of words in the corpus and tf
respectively tfB the term-frequencies in the web page
and in the Brown corpus.</p>
      <p>Backend. Our database relies on Apache Solr
without any profound modi cations. Besides a typical
text eld, we added elds for additional features the
crawler captures. Term weighting is implemented by
the boosting mechanism of Solr. Communication with
the javascript-based frontend is realized via HTTP and
JSON encoding, which is natively supported by Solr.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Search User Interface</title>
      <p>
        The user interface consists of ve main elements, with
query formulation and result representation as the
most innovative ones. Query formulation is placed
at the top of the screen and the result representation
below. Both cover the entire width. Below them a
navigable web page preview is set, surrounded by
navigation buttons to the left and right. The small result
representation and the big preview follow the design
pattern of \overview and detail" [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], while the
navigable web page previews can be seen as contextual
cues in the result space. To facilitate getting started
and to ensure conformity with the user's expectation,
just a simple common-known text-box is presented at
start. After submitting an initial query, the layout
transforms smoothly into the one shown in Fig. 2.
      </p>
      <p>Query Formulation. In order to constitute a query,
terms are rst typed in the simple text-box as usual.
After submitting the rst query, all terms move to the
left side without overlapping each other. Note that this
implies a positive initial weighting. For a re nement
and the expression of uncertainty, terms can be moved
horizontally. Fig. 3 depicts how the arrangement of
terms a ects the query semantics. With x being the
position of a term in the interval [ 1:0; 1:0], sgn(x)
indicates whether the term is explicitly wanted or
unwanted in the result documents. jxj denotes the
condence of the former statement. Single terms can be
removed by triggering a small remove button that pops
up on mouse over. New terms can be added by
clicking the query bar at the position associated with the
wanted weighting of the new term and simply starting
confidence</p>
      <p>0
positve terms
negative terms
-1.0
1.0
to type. It is also possible to restart the entire search,
i.e. to remove all terms, by clicking a single button.</p>
      <p>Result Representation. Due to the elongated and
{ compared to common search user interfaces without
preview { small result bar, the crucial goal in designing
the result representation was to keep it as compact as
possible and to allow a horizontal arrangement.
Previously seen web pages should be recognizable and the
content of unknown web pages should be as obvious
as possible when looking at the result representation.
Our approach consists of three di erent constituents
(Fig. 4):</p>
      <p>A colour bar (1) on the left as well as the
background of the whole element indicate frequent
colours of the respective web page. When colours
are known in advance, it allows to quickly
redis1
2
parts containing
Word3Cloud
important most
text</p>
      <p>
        cover a previously visited web page because colour
is a pre-attentive attribute [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Otherwise, the
bar at least provides useful cues on what to
expect, e.g. websites for children are often very
colourful while a business website is likely to have
black text on a white background.
      </p>
      <p>An extract of the rendered web page's screenshot
(2) provides a small preview of the most salient
region of the web page. This might also support
recognition and could additionally serve as a hint
for the web page's topic.</p>
      <p>The wordcloud (3) - it's computation is described
above - gives a general overview of the website's
content by putting an emphasis on words that
occur rarely in general but frequently in this
document and are hence more likely relevant for the
current topic.</p>
      <p>By dragging a result representation into the query
bar (Fig. 5), the query can be manipulated depending
on the results content. When there is an intersection
between wordcloud of the element and query terms,
they are shifted to the left giving them a more positive
e ect. If there is no intersection, the most popular
word in the wordcloud is added to the query. This way
exploratory search is further supported in the proposed
search user interface concept.</p>
      <p>
        Implementation. The implementation of the
described concept is based on current web standards:
Javascript for the logic and SVG using raphael.js1 for
rendering graphics. Since the elements of the result
representation are not retrievable from common APIs,
we had to make a decision between re-crawling the
elements in real-time as soon as results from an API
are delivered or to build our own index with colours,
salient region and wordcloud directly stored. We
decided in favour of the latter as the re-crawling takes
too much time and results could not be presented
instantaneously. The index is based on an unchanged
(except for con guration) Apache Solr2 server. It is
lled with content by our own crawler that captures a
screenshot for colour and a salient region extraction as
well as it processes the html content, ending up with
term scores (see Formula 1) of the wordcloud. The
crawler is implemented in python using nltk [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ],
scikitlearn [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] and various scripts, e.g. A. Muller's3 for
1http://raphaeljs.com (28.10.2013)
2http://lucene.apache.org/Solr (28.10.2013)
3https://github.com/amueller/word cloud (28.10.2013)
wordcloud rendering. We crawled two indices, a
general one without restrictions (85 entries) and a special
one with travelling and recipe sites only (455 entries),
where the feature of vague query formulation is a big
bene t.
      </p>
      <p>
        An open question is how the system reacts in a
larger scale, but as we use Solr for storage and query
handling, we are con dent that the system scales well,
possibly by utilizing Apache Hadoop [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. The user
interface was not optimized to work in a mobile context
like on a tablet. But due to the use of standard
techniques it also runs on a Google Nexus 7 (2013) with
only minor drawbacks.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Study Design</title>
      <p>We conducted two evaluations with 17 participants in
total, i.e. nine respectively eight participants each:
A formative evaluation guided us for some design
decisions. A summative one tested the nal prototype
implementation. Note that the evaluation was
originally carried out in German and translated to English
for this paper.
5.1</p>
      <sec id="sec-5-1">
        <title>Formative Evaluation</title>
        <p>The entire formative evaluation was implemented as
an interactive form, where the study participants has
been asked to interact with mock-ups of parts of the
later implemented user interface. We o ered a
discrete and a continuous version of the query formulation
mechanism (Fig. 5) and tried to assess which one is
easier to handle. Therefore, we created two challenges:</p>
        <p>Query formulation. The rst task involved creating
a query given the following brief note about the goals
as well as the terms we wanted to be used: You are
looking for a destination for your hiking vacations in
the mountains, not necessarily in the alps as you have
been there before. As you su er from vertigo you want
to avoid climbing. The results in Fig. 6 show that the
test users were able to formulate a proper query, i.e.
putting the relevant terms to the left side of the query
and the negative ones to the right side.</p>
        <p>Query understanding. To solve the second task,
users were asked to do the inverse. Given a nal query
formulation, six di erent images needed to be ordered
or removed. Five of them were images of cakes, the
sixth one was an image of a dog. This way, we wanted
to see if the representation of a query in the query
bar (Fig. 5) is understandable. Furthermore, it gives
insight to a deeper interpretation of the participants:
Should the dog be in the result list though it has no
relation to the query terms? If yes, should it be placed
in front of the un tting results? The results reported
in Fig. 7 suggest that the basic principle has been
understood as the rightmost images were correctly put
top of the results in most cases.</p>
        <p>Regarding the dog, the participants agreed on
scoring it lower than all cakes. But there is a dissent on
whether to include the result or to remove it.</p>
        <p>Result representation. In addition to the query
formulation, we also evaluated prototypes of the result
representation (Fig. 4). Four manually assembled
representations of web pages were provided and we
asked the study participants for possible search terms,
a category of the web page and which traits of the
representation were pivotal for that decision. Not all
participants lled out all elds. But when they did,
they correctly predicted the web page's content, with
only one exception. Often, the participants were able
to specify even the subtopic.
5.2</p>
      </sec>
      <sec id="sec-5-2">
        <title>Summative Evaluation</title>
        <p>The summative evaluation was carried out by giving
the participants some task, while observing them and
making notices. Afterwards, they were given the
opportunity to express feedback.</p>
        <p>In general, most users succeeded in working with
the search user interface. Minor problems involved
confusion between user interface and result
representation, colours and interpreting the plus/minus button
at the end of the scale as being actually a button. We
attribute this to the short time frame the participants
had to get used to the prototype and its underlying
novel concept. Colours in the result representation
indicating page colours are confused with the colour
scale for weighting a term. The plus respectively minus
icon at the ends of the scale is sometimes mistakenly
interpreted as a button.
4Study participants saw copyright protected image.
a)
b)
c)
1
2
3
4
5</p>
        <p>Furthermore, we found that the search bar can
be seen as a text eld in the user's mental model
and could therefore support corresponding interactions
(i.e. placing a cursor and editing text). However, all
participants considered the term weighting as a useful
tool and the majority liked the result representation
as well. The ratings shown in Fig. 8 indicate
minor problems regarding the transition from common
user interfaces while both, result representation and
the weighting ability, are for most parts considered as
good.
6</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>We presented a novel search user interface concept for
exploratory web search addressing the problem of
incorporating uncertainty with respect to user's con
dence while searching. The main contributions are a
novel query formulation mechanism and a compact
visualization. This supports an e cient recognition. It
also helps users to concern a web page's topic by
linking visual and textual information. The
implementation demonstrates the feasibility of the concept and
the small evaluation suggests that users are able to
properly interact with the interface.</p>
      <p>Future work will cover the improvement of the
system's usability in practice. For instance, by o ering a
function to save interesting web pages and using more
elaborative methods for visual and textual
information extraction in the crawler. The compact
representation of results might also be interesting for mobile
use, where screen space is limited.</p>
      <sec id="sec-6-1">
        <title>Acknowledgement</title>
        <p>We thank the ickr users tjstaab, freakgirl, lovebuzz,
Kirti Poddar and je ro for releasing their images
under a creative commons licence.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Achanta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hemami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Estrada</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Susstrunk</surname>
          </string-name>
          .
          <article-title>Frequency-tuned salient region detection</article-title>
          .
          <source>In Computer Vision and Pattern Recognition</source>
          ,
          <year>2009</year>
          .
          <article-title>CVPR 2009</article-title>
          . IEEE Conference on, pages
          <volume>1597</volume>
          {
          <fpage>1604</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Aula</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. M.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Guan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Fontes</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Hong</surname>
          </string-name>
          .
          <article-title>A comparison of visual and textual page previews in judging the helpfulness of web pages</article-title>
          .
          <source>In Proceedings of the 19th International Conference on World Wide Web, WWW '10</source>
          , pages
          <fpage>51</fpage>
          {
          <fpage>60</fpage>
          , New York, NY, USA,
          <year>2010</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bird</surname>
          </string-name>
          , E. Klein, and
          <string-name>
            <given-names>E.</given-names>
            <surname>Loper. Natural Language Processing with Python. O'Reilly Media Inc</surname>
          </string-name>
          .,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Cockburn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Karlson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B. B.</given-names>
            <surname>Bederson</surname>
          </string-name>
          .
          <article-title>A review of overview+detail, zooming, and focus+context interfaces</article-title>
          .
          <source>ACM Comput. Surv.</source>
          ,
          <volume>41</volume>
          (
          <issue>1</issue>
          ):2:
          <issue>1</issue>
          {2:
          <fpage>31</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Dork</article-title>
          , S. Carpendale, and
          <string-name>
            <given-names>C.</given-names>
            <surname>Williamson</surname>
          </string-name>
          .
          <article-title>Fluid views: A zoomable search environment</article-title>
          .
          <source>In Proceedings of the International Working Conference on Advanced Visual Interfaces</source>
          ,
          <source>AVI '12</source>
          , pages
          <fpage>233</fpage>
          {
          <fpage>240</fpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Dziadosz</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Chandrasekar</surname>
          </string-name>
          .
          <article-title>Do thumbnail previews help users make better relevance decisions about web search results?</article-title>
          <source>In Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '02</source>
          , pages
          <fpage>365</fpage>
          {
          <fpage>366</fpage>
          , New York, NY, USA,
          <year>2002</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>W. N.</given-names>
            <surname>Francis</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Kucera</surname>
          </string-name>
          .
          <article-title>Brown corpus manual</article-title>
          . Brown University Department of Linguistics,
          <year>1979</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>T.</given-names>
            <surname>Gossen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Nitsche</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Haun</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Nu</surname>
          </string-name>
          <article-title>rnberger. Data exploration for bisociative knowledge discovery: A brief overview of tools and evaluation methods</article-title>
          . In M. R. Berthold, editor,
          <source>Bisociative Knowledge Discovery</source>
          , volume
          <volume>7250</volume>
          of Lecture Notes in Computer Science, chapter
          <string-name>
            <surname>Part</surname>
            <given-names>IV</given-names>
          </string-name>
          , pages
          <volume>287</volume>
          {
          <fpage>300</fpage>
          . Springer Berlin Heidelberg,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>B. J.</given-names>
            <surname>Jansen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Spink</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Saracevic</surname>
          </string-name>
          .
          <article-title>Real life, real users, and real needs: a study and analysis of user queries on the web</article-title>
          .
          <source>Information processing &amp; management</source>
          ,
          <volume>36</volume>
          (
          <issue>2</issue>
          ):
          <volume>207</volume>
          {
          <fpage>227</fpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>B.</given-names>
            <surname>Jiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Wu</surname>
          </string-name>
          .
          <article-title>Visual summarization of web pages</article-title>
          .
          <source>In Proceedings of the 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '10</source>
          , pages
          <fpage>499</fpage>
          {
          <fpage>506</fpage>
          , New York, NY, USA,
          <year>2010</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>K. S.</given-names>
            <surname>Jones</surname>
          </string-name>
          .
          <article-title>A statistical interpretation of term speci city and its application in retrieval</article-title>
          .
          <source>Journal of documentation</source>
          ,
          <volume>28</volume>
          (
          <issue>1</issue>
          ):
          <volume>11</volume>
          {
          <fpage>21</fpage>
          ,
          <year>1972</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S. L.</given-names>
            <surname>Koshman</surname>
          </string-name>
          . Vibe user study,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>H.</given-names>
            <surname>Levkowitz</surname>
          </string-name>
          .
          <article-title>Color theory and modeling for computer graphics, visualization, and multimedia applications</article-title>
          . Springer,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>J. B. MacQueen.</surname>
          </string-name>
          <article-title>Some methods for classi cation and analysis of multivariate observations</article-title>
          . In L.
          <string-name>
            <surname>M. L. Cam</surname>
          </string-name>
          and J. Neyman, editors,
          <source>Proc. of the fth Berkeley Symposium on Mathematical Statistics and Probability</source>
          , volume
          <volume>1</volume>
          , pages
          <fpage>281</fpage>
          {
          <fpage>297</fpage>
          . University of California Press,
          <year>1967</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>G.</given-names>
            <surname>Marchionini</surname>
          </string-name>
          .
          <article-title>Exploratory search: From nding to understanding</article-title>
          .
          <source>Commun. ACM</source>
          ,
          <volume>49</volume>
          (
          <issue>4</issue>
          ):
          <volume>41</volume>
          {
          <fpage>46</fpage>
          ,
          <string-name>
            <surname>Apr</surname>
          </string-name>
          .
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nitsche</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Nu</surname>
          </string-name>
          <article-title>rnberger. Quest: Querying complex information by direct manipulation</article-title>
          . In S. Yamamoto, editor,
          <source>Human Interface and the Management of Information. Information and Interaction Design</source>
          , volume
          <volume>8016</volume>
          of Lecture Notes in Computer Science, pages
          <volume>240</volume>
          {
          <fpage>249</fpage>
          . Springer Berlin Heidelberg,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>K. A.</given-names>
            <surname>Olsen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. R.</given-names>
            <surname>Korfhage</surname>
          </string-name>
          ,
          <string-name>
            <surname>K. M. Sochats</surname>
            ,
            <given-names>M. B.</given-names>
          </string-name>
          <string-name>
            <surname>Spring</surname>
            , and
            <given-names>J. G.</given-names>
          </string-name>
          <string-name>
            <surname>Williams</surname>
          </string-name>
          .
          <article-title>Visualization of a document collection: the vibe system</article-title>
          .
          <source>Information Processing &amp; Management</source>
          , pages
          <volume>69</volume>
          {
          <fpage>81</fpage>
          ,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>F.</given-names>
            <surname>Pedregosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Varoquaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gramfort</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Michel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thirion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Grisel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Blondel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Prettenhofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Weiss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dubourg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vanderplas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Passos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cournapeau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Perrot</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Duchesnay</surname>
          </string-name>
          .
          <article-title>Scikit-learn: Machine learning in python</article-title>
          .
          <source>J. Mach. Learn. Res.</source>
          ,
          <volume>12</volume>
          :
          <fpage>2825</fpage>
          {
          <fpage>2830</fpage>
          ,
          <string-name>
            <surname>Nov</surname>
          </string-name>
          .
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>J.</given-names>
            <surname>Teevan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Cutrell</surname>
          </string-name>
          , D. Fisher,
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Drucker</surname>
          </string-name>
          , G. Ramos,
          <string-name>
            <given-names>P.</given-names>
            <surname>Andre</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Hu</surname>
          </string-name>
          .
          <article-title>Visual snippets: Summarizing web pages for search and revisitation</article-title>
          .
          <source>In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI '09</source>
          , pages
          <year>2023</year>
          {
          <year>2032</year>
          , New York, NY, USA,
          <year>2009</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>T.</given-names>
            <surname>White. Hadoop: The De nitive Guide</surname>
          </string-name>
          .
          <source>O'Reilly, rst edition</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>