<!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>Search Behaviour Before and After Search Success</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mengdie Zhuang</string-name>
          <email>mzhuang1@sheffield.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Elaine G. Toms</string-name>
          <email>e.toms@sheffield.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gianluca Demartini</string-name>
          <email>g.demartini@sheffield.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Sheffield</institution>
          ,
          <addr-line>Sheffield</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Why do users continue searching after reviewing all relevant documents with which they could have completed a work task? If we knew the answer, then a search system may be able to help users learn about their current search processes, which in turn may enable them to make the whole search process more efficient, leading to greater effectiveness and user satisfaction. This paper is a first step towards solving this problem. Using a previously collected data set, we identified the point of success and hence task completion, and investigated the search behaviour before and after users had accessed all relevant documents for answering assigned tasks. We used a set of search behaviour actions derived from Marchionini's (1995) Information Seeking Process model, and modeled the distribution of these actions throughout the entire search process, comparing actions before and after success could have been attained. Our results suggest that six defined actions, namely user-submitted query, system-suggested query, forward to items, evaluate relevant items, reflect, and answer appeared to change according to the stage of the entire search process. Also, users have notably distinct patterns before and after search success was obtained, but not realised by the user. Not all action were affected; user-submitted query and system-suggested query appeared to be unaffected by time in post-success case and presuccess case, respectively.</p>
      </abstract>
      <kwd-group>
        <kwd>• Information systems~Users and interactive retrieval</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Evaluating search behaviour; Search process; Search success</p>
    </sec>
    <sec id="sec-2">
      <title>1. INTRODUCTION</title>
      <p>
        Do search systems know when a user achieves search success? Do
users know when they have all of the raw materials, i.e., relevant
documents, to complete the task? There is no simple answer.
Search success has been characterised mainly by criteria from two
sources: system performance and user satisfaction. The early
Cranfield experiments [
        <xref ref-type="bibr" rid="ref1 ref4">3</xref>
        ] defined success according to system
performance, with indicators including ranking of relevant
documents, precision, recall [
        <xref ref-type="bibr" rid="ref6">5</xref>
        ]), query effectiveness [
        <xref ref-type="bibr" rid="ref10">9</xref>
        ] and
accessibility to relevant documents (see examples in [1; 4]), and
time spent finding relevant pages. But these did not include
extracting the correct answer [
        <xref ref-type="bibr" rid="ref2">1</xref>
        ].
      </p>
      <p>
        Search success as identified by system performance does not
always correlate with real-world cases. The system does not know
in advance whether the end-user could use or regard the highly
Search as Learning (SAL), July 21, 2016, Pisa, Italy
The copyright for this paper remains with its authors. Copying permitted
for private and academic purposes
ranked documents the way that systems ‘think’ they should be
valued. To assess how users think about the result requires user
response, which is measured either during search (e.g. think aloud
[
        <xref ref-type="bibr" rid="ref8">7</xref>
        ]), or after the search (e.g. interview and questionnaire [
        <xref ref-type="bibr" rid="ref6">5</xref>
        ]). In
the user-oriented context, the terminus of a search process is when
the user feels either relieved/satisfied or disappointed [
        <xref ref-type="bibr" rid="ref7">6</xref>
        ],
regardless of whether the documents retrieved are relevant to
completing the task. Search success in this case is when the user
identifies relief/satisfaction.
      </p>
      <p>
        The two criteria mentioned above are highly distinctive; the point
in time when the system has succeeded (i.e., delivered the relevant
documents according to the user query) and the user’s perception
of success often differ from one another [
        <xref ref-type="bibr" rid="ref14">13</xref>
        ]. User success, which
is assessed at the end of the search, comes later than system
success [
        <xref ref-type="bibr" rid="ref14">13</xref>
        ], as users spend more time after retrieving relevant
documents to confirm their findings. How can the system alert the
user about the current status of relevant documents? Helping users
learn that they have reviewed all documents needed for their
current information needs or indeed that all relevant documents
have been identified would reduce the delay between these two
types of search success. Thus instructing users that they could stop
once the system has done its job and concentrate on using the
retrieved documents for the particular task. Enabling so will
improve efficiency and effectiveness, and lead to user satisfaction.
In this research, we investigate search behaviour before and after
the point of search success, that is, when all relevant documents
needed to respond to the task have been retrieved. In this initial
analysis we examine whether there are differences in search
behaviour while the user is searching for relevant documents, and
after all documents have been retrieved, which we call pre- and
post- search success.
      </p>
    </sec>
    <sec id="sec-3">
      <title>2. METHODS</title>
    </sec>
    <sec id="sec-4">
      <title>2.1 Dataset</title>
      <p>
        The dataset we used was collected in a previous study [
        <xref ref-type="bibr" rid="ref14">13</xref>
        ]. Here
is a brief description (see details in [
        <xref ref-type="bibr" rid="ref14">13</xref>
        ]):
System. wikiSearch system [
        <xref ref-type="bibr" rid="ref12">11</xref>
        ] embedded into the WiIRE (Web
Interactive Information Retrieval Experimentation) [
        <xref ref-type="bibr" rid="ref11">10</xref>
        ].
Participants. 381 participants were recruited via mailing list.
Tasks. Users were assigned 3 out of 12 different tasks. Based on a
set of criteria, the users were asked to decide between two options
in each task.
      </p>
      <p>
        Protocol. Participants were led only by the system throughout the
procedure. Before starting the task, each participant was assigned
3 of the 12 designed tasks (see details in [
        <xref ref-type="bibr" rid="ref14">13</xref>
        ]) with a unique
identification number in order to track their search activities. Each
of the participants first had an introduction of the study and filled
in the Consent Form and the Demographics Questionnaire. Then
they were given a tutorial on how to use the system and were
allowed to self-practice. After the practice, participants went into
the task session. For each task, there was a pre-task questionnaire
and post-task questionnaires; data from these questionnaires were
not included in this paper. Once the participant had submitted
their decisions on all three tasks, they were presented a “Thank
you” page on the screen.
      </p>
      <p>Data Preparation. Log files recorded all interactions between
participants and the system. Within 1143 cases (381 participants
completed 3 tasks each), 86906 behaviour records with
timestamp and participant identification number were extracted from
the log files.</p>
    </sec>
    <sec id="sec-5">
      <title>2.2 Search Action Extraction</title>
      <p>
        The set of behavioural action cases were grouped based on the
pair of participants’ id and task id. Each set of grouped behaviour
records represents all the search actions one participant conducted
in one task, and we refer to it as the search process of {participant
id, task id}. As defined by the experimental interface [
        <xref ref-type="bibr" rid="ref14">13</xref>
        ], 15
scenarios (Table 1) were generated to describe the actions
participants performed during the search sessions. In order to gain
an understanding from a conceptual level and to reduce the noise
caused by multiple action types, we generated 9 actions (Table 1)
based on the Information Seeking Process model [
        <xref ref-type="bibr" rid="ref9">8</xref>
        ]. In the
present study, we extracted features of the sub-process
“examining results” into two backward motions, two forward
motions [
        <xref ref-type="bibr" rid="ref15">14</xref>
        ], and evaluated relevant items: “formulating and
executing query” into two query actions; and “extracting
information and reflect” into answer and reflect.
      </p>
      <p>
        In the system interface [
        <xref ref-type="bibr" rid="ref14">13</xref>
        ] for the in-lab experiment, all functions
were presented and contained in only one single window to
control the search process, and eliminate conflicting variables,
such as the execution of multiple simultaneous user tasks. Thus
the experimental control using a single task: 1) gave users clear
instructions; 2) provided a simple user interface and eliminated
the labyrinth typically introduced by search system, allowing
users to focus on actions of interest, which would lead to a
simplified, holistic model.
      </p>
    </sec>
    <sec id="sec-6">
      <title>2.3 Time points</title>
      <p>In this paper, we used two points in time within the search process
of a single task:</p>
      <p>
        System success: we manually identified the system
success point in each search process (see a detailed
description in [
        <xref ref-type="bibr" rid="ref14">13</xref>
        ]). First, “Answer Sets” were created;
each set contains all the relevant documents that are
needed to be used to provide a possible answer for each
task. No set is a subset of another. Each task had 1-5
relevant answer sets, representing the different
approaches that could be taken to find an answer, and no
single document could provide a complete answer. The
point at which a participant has reviewed all documents
in one answer set for the current search task is
considered the point of “system success”. In this paper,
we define the time period from when user starts a task to
•
3
0
0
0
22
6
0
2
14
      </p>
      <p>Q3
109
0
0
31
21
0
138
56
185
129.2
SD
115.3
72.1
45.6
109.3
48.6
18.5
104.8
85.0</p>
      <p>Scenarios
• Click/type into the answer box
• Click a item in history section
• Click a previous viewed page
• Click a item in bookbag
• Add /delete/rate item to bookbag
• Add/delete page into bookbag
• Block/unblock an item or page
• Click on a item in results list
• Click on a new page in result list
• Submit a query
• Click a query in history section,</p>
      <p>suggested by system.
• Click a hyperlink in item article,
which leads to a result list.
the point in time when system success was achieved as
the pre-success case.</p>
      <p>Search Terminus: Search terminus in this study refers
to the time point at which a user submitted an answer
for a task, and stopped searching further. It is also the
task terminus. We define the point in time from when
the user reached system success point to the terminus as
the post-success case. Participants completed a post-task
questionnaire at the end of each task about their search
experience, but these data are outside the scope of this
analysis.</p>
    </sec>
    <sec id="sec-7">
      <title>3. RESULTS AND DISCUSSION</title>
    </sec>
    <sec id="sec-8">
      <title>3.1 Overview of Search Action</title>
      <p>The 381 participants completed three tasks each, which resulted in
1143 action cases. In 39 cases (3.4%), participants did not review
at least one relevant answer set. These were excluded, resulting in
1143 pre-success cases and 1104 post-success cases in total. The
{participant id, task id} pair uniquely identifies each case, which
contains nine possible actions. Table 1 presents descriptive
statistics of the possible actions.</p>
      <p>
        The interquartile range (IQR) is the difference between the 3rd
quartile and the 1st quartile. We considered outliers the values that
are either 1.5 IQR above the 3rd quartile, or 1.5 IQR below the 1st
quartile [
        <xref ref-type="bibr" rid="ref3">2</xref>
        ]. We observed a large number of outliers in all
backward motion and forward motion actions (B, b, F, and f).
However, these four actions all account for a very small percent of
the total time (2-6%). Particularly, the values of the 3rd quartile for
B, b, and f are 0, indicating that most of the participants did not
perform any action of these types at all. However, a few
participants spent a very long time in both backward motion
actions and forward to items (Max(B) = 939, Max(b) = 654,
Max(F) = 566). The large number of outliers and the high
maximum value suggest that general statistics used to measure
time of these four actions, typically relying on mean value, may
inaccurately represent the data sample. On the other hand, Action
Query (Q), query (q), action answer tasks (A), action reflect (R),
and evaluation of items (E) account for 20% (M = 91.6), 10% (M
= 48.9), 16% (M = 71.9), 28% (M = 124.5), and 10% (M = 48.3)
of the total time, respectively.
      </p>
    </sec>
    <sec id="sec-9">
      <title>3.2 Pre-success case</title>
      <p>From the 1143 pre-success action cases extracted from log files,
we studied the distribution of each action observed during the
presuccess case. Figure 1 (left half) shows the probability of an
action, P(Action), taking place at different time points of the
presuccess case. We normalised the time scale to show the proportion
of the whole pre-success case time frame. The total probability of
all 9 actions is 1. Three of our defined backward motions and
forward motions (f, B, b) and action E have extremely low
probabilities across the entire pre-success case (P &lt; 0.001), and
almost no action A occurred except in those 39 tasks that did not
achieve search success. We interpret this as mis-clicking (action A
only happened for 1 or 2 seconds, and P(A) &lt; 0.02), indicating
that almost all the users who achieved search success in this task
did not even attempt to generate answers before actually
reviewing all the relevant documents. Therefore, these 5 actions,
B, b, E, f, A, are not included in Figure 1 (left side).</p>
      <p>The left end of Figure 1 (left half) reveals the probability of
actions occurring right after a task began, while the right end of
Figure 1 (left half) represents the probability of actions happening
close to the search success point. As defined by the experimental
design, action Q has an almost 100% probability at the beginning,
when very few participants clicked the answer box. P(Q) drops as
participants turned to check new items from the result lists,
reflected by the sharp spike in P(F).</p>
      <p>P(R) achieves a value above 0.4, and then keeps dropping slowly
until just before the success point. P(F), on the other hand, has a
sharp drop to around 0.05 from 20% to 80% of the pre-success
case, and grew significantly just after 88% of the pre success case.
As defined in this study, users who achieved success checked all
the relevant documents, and so the action preceding the success
point would be that they approached new items (F). P(q) is around
0.1 for the whole pre-success case with a slight decreasing trend
until 90% of pre-success case, after which there is a slight upward
trend until right before the end of pre-success case, suggesting that
users accessed the last relevant but un-reviewed document from
both user-submitted query (Q) and system-suggested query (q).
With a shape complementary to P(F), P(Q) keeps increasing until
90% of the pre-success case.</p>
      <p>P(R) has a value above 0.28 across the entire post-success case,
which is the highest among all actions, indicating that users
reflected, based on their viewings, consistently more frequently
than in the pre-success cases. It peaks right after the success point,
and has a smooth decrease until 90% of the post-success case,
followed by a rise to 0.52 at the end of the search session. This
demonstrates that users tend to reflect on their findings before
ending their search session. Compared to the extremely low P(A)
in the pre-success case, P(A) increases steadily throughout
different stages of the post-success case, before an eventual drop
near the very end. This indicates that not all users waited until the
very end of the case to give an answer, and they continued with
the case after A.</p>
      <p>P(q) appears to be above 0.5 at the very left end of Figure 1 (right
half) with a quick sharp drop at 0.15, and slowly decreases until
the end. In the entire search session, P(q) only has a peak above
0.5 right after the success point. This value may be exaggerated by
normalising the time scale, but still shows that a portion of users
clicked a query from the history list or clicked a hyperlink after
they reviewed the last relevant item. The probability of
systemsuggested query (action q) is larger than submitting a
usersubmitted query (Q) for the first 77% of the post-success case. In
the pre-success case, P(Q) is always larger than P(q). P(Q) in the
post-success case has a relatively flat curve below 0.1.
P(E) in Figure 1 (right half) (value&gt;0) indicates participants
returned to reviewed items in the post-success case, which is
rarely observed in the pre-success case.</p>
    </sec>
    <sec id="sec-10">
      <title>4. CONCLUSIONS AND FUTURE WORK</title>
      <p>
        The key objective of this work was to assess whether search
behaviour pattern changes before and after users reach system
success. We analysed nine search actions from a previously
collected dataset of 381 users completing search tasks using a
search system. The 15 observable behavioural scenarios were
categorised into 9 search actions based on the Information
Seeking Process model [
        <xref ref-type="bibr" rid="ref9">8</xref>
        ], and then the distribution of each
action was observed in pre- and post- success cases with a
normalised time scale.
      </p>
      <p>Our results show that six defined actions: user-submitted query,
system-suggested query, forward to items, evaluate relevant items,
reflect, and answer, appear to change according to the portions of
the search process, as well as being notably different between
preand post- success case types. However, three defined actions,
backward to items, backward to pages, and forward to pages, have
extremely low probability across the entire search process. In
addition, user-submitted query and system-suggested query appear
to be unaffected by time in post-success case and pre-success case,
respectively.</p>
      <p>
        In a previous research, Toms, Villa and McCay-Peet (see Figure 2
in [
        <xref ref-type="bibr" rid="ref14">13</xref>
        ]) using the same dataset observed that the average system
success was achieved before 40% of the entire search process was
completed. Moreover, in 78% of the tasks, participants did not
click on any new, unseen documents after they reached the system
search success point. But, users committed significant time and
effort after attaining system success. As mentioned above, user
behaviour changed before and after the system success. However,
to our knowledge, current mainstream systems do not examine,
assess and exploit changes in behaviour to intervene in the search
process to notify that no more new relevant information is
available (based on queries submitted) so that users can stop
searching and start interpreting the information retrieved. In other
words, current systems do not help the user to learn about the
current search; they simply exacerbate the problem by repeating
search results.
      </p>
      <p>To obtain further insights into why users continue to search after
system success and how to design system functions to instruct
users about the search process, we are currently working on
extracting key sub-sequences in pre/post-success cases, and on
examining the indicators. This could potentially augment the
development of a system function to help user learn about their
search progress, and will further improve efficiency of search
process evaluation that would benefit both users and search engine
developers.
5. REFERENCES</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <article-title>3.3 Post-success case</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Ageev</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lagun</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Agichtein</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <year>2011</year>
          .
          <article-title>Find it if you can: a game for modeling different types of web search success using interaction data</article-title>
          .
          <source>Proc. SIGIR</source>
          '
          <volume>11</volume>
          ,
          <fpage>345</fpage>
          -
          <lpage>354</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Bamnett</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Lewis</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <year>1994</year>
          .
          <article-title>Outliers in statistical data</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Cleverdon</surname>
            ,
            <given-names>C.W.</given-names>
          </string-name>
          ,
          <year>1960</year>
          .
          <article-title>The aslib cranfield research project on the comparative efficiency of indexing systems</article-title>
          .
          <source>In Aslib Proceedings</source>
          ,
          <fpage>421</fpage>
          -
          <lpage>431</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Hassan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jones</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Klinkner</surname>
            ,
            <given-names>K.L.</given-names>
          </string-name>
          ,
          <year>2010</year>
          .
          <article-title>Beyond DCG: user behavior as a predictor of a successful search</article-title>
          .
          <source>Proc. WSDM</source>
          '
          <volume>10</volume>
          ,
          <fpage>221</fpage>
          -
          <lpage>230</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Kelly</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <year>2009</year>
          .
          <article-title>Methods for evaluating interactive information retrieval systems with users</article-title>
          .
          <source>Foundations and Trends in Information Retrieval 3</source>
          ,
          <fpage>1</fpage>
          -
          <issue>2</issue>
          ,
          <fpage>1</fpage>
          -
          <lpage>224</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Kuhlthau</surname>
            ,
            <given-names>C.C.</given-names>
          </string-name>
          ,
          <year>1991</year>
          .
          <article-title>Inside the search process: Information seeking from the user's perspective</article-title>
          .
          <source>Journal of the American society for information science 42</source>
          ,
          <issue>5</issue>
          ,
          <fpage>361</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Lewis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <year>1982</year>
          .
          <article-title>Using the" thinking-aloud" method in cognitive interface design</article-title>
          .
          <source>IBM</source>
          TJ Watson Research Center.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Marchionini</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <year>1995</year>
          .
          <article-title>Information seeking in electronic environments</article-title>
          . Cambridge University Press.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Shah</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hendahewa</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>González­Ibáñez</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <year>2015</year>
          .
          <article-title>Rain or shine? forecasting search process performance in exploratory search tasks</article-title>
          .
          <source>Journal of the Association for Information Science and Technology.</source>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Toms</surname>
            ,
            <given-names>E.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Freund</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <year>2004</year>
          .
          <article-title>WiRE: the Web interactive information retrieval experimentation system prototype</article-title>
          .
          <source>Information Processing &amp; Management</source>
          <volume>40</volume>
          ,
          <issue>4</issue>
          ,
          <fpage>655</fpage>
          -
          <lpage>675</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Toms</surname>
            ,
            <given-names>E.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mccay-Peet</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Mackenzie</surname>
          </string-name>
          , R.T.,
          <year>2009</year>
          . wikiSearch: From Access to Use. In Research and Advanced Technology for Digital Libraries Springer,
          <fpage>27</fpage>
          -
          <lpage>38</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Toms</surname>
            ,
            <given-names>E.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Villa</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Mccay-Peet</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <year>2013</year>
          .
          <article-title>How is a search system used in work task completion</article-title>
          ?
          <source>Journal of information science 39</source>
          ,
          <issue>1</issue>
          ,
          <fpage>15</fpage>
          -
          <lpage>25</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Toms</surname>
            ,
            <given-names>E.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Villa</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Mccay-Peet</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <year>2013</year>
          .
          <article-title>How is a search system used in work task completion</article-title>
          ?
          <source>Journal of information science.</source>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [14]
          <string-name>
            <surname>White</surname>
            ,
            <given-names>R.W.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Dumais</surname>
          </string-name>
          , S.T.,
          <year>2009</year>
          .
          <article-title>Characterizing and predicting search engine switching behavior</article-title>
          .
          <source>Proc. CIKM</source>
          '
          <volume>09</volume>
          ,
          <fpage>87</fpage>
          -
          <lpage>96</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>