<!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>Theory-Based User Modeling for Personalized interactive Information Retrieval</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Asad Ullah</string-name>
          <email>Asadullah.asadullah1@stud</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Haiming Liu Department of Computer Science and Technology University of Bedfordshire LU1 3JU</institution>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute for Research in Applicable Computing University of Bedfordshire</institution>
          ,
          <addr-line>LU1 3JU</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In an effort to improve users' search experiences during their information seeking process, providing a personalized information retrieval system is proposed to be one of the effective approaches. To personalize the search systems requires a good understanding of the users. User modeling has been approved to be a good method for learning and representing users. Therefore many user modeling studies have been carried out and some user models have been developed. The majority of the user modeling studies applies inductive approach, and only small number of studies employs deductive approach. In this paper, an EISE (Extended Information goal, Search strategy and Evaluation threshold) user model is proposed, which uses the deductive approach based on psychology theories and an existing user model. Ten users' interactive search log obtained from the real search engine is applied to validate the proposed user model. The preliminary validation results show that the EISE model can be applied to identify different types of users. The search preferences of the different user types can be applied to inform interactive search system design and development.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Information retrieval</kwd>
        <kwd>User modeling</kwd>
        <kwd>Personalization</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>CCS Concepts</title>
      <p>•Human-centered computing →
methods; User models;
•Information systems
Personalization;</p>
      <p>HCI design and evaluation
→</p>
      <p>Users and interactive retrieval;</p>
    </sec>
    <sec id="sec-2">
      <title>1. INTRODUCTION</title>
      <p>
        Search engines e.g. (Google and Bing) are the core online
technologies, which are widely used by people for information
seeking. Information retrieval is to query the search engine with
one or multiple iterations [
        <xref ref-type="bibr" rid="ref26">28</xref>
        ]. The returning results can be
relevant to one group of users but not to the others due to the
users’ different information needs [
        <xref ref-type="bibr" rid="ref24">26</xref>
        ]. Therefore, to understand
the users’ needs and preferences and to personalize the search
process becomes vital to deliver good search experience to the
users. To enable the personalized search, different methods are
proposed. For example, making query suggestions to the users
[
        <xref ref-type="bibr" rid="ref10 ref18">20, 12</xref>
        ], Users’ profiling [
        <xref ref-type="bibr" rid="ref12">14</xref>
        ] and modeling users’ interest [
        <xref ref-type="bibr" rid="ref15">17</xref>
        ];
and Providing different results to different users based on the user
short and long term search behaviors [2]. To understand users’
needs and preferences, user modeling is an effective approach.
The existing user modeling research mainly applies the inductive
approach, which means that the development of the user model is
informed by the analysis results of the user’s interaction data.
However, the results generated by this approach are often not
validated by any users and theories. Therefore, a deductive
approach is employed in this paper to design and develop an
effective theory -based user model for personalized interactive
search. The model is preliminarily validated using ten users’ real
life search logs from a search engine.
      </p>
      <p>This paper is divided into the following sections. Section 2 is
related work to the current study, section 3 proposes the model,
Section 4 describes methodology and Section 5 reports
experimentation set up and results.</p>
    </sec>
    <sec id="sec-3">
      <title>2. RELATED</title>
    </sec>
    <sec id="sec-4">
      <title>WORK</title>
      <p>
        In this section, some related user behavior theories, psychology
theories and user models will be reviewed. The proposed model
by Wilson in 1981 [
        <xref ref-type="bibr" rid="ref29">31</xref>
        ] is one of the first model on information
seeking behavior. The model splits into two parts: one is how
information needs are initiated; the other is what attainment
barriers are. The users’ information needs often rely on the
surrounding environment, psychological needs and Social
cultural. Political and economic needs also affect the information
needs and search strategy. The model proposed by Wilson in 1996
[
        <xref ref-type="bibr" rid="ref30">32</xref>
        ] is a more refined model on the basis of using numerous skills
rather than just information science skills, e.g. decision making,
innovation, and consumer research. Another model developed by
Ellis [
        <xref ref-type="bibr" rid="ref4">6</xref>
        ] explains step by step approach involved in information
seeking. The model includes six steps, namely, starting, chaining,
browsing, differentiating, extracting and finally ending.
Information Search Process (ISP) model proposed by Kuhlthau
[
        <xref ref-type="bibr" rid="ref11">13</xref>
        ] includes six stages, namely, initiation, selection, exploration,
formulation, collection and presentation. Each of the six stages
also explain the emotions behind the behind the scene [
        <xref ref-type="bibr" rid="ref6">8</xref>
        ]. These
models provide useful theoretical framework to personalized
information seeking process and valuable contribution to the
knowledge. However, whilst these models explain the human
perspective of interactive information seeking, there is a lack of
validation based on users’ interaction data. This study will not
only propose the theory -based user model for interactive
search behavior categories (Table 1). Whilst the ISE model is
proven to be useful to model users for their search preferences, the
limitation of the model is that there is a lack of the operational
definitions of each characteristic for more precise user modeling.
In this section, the operational definitions of the six characteristics
of the ISE model will be enriched on the bases on psychology
theories. Our assumption is that the users’ normal preferences and
behaviors should be similar to the users’ preference and behaviors
when searching. Psychology theories will be reviewed and
employed in this section to extend ISE model (EISE). The
following subsections will describe how the Psychology theories
are applied to extend the ISE mode.
information seeking, but also validate the user model using the
users’ real life search log.
      </p>
      <p>The above user models are developed based on a deductive
approach (theory -based). The following section will introduce
user models developed based on the inductive approach (user data
analysis based). In our view, a combination of the two is need for
user model development.</p>
      <p>
        Query Suggestion is one of the popular approaches for
personalization [
        <xref ref-type="bibr" rid="ref1">3</xref>
        ]. For example context aware query suggestions,
[
        <xref ref-type="bibr" rid="ref1">3</xref>
        ] and identification of different aspects of queries, [
        <xref ref-type="bibr" rid="ref10 ref7 ref8">9, 10, 12</xref>
        ].
User profiling is another method to find out users’ interests at
different level [
        <xref ref-type="bibr" rid="ref28">30</xref>
        ]. Other studies focus on user long term search
history and applying probabilistic model on the search history
[
        <xref ref-type="bibr" rid="ref23">25</xref>
        ]. In other studies the short and long term interest are
combined to optimize the effect of personalization [2]. Similar
study by [
        <xref ref-type="bibr" rid="ref13">15</xref>
        ] integrates long term and short term history to build a
user profile. Groups of researcher have done a study on the user
unique information goals. They have found that search engines
can satisfy overall intentions of user but cannot address their
unique goals. [
        <xref ref-type="bibr" rid="ref24">26</xref>
        ]. Another study [
        <xref ref-type="bibr" rid="ref25">27</xref>
        ] models users decision
points where they explain the flow of user from choosing search
engine to summarizing results and selecting result or moving into
another search provider if not satisfied. Our st udy will induce both
information goal and decision making in our user model, which
will be supported by psychology theories and validated by the real
life user search interaction data.
      </p>
      <p>
        In this paper, a user classification model called ISE (Information
Goal, Search strategy and Evaluation threshold) [
        <xref ref-type="bibr" rid="ref14">16</xref>
        ] is modified
in a new context. A new user model called EISE (Extend ISE)
will be proposed and validated based on the established
phycology theories and users’ search interaction date. The ISE
user classification model is developed based on Information
Foraging Theory (IFT) [
        <xref ref-type="bibr" rid="ref19">21</xref>
        ]. IFT was originally derived from
Optimal Foraging Theory (OFT) [
        <xref ref-type="bibr" rid="ref27">29</xref>
        ]. OFT found a pattern when
animals hunting for prey, how animal chose their food depends on
their environment and abundance of food, for example, the
decision on whether they should eat or leave the food and move to
a different place [
        <xref ref-type="bibr" rid="ref21">23</xref>
        ]. Pirolli and card adapted the theory to the
information world. They found lots of similarities in animal
hunting and human information seeking. Based on this, they
proposed information foraging theory (IFT) [
        <xref ref-type="bibr" rid="ref19">21</xref>
        ]. IFT consists of
information scent model, information patch model, and
information diet model [
        <xref ref-type="bibr" rid="ref19 ref20">21, 22</xref>
        ]. The ISE user classification model
groups user into three categories and six characteristics namely
information goal (Fixed and Evolving), Search Strategy (Cautious
and risky), evaluation threshold (Precise and weak) [
        <xref ref-type="bibr" rid="ref19">21</xref>
        ]. The
information goal of ISE model is developed based on the
information sent model of IFT. According t o IFT user with strong
clues normally have fixed information goals, otherwise the user
will be considered to have evolving information goal that is also
called exploratory search [
        <xref ref-type="bibr" rid="ref14">16</xref>
        ]. The search strategy is developed
based on the information patch model of IFT. Cautious users will
move around very carefully to find relevant information and when
risky users will move around between patches a lot [
        <xref ref-type="bibr" rid="ref13">15</xref>
        ]. Finally
evaluation threshold is developed based on information diet
model. Decision making process is heavily involved at this stage.
Normally precise user will be picky when selecting results, whilst
weak user will be satisfied with the result easily [
        <xref ref-type="bibr" rid="ref14">16</xref>
        ].
      </p>
    </sec>
    <sec id="sec-5">
      <title>3. PROPOSED MODEL – ESIE</title>
      <p>
        Based on the ISE model [
        <xref ref-type="bibr" rid="ref14">16</xref>
        ] introduced in the last section,
users can be grouped based on six characteristics and of three
      </p>
      <sec id="sec-5-1">
        <title>Evolving</title>
      </sec>
      <sec id="sec-5-2">
        <title>Risk</title>
      </sec>
      <sec id="sec-5-3">
        <title>Weak</title>
      </sec>
      <sec id="sec-5-4">
        <title>S earch S trategy</title>
      </sec>
      <sec id="sec-5-5">
        <title>Evaluation</title>
      </sec>
      <sec id="sec-5-6">
        <title>Threshold</title>
      </sec>
      <sec id="sec-5-7">
        <title>Cautious</title>
      </sec>
      <sec id="sec-5-8">
        <title>Precise</title>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>3.1 Information Goal</title>
      <p>
        This section will describe the two characteristics of
Information Goal, fixed information goals and evolving
information goals and extend these characteristics with two
mindset theory (Fixed and Growth mind-sets) [
        <xref ref-type="bibr" rid="ref3">5</xref>
        ]. According to Carol
dweck two types of mind sets exists fixed mind set and growth
mind set [
        <xref ref-type="bibr" rid="ref3">5</xref>
        ]. The two mind-set theory has different usage in
psychology and personality building. She prefers the growth mind
set over the fixed mind set but this is not our research concern. In
this study the adapted characteristics of those mind sets will be
engaged to fit in EISE model characteristics. The study will
investigate the existence of those behaviors in the information
seeking process. Our research dose not focus on cultivating
certain type mind set but to provide a personalized search
experience to the certain type of mind set. Table 2 and Table 3
will present both mind sets mapped to the Fixed and Evolving
Information Goal of the ISE model. The obtained analogy from
the two mind theory and the derived operational definitions from
the analogy will explicitly help us to distinct between users. The
following sections will explain the differences from the two mind
sets and the similarity between the two minds sets theory and the
Information Goal of the ISE model.
      </p>
      <sec id="sec-6-1">
        <title>3.1.1 Fixed Information Goal</title>
        <p>Detail explanation of information goals are delivered in the above
sections. In this section the focal point will be one of the
characteristic of information goal. Correlation between fixed mind
–set and fixed information goal can help us to build a resilient
model established psychology theory. From analogy of the theory
we can produce an operational definition to distinguish between
user behaviors. Operational definitions are a set of rules to
quantify user activities.</p>
        <p>In the left column of the Table 2 presents Fixed mind-set theory of
the two minds theory. The right column of Table 1 describes the
search analogy of the Fixed mind-set theory.</p>
        <p>From the above conclusion of Table 1 the following operational
definitions can be obtained from the description of the theory and
the search analogies:</p>
      </sec>
      <sec id="sec-6-2">
        <title>3.1.2 Evolving Information Goal</title>
        <p>The characteristics of growth mind set can be mapped with
evolving information goals. According to two mind set theory
people with growth mind can exceed more than fixed mind set but
in the model will only adapt the characteristics of the growth
mindset to endorse our model. The preference of one mind set has
no significance on other mind. Because the study is eager to
identify the variance between fixed and evolving information
goals.</p>
        <p>Fixed jumps are the types of query jumps used when there
are no changes to the information goals user. If there is no
changes to the user information goals and high number of
jumps query are available the user has evoking information
goals.</p>
        <sec id="sec-6-2-1">
          <title>Use of large number of history.</title>
          <p>History is an example of queries that are used before in
sessions and between sessions. User with evolving
information goals will use more repeats to refine the result.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>3.2 Search Strategy</title>
      <p>
        Search strategy is also divided into two types [
        <xref ref-type="bibr" rid="ref14">16</xref>
        ] namely,
Cautious behavior and Risky behavior. Cautious users is
described by M oulton M arston as analytical thinker, who has high
standards, careful background research; focus on details, having
realistic approach to solve the problem [1] and [
        <xref ref-type="bibr" rid="ref16">18</xref>
        ]. M arston
work was ignored even it was the back bone of the prominent
personality test tool called DiSC. The work is later on
acknowledged by professor Irvine [4]. A cautious behavior is also
considered self-disciplined, results-oriented, structured
(organized) and slow mover [
        <xref ref-type="bibr" rid="ref10">12</xref>
        ].
      </p>
      <sec id="sec-7-1">
        <title>3.2.1 Cautious behavior</title>
        <p>To simplify cautious behavior Table 4 can provide a detailed
explanation. From the right side of the table properties of cautious
behavior can be seen and left side of the table clarify the analogy
to information seeking.</p>
        <p>The operational definitions are derived from the conclusion of
obtained analogy from risky behaviors.</p>
        <sec id="sec-7-1-1">
          <title>Low query iteration.</title>
          <p>The user will have less number of alterations to the queries.</p>
        </sec>
        <sec id="sec-7-1-2">
          <title>Less number clicks in other pages compare to first page.</title>
          <p>The user will rely on first page of the results.</p>
        </sec>
        <sec id="sec-7-1-3">
          <title>Lower Position link clicked in multiple pages.</title>
          <p>The user will click on the immediate link on the page for
example on the first link of the page.</p>
        </sec>
        <sec id="sec-7-1-4">
          <title>View small number of result pages.</title>
          <p>The user will have small number of page viewing per
session.</p>
        </sec>
        <sec id="sec-7-1-5">
          <title>S pend short time per search iteration.</title>
          <p>User will spend less time per session.</p>
          <p>The operational definitions are generated based on the search
analogy to enable the application of the Cautious characteristics in
user modeling are:</p>
        </sec>
        <sec id="sec-7-1-6">
          <title>High number of query iteration.</title>
          <p>The user will have more alteration to the queries.</p>
        </sec>
        <sec id="sec-7-1-7">
          <title>More clicks in other pages compare to the first page.</title>
          <p>The user will move around in the session and open more and
more pages beyond first page.</p>
        </sec>
        <sec id="sec-7-1-8">
          <title>Higher position link clicked in multiple pages.</title>
          <p>The user will click on many links not only relying on the first
links of the page.</p>
        </sec>
        <sec id="sec-7-1-9">
          <title>View large number of result pages.</title>
          <p>The user will view many pages correspond to the query to
satisfy his information needs.</p>
        </sec>
        <sec id="sec-7-1-10">
          <title>S pend long time per search iteration.</title>
          <p>User will spend more time per session.</p>
        </sec>
      </sec>
      <sec id="sec-7-2">
        <title>3.2.2 Risk y behavior</title>
        <p>In literature there is no perfect theory to explain risky behavior in
contrary to cautious behavior. So it can be appeared opposite to
cautious behavior. Right column of Table 5 explains analogy from
the left column of the risky behavior.
number of result pages to surf
all opportunities.</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>3.3 Evaluation threshold</title>
      <p>
        The last set of the characteristics of the ISE model contains
two types of result evaluation threshold, precise evaluation
threshold and weak evaluation threshold. These characteristics
involve decision making, so the study need to get some insight
knowledge of decision making to strength the characteristics of
the user model. According to Herbert A. Simon Nobel Laurent the
process of decision making depends on the available information
and understanding of the information in the required time [
        <xref ref-type="bibr" rid="ref5">7</xref>
        ].
Further decision makers are categories into two types’
maximizers and satisfiers [
        <xref ref-type="bibr" rid="ref22">24</xref>
        ]. This section of the model will be
will explained by these two types of decision makers in the below
Table 6 and Table 7.
      </p>
      <sec id="sec-8-1">
        <title>3.3.1 Precise Evaluation Threshold.</title>
        <p>Precise evaluation threshold will be validated from the behaviors
of maximizers as shown in Table 6. Left column of the table
illustrates the behavior of maximizers and right column shows the
obtained analogy from the behaviors.
The operational definitions based on the search analogy enable the
application of the precise characteristics in user modeling are:</p>
        <sec id="sec-8-1-1">
          <title>High numbers of history.</title>
          <p>The user will have high use of repetition queries in session
and between sessions.</p>
        </sec>
        <sec id="sec-8-1-2">
          <title>Larger numbers of clicks compare queries.</title>
          <p>The user will have more clicks as compare to the amount of
queries.</p>
        </sec>
        <sec id="sec-8-1-3">
          <title>High query iteration.</title>
          <p>The user will have more alteration to the queries.</p>
        </sec>
        <sec id="sec-8-1-4">
          <title>Higher pages clicked.</title>
          <p>The user will expend the search for long period and usage of
more pages in session.</p>
        </sec>
        <sec id="sec-8-1-5">
          <title>S earch large number of iterations.</title>
          <p>The user will perform more detail search e.g. more number
of page viewing per iteration.</p>
        </sec>
      </sec>
      <sec id="sec-8-2">
        <title>3.3.2 Weak Evaluation Threshold</title>
        <p>Weak evaluation threshold will be validated from the behaviors of
satisfiers as shown in Table 7. Left column of the table explain the
behavior of satisfiers and right column shows the obtained
analogy from the behaviors.</p>
        <p>The user will open less number of pages during the search
process.</p>
        <sec id="sec-8-2-1">
          <title>S earch small number of iterations.</title>
          <p>The user will perform a very little during search process.</p>
          <p>View small number of p ages during the search process.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>4. EXPERIMENT SET UP</title>
      <p>
        This section describes a preliminary experiment set up for
validating the EISE model. Ten user search log data from Bing
Search Engine is used, which contain a collection of 4231 queries
average of 423 per user and 40217 results average of 4021 per
user. The data log contain anonymous User id, time and date,
query name, page number of search engine page, rank in one
search engine page, URL, dwell time and click count. The Similar
search log is used by a group of researcher to classify interaction
features [
        <xref ref-type="bibr" rid="ref9">11</xref>
        ].
      </p>
      <p>
        The extracted 24 key interaction features from the search log
data justify the operational definition of each characteristics
prop osed in Section 3. The 24 features include, Average clicks on
page number of search Result, Average Number of result pages
viewed per query , Average Position of each result click on
particular result page, Average Number of query per session,
Average number of result clicks per session, Average time spend
per session total number of query , total Empty result query ,
Average number of result clicks in single query , Total number of
first link clicks, Average view time first link, Total number other
link click, Average view time other links clicked, total number of
repeat, Total Subset, total Super-set, Total number of Overlap,
Total number of Back query , total number Back repeat queries
between sessions, Total number of jump query , Total number
Fixed jump query , Total number of new jump query between
session, Total number of fixed new jump between session.
The whole process of data analysis was done manually as some of
the key features require deeper analysis. From observing the data
the below 10 types of query transitions are prop osed. Five of them
where already defined in the original ISE model for CBIR
(Content based image retrieval) and the rest of other five were
discovered during our data analysis.
• Repeat: Consecutive use of the same query [
        <xref ref-type="bibr" rid="ref14">16</xref>
        ].
• S ubset: S ubset of the previous query. [
        <xref ref-type="bibr" rid="ref14">16</xref>
        ].
• S uper-set: The entire previous query with additional words
[
        <xref ref-type="bibr" rid="ref14">16</xref>
        ].
• Overlap: Mix query with some words from previous query
[
        <xref ref-type="bibr" rid="ref14">16</xref>
        ].
• Back: S ame query used in a session but not consecutively.
• Back Repeat: Repeat of same queries in between sessions.
• Jump Query: New query within session and new information
goal during the session.
• Fixed Jump Query: New query with fixed information goals
during the session.
• New jump: New query with new information goals between
sessions.
• Fixed New jump: New query with fixed information goals
between sessions [
        <xref ref-type="bibr" rid="ref14">16</xref>
        ].
      </p>
      <p>The above query iterations are divided into four group s, namely,
history (repeat, back repeat, back); iteration (subset, super-set and
overlap); Jumps (Jump and new jump); history plus iterations
(fixed jump and fixed new jump).</p>
    </sec>
    <sec id="sec-10">
      <title>5. EXPERIMENTAL RESULTS</title>
      <p>This section report the data analysis results based on the
methodology prop osed in the above section. Applying the model
on user search data log the result will be shown one by one
characteristic wise. The above characteristics of the model overlap
each other due to sharing of some operational definitions. The
model divides the search process into three main categories
Information goals, Search strategy and Evaluation threshold. The
information seeking process looks simultaneous so there is a very
thin line between these categories. To avoid confusion that from
where each category starts if some of the operational definitions
of each category shared then maximal results can be achieved
from the data.</p>
    </sec>
    <sec id="sec-11">
      <title>5.1 Results for informatio n Goals</title>
      <p>The selection criteria of users in fixed and evolving information
is based on their performance in operational definitions. To
further scrutinize the users for information goals the users are
examine with low, medium and high performance in there
operational definitions.</p>
      <sec id="sec-11-1">
        <title>5.1.1 Fixed information Goals</title>
        <p>After analyzing the search data log the operational definitions
of each characteristic explained in the model were judged beside
the results. Figure 1 is an example of fixed information goals.
According to operational definitions of fixed information goals
user will have less number of query iterations (subset, super set
and overlaps) an example of a user with no iterations in Figure 1
can be seen. The second operational definition is less fixed jumps
(fixed jumps and fixed new jumps) which can be seen in Figure.1.
There are a very low number of fixed jumps. The last operational
definition is low history (repeat, back and back repeat) in this case
the user has very high number of histories so this operational
definition is not satisfied by Figure 1. Now this user qualifies two
of the operational definition so the user is considered fixed in
there information goals. In Table 8 shows all of the users that
qualify each of the operational definitions related to fixed
information goals but only User ID 7 and User ID 3 absorb
maximum characteristics of fixed information goals.</p>
        <sec id="sec-11-1-1">
          <title>Fixed Users ID</title>
          <p>3, 7</p>
        </sec>
      </sec>
      <sec id="sec-11-2">
        <title>5.1.2 Evolving Information Goals</title>
        <p>Figure 2 is an example of a user with evolving information
goals. According to the first operational definitions of evolving
information goals, user will have high number of iterations
(subset, super-set and overlaps). Fixed jumps (fixed jump and
fixed new jump ) are also consider iterations and history due to the
same information goals. So Figure 2 shows a user with high
number of iterations in combination with fixed jumps. The second
operational definition is already explained and high fixed jumps
can be seen in Figure 2. The last operational definition is High
number of history (repeat, back and back repeat). While Figure 2
shows high number of repeats but low number of back and back
repeats and fixed jumps also provides history . So not only rely ing
on repeats than combine both repeats and fixed jumps user will
have high number of histories. The overall performance of Figure
2 show that this is user had evolving information goals. Table 9
shows the overall performance of users with respect to operational
definitions related to Evolving information goals. User ID 1, 2, 4,
5, 6, 8, 9 and 10 are identified to have evolving information goals.</p>
      </sec>
    </sec>
    <sec id="sec-12">
      <title>5.2 Results for Search Strategy</title>
      <p>Now search strategy is a combination of query iterations and
other interaction behaviors. To visualize the interaction behaviors
of users can be seen in Figure 1, Figure 2, Figure 3, Figure 4 and
Figure 5, to understand the search strategy of the users</p>
      <sec id="sec-12-1">
        <title>5.2.1 Cautious Strategy</title>
        <p>In Table 10 User ID 1, 4, 6 and 10 had cautious search
strategy. These users are selected on the basis of maximum
fulfillment of operational definitions to cautious users. First
operational definition is high query iteration as explained in the
above section with explanation of Figure 1 and Figure 2 that how
the query iteration selection process work. In that context of User
ID 1, 2, 4, 5, 6, 8 and 10 have high query iterations it means they
have high number subset, super-set and overlaps. Figure 5 (a)
illustrate the number of clicks per page this explains our second
operational definition, high clicks in other pages compare to first
page. So user ID 4, 6 and 10 belongs to this operational definition.
Higher position link clicked is third operational definition of this
characteristic can be seen in Figure 3 (b) average position of user
clicks. Where User ID 2, 3, 4, 8, 9 and 10 had more clicks in other
links rather than the first link of the page. The user in Figure 3 (b)
cannot be compared with each other but they will be compared
with their own clicks. Large number of pages viewed is fourth
operational definition shown in Figure 5 (b) users with view
number of pages where all users perform on average the same.
Figure 4 (a) explain time spend by the user during search iteration
and quantified by the average time spend by the users. 591
seconds per session is an average below this is low and above is
high on this basis user qualifies the last operational definition.
User ID 1, 3, 6, 7 and 10 spend more time than average so they
are consider Cautious users. On the basis of these analyses the
overall selection of users and selection of users to their
corresponding operational definition can be seen in Table 10.</p>
      </sec>
      <sec id="sec-12-2">
        <title>5.2.2 Risk y Search Strategy</title>
        <p>In Table 11 User ID 5 and 9 qualify the operational definitions
for risky search strategy. First operational definition is less query
iteration User ID 3, 7, 9 have less query iterations it means they
have less number of subset, super-set and overlaps and an
example of these iteration are shown in Figure 1 and Figure 2.
Our second operational definition in Figure 5 (a) can be seen with
fewer clicks in other pages compare to first page. So User ID 1, 2,
3, 5, 6, 7, 8 and 9 belongs to this operational definition. The third
operational definition is low position link clicked can be seen in
Figure 3 (b). Where user ID 1, 5, 6 and 7 had more clicks on first
link so they had less effort. Less number of pages viewed is fourth
operational definition shown in Figure.5 (b) explained before in
the previous section that all of the users preform same on this
operational definition. Figure 4 (a) explain time spend by the user
during search iteration and 591 seconds per session is an average
below this is low so User ID 2, 4, 5, 8 and 9. Spend less time than
average so they are considering cautious with this operational
definition.</p>
        <p>According to the operational definitions of risky search strategy
below selected users falls in this category shown in Table.11.</p>
        <sec id="sec-12-2-1">
          <title>Users ID</title>
        </sec>
        <sec id="sec-12-2-2">
          <title>Risky users</title>
          <p>Low query
iterations
less clicks in other
pages compare to
first page
Lower links
position clicked
Small number of
results pages
viewed
Spend short time</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-13">
      <title>5.3 Results for Evaluation Threshold</title>
      <p>The final phase of search process, at this stage user has to make a
decision to select from one from the results.</p>
      <sec id="sec-13-1">
        <title>5.3.1 Precise Evaluation Threshold</title>
        <p>On the basis of data analysis User ID 4, 5 and 6 are precise in
their selection of result to look in detail let see the data. The first
operational definition can be explained with Figure 1 and Figure 2
as example and User ID 1, 2, 6, 7, and 8 are high history (Back,
back repeat and also fixed jumps) users. Figure 3 (a) show the
comparison of queries with clicks which is our second operational
definition and according to the data User ID 4 and 5 belongs to
this operational definition. The third definition can be explained
with the example of Figure 1 and Figure 2 high query
iterations(subset, super-set and overlaps) and User ID 1, 2, 4, 5, 6,
8, 9 and 10 falls in this operational definition. Figure 5 (a)
illustrates users with higher pages clicks correspond to fourth
operational definition and User ID 4, 8 and 10 belong to this
operational definition. The users of last operational definition are
selected on the basis of their average interaction (query and
clicks) of a user in session. Average interactions is 12 clicks per
session so above 12 clicks per session user belong to this
definition with the User ID 4, 5, 6, 7 and 8 shown in Figure 4 (b).
After analyzing the definition one by one the overall selection can
be seen in Table 12.</p>
      </sec>
      <sec id="sec-13-2">
        <title>Weak evaluation threshold</title>
        <p>User ID 3, 9 and 10 have weak evaluation threshold according to
their operational definitions. User ID 3, 4, 5, 9 and 10 are low
history users and satisfy our first operat ional definition.
According to Figure 3 (a) User ID 1, 2, 3, 6, 7, 8, 9 and 10,
belongs to our second operational definition low clicks compare
to queries. The third definition can be explained with the example
of Figure 1 and Figure 2 low query iterations (subset, super-set
and overlaps) and User ID 3 and 7 falls to t his operational
definition. In Figure 5 (a) User ID 1, 2, 3, 5, 6, 7 and 9 have low
number of pages clicks and satisfy the forth operational definition.
The average interaction (query and clicks) are 12 clicks per
session. So the users perform below this interaction is low. User
ID 1, 2, 3, 9 and 10 are low interaction users shown in Figure 3
(b). The users along with their operational definitions and selected
users with weak evaluation threshold can be seen in table.13.</p>
      </sec>
    </sec>
    <sec id="sec-14">
      <title>6. DISCUSSION</title>
      <p>The above results explain the validation of EISE model and
show the existence of behaviors in user information seeking.
Although the model is validated to an extent but still some
concern can be raised about the operational definition. Up to now
reduced numbers of operational definitions are used from the
model because of available data limitation. Further study will
extend the operational definitions to fully make use the
psychology theories in the model. For example in search strategy
an operational definition high standards/relevance occurs but from
the current data we cannot judge this operational definition. In
evaluation threshold operational definition high source credibility
and high resemblance cannot be extracted from the data. To solve
this problem new experiment in a control environment will take
place to make use of all the operational definition and build a
comprehensive model.</p>
      <p>According to the operational definition users fall in the same
categories but to fully absorb the characteristics of the model the
user needs to qualify maximum operational definitions. For
example in Search Strategy, Cautious User ID 1, 4, 6 and 10 and
Risky User ID 5 and 9 can be seen but User ID 2, 3, 7 and 8 are
missing they do not qualify maximum operational definition of
the characteristics.. The same result can see in evaluation
threshold that User ID 1, 2, 7 and 8 missing they do not qualifies
maximum operational definitions. Now a detail investigation is
needed to create a new characteristic for these users if they do not
fall in the above categories</p>
      <p>The results show the existence of characteristics
independently from each other. Further study will also investigate
the relation between these characteristics with each other’s and
the effect of information goals on search strategy and evaluation
threshold and vice versa.</p>
    </sec>
    <sec id="sec-15">
      <title>7. CONCLUSION</title>
      <p>In this paper we present a user classification model for
personalized information retrieval. In the previous studies models
lack a theoretical background to personalize the search. In our
study we build a model based on strong psychological theories to
address human behavioral aspect and interpret those theories into
information retrieval terminology. The proposed model is EISE
(extended Information goal, Search strategy and Evaluation
threshold) adapted from a model applied in CBIR (content based
image retrieval). Enriching the model with the theories and
applying on search data log we established the existing of those
behaviors which we hypnotized in our model. On the basis of
these behaviors we can build a personalized search to enhance
user information seeking ability.</p>
    </sec>
    <sec id="sec-16">
      <title>8. REFERENCES</title>
      <p>[1] Azure. DISC based personality assessment.</p>
      <p>http://www.amazureconsulting.com/files/1/74900324
/DISCPastAndPresentAndWilliamMarston.pdf, 2011.</p>
      <p>Accessed: 23 Dec. 2015.
[2] P. N. Bennett, R. W. White, W. Chu, S. T. Dumais, P.</p>
      <p>Bailey, F. Borisyuk, and X. Cui. M odeling the impact of
short- and long-term behavior on search personalization. In
Proceedings of the 35th International Conference on
Research and Development in Information Retrieval (SIGIR),
pages 185–194, 2012.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>H.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liao</surname>
          </string-name>
          , E. Chen, and
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          .
          <article-title>Context-aware query suggestion by mining click-through and session data</article-title>
          .
          <source>In Proceedings of the 14th International Conference on Knowledge Discovery and Data Mining</source>
          ,
          <source>(SIGKDD)</source>
          , pages
          <fpage>875</fpage>
          -
          <lpage>883</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          https://www.discprofile.com/what-isdisc/overview/ conscientiousness/,
          <year>2011</year>
          . Accessed:
          <volume>23</volume>
          Dec.
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C. S.</given-names>
            <surname>Dweck. M indset:</surname>
          </string-name>
          <article-title>The new psychology of success</article-title>
          .
          <source>Random House</source>
          , New York,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>ELLIS</surname>
          </string-name>
          .
          <article-title>A behavioural approach to information retrieval system design</article-title>
          .
          <source>Journal of Documentation</source>
          ,
          <volume>45</volume>
          (
          <issue>3</issue>
          ):
          <fpage>171</fpage>
          -
          <lpage>212</lpage>
          ,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R.</given-names>
            <surname>Gigerenzer</surname>
          </string-name>
          , Gerd; Selten. Bounded Rationality:
          <article-title>The Adaptive Toolbox</article-title>
          . M IT Press,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>P.</given-names>
            <surname>Ingwwrsen</surname>
          </string-name>
          .
          <article-title>Cognitive perspectives of information retrieval interaction: Elements of a cognitive ir theory</article-title>
          .
          <source>Journal of Documentation</source>
          ,
          <volume>52</volume>
          (
          <issue>1</issue>
          ):
          <fpage>3</fpage>
          -
          <lpage>50</lpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. W. T.</given-names>
            <surname>Leung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vosecky</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W.</given-names>
            <surname>Ng</surname>
          </string-name>
          .
          <article-title>Personalized query suggestion with diversity awareness</article-title>
          .
          <source>In Proceedings of the 37th International Conference on Research and Development (SIGIR)</source>
          , pages
          <fpage>400</fpage>
          -
          <lpage>411</lpage>
          .
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>D.</given-names>
            <surname>Jiang</surname>
          </string-name>
          , K. W.-T. Leung,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W.</given-names>
            <surname>Ng</surname>
          </string-name>
          .
          <article-title>Query suggestion with diversification and personalization</article-title>
          .
          <source>Knowledge-Based Systems</source>
          ,
          <volume>89</volume>
          :
          <fpage>553</fpage>
          -
          <lpage>568</lpage>
          , nov
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>L.</given-names>
            <surname>Jingfei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dawei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hou</surname>
          </string-name>
          .
          <article-title>How different features contribute to the session search</article-title>
          .
          <source>In Proceeding of 4th CCF Natural Language Processing and Chinese Computing (NLPCC)</source>
          , pages
          <fpage>242</fpage>
          -
          <lpage>253</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>C. S.</given-names>
            <surname>Jones</surname>
          </string-name>
          and
          <string-name>
            <given-names>N. T.</given-names>
            <surname>Hartley</surname>
          </string-name>
          .
          <article-title>Comparing correlations between four-quadrant and five-factor personality assessments</article-title>
          .
          <source>American Journal of Business Education (AJBE)</source>
          ,
          <volume>6</volume>
          (
          <issue>4</issue>
          ),
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kim</surname>
          </string-name>
          and
          <string-name>
            <given-names>W. B.</given-names>
            <surname>Croft</surname>
          </string-name>
          .
          <article-title>Diversifying query suggestions based on query documents</article-title>
          .
          <source>In Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR)</source>
          , pages
          <fpage>891</fpage>
          -
          <lpage>894</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [14]
          <string-name>
            <surname>C. C.</surname>
          </string-name>
          <article-title>Kuhlthau. Inside the search process: Information seeking from the user's perspective</article-title>
          .
          <source>Journal of the American Society for Information Science</source>
          ,
          <volume>42</volume>
          (
          <issue>5</issue>
          ):
          <fpage>361</fpage>
          -
          <lpage>371</lpage>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>K. W. T.</given-names>
            <surname>Leung</surname>
          </string-name>
          and
          <string-name>
            <given-names>D. L.</given-names>
            <surname>Lee</surname>
          </string-name>
          .
          <article-title>Deriving concept-based user profiles from search engine logs</article-title>
          .
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          ,
          <volume>22</volume>
          (
          <issue>7</issue>
          ):
          <fpage>969</fpage>
          -
          <lpage>982</lpage>
          ,
          <year>July 2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M .</given-names>
            <surname>Kitsuregawa</surname>
          </string-name>
          .
          <article-title>Dynamic adaptation strategies for long-term and short-term user profile to personalize search</article-title>
          .
          <source>In Proceedings of the Joint 9th Asia-Pacific Web and 8th International Conference on Webage Information Management Conference on Advances in Data and Web Management</source>
          , pages
          <fpage>228</fpage>
          -
          <lpage>240</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>H.</given-names>
            <surname>Liu</surname>
          </string-name>
          , P. M ulholland,
          <string-name>
            <given-names>D.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Uren</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Ruger</surname>
          </string-name>
          .
          <article-title>Applying information foraging theory to understand user interaction with content-based image retrieval</article-title>
          .
          <source>In Proceedings of the Third Symposium on Information Interaction in Context (IIiX)</source>
          , pages
          <fpage>135</fpage>
          -
          <lpage>144</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Z. M a</surname>
          </string-name>
          , G. Pant, and
          <string-name>
            <given-names>O. R. L.</given-names>
            <surname>Sheng</surname>
          </string-name>
          .
          <article-title>Interest-based personalized search</article-title>
          .
          <source>Transactions on Information Systems (ACM)</source>
          ,
          <volume>25</volume>
          (
          <issue>1</issue>
          ), feb
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [19]
          <string-name>
            <surname>W. M .</surname>
          </string-name>
          <article-title>M arston. Emotions of Normal People</article-title>
          . Routledge, London,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>G.</given-names>
            <surname>Nenkov</surname>
          </string-name>
          ,
          <string-name>
            <surname>M .</surname>
          </string-name>
          <article-title>M orrin, A</article-title>
          .
          <string-name>
            <surname>Ward</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Schwartz</surname>
            , and
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Hulland</surname>
          </string-name>
          .
          <article-title>A short form of the maximization scale: Factor structure, reliability and validity studies</article-title>
          .
          <source>Judgment and Decision Making</source>
          ,
          <volume>3</volume>
          (
          <issue>5</issue>
          ):
          <fpage>371</fpage>
          -
          <lpage>388</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [21]
          <string-name>
            <surname>G. Pasi.</surname>
          </string-name>
          <article-title>Issue in personalizing information retrieval</article-title>
          .
          <source>Intelligent Informatics Bulletin</source>
          ,
          <volume>11</volume>
          (
          <issue>1</issue>
          ):
          <fpage>3</fpage>
          -
          <lpage>7</lpage>
          ,
          <year>December 2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>P.</given-names>
            <surname>Pirolli</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Card</surname>
          </string-name>
          .
          <article-title>Information foraging in information access environments</article-title>
          .
          <source>In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems</source>
          ,
          <source>pages (CHI)</source>
          ,
          <fpage>51</fpage>
          -
          <lpage>58</lpage>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>P.</given-names>
            <surname>Pirolli</surname>
          </string-name>
          and
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Card</surname>
          </string-name>
          . Information foraging.
          <source>Psychological Review</source>
          ,
          <volume>106</volume>
          (
          <issue>6</issue>
          ):
          <fpage>643</fpage>
          -
          <lpage>675</lpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>G. H.</given-names>
            <surname>Pyke</surname>
          </string-name>
          .
          <article-title>Optimal foraging theory: A critical review</article-title>
          .
          <source>Annual Review of Ecology and Systematics</source>
          ,
          <volume>15</volume>
          :
          <fpage>523</fpage>
          -
          <lpage>575</lpage>
          ,
          <year>1984</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>A.</given-names>
            <surname>Schwartz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ward</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>M onterosso,</article-title>
          K. Lyubomirsky,
          <string-name>
            <given-names>S.</given-names>
            and
            <surname>White</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Lehman</surname>
          </string-name>
          .
          <article-title>M aximizing versus satisficing: Happiness is a matter of choice</article-title>
          .
          <source>Journal of Personality and Social Psychology</source>
          ,
          <volume>83</volume>
          (
          <issue>5</issue>
          ):
          <fpage>1178</fpage>
          -
          <lpage>1197</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>D.</given-names>
            <surname>Sontag</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Collins-Thompson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. N.</given-names>
            <surname>Bennett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. W.</given-names>
            <surname>White</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dumais</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Billerbeck</surname>
          </string-name>
          .
          <article-title>Probabilistic models for personalizing web search</article-title>
          .
          <source>In Proceedings of ACM International Conference on Web Search and Data Mining (WSDM)</source>
          pages
          <fpage>433</fpage>
          -
          <lpage>442</lpage>
          .,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>J.</given-names>
            <surname>Teevan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. T.</given-names>
            <surname>Dumais</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Horvitz</surname>
          </string-name>
          .
          <article-title>Beyond the commons: Investigating the value of personalizing web search</article-title>
          .
          <source>In Proceedings of the Workshop on New Technologies for Personalized Information Access</source>
          , pages
          <fpage>84</fpage>
          -
          <lpage>92</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>P.</given-names>
            <surname>Thomas</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          <article-title>M offat, P</article-title>
          . Bailey, and
          <string-name>
            <given-names>F.</given-names>
            <surname>Scholer</surname>
          </string-name>
          .
          <article-title>M odeling decision points in user search behavior</article-title>
          .
          <source>In Proceedings of the 5th Information Interaction in Context Symposium (IIiX)</source>
          , pages
          <fpage>239</fpage>
          -
          <lpage>242</lpage>
          .,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>S.</given-names>
            <surname>Verberne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M .</given-names>
            <surname>Sappelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Jarvelin</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W.</given-names>
            <surname>Kraaij</surname>
          </string-name>
          .
          <article-title>User simulations for interactive search: Evaluating personalized query suggestion</article-title>
          .
          <source>In Proceeding of the 37th Conference on IR Research (ECIR)</source>
          , pages
          <fpage>768</fpage>
          -
          <lpage>690</lpage>
          .,
          <string-name>
            <surname>April</surname>
          </string-name>
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>E.</given-names>
            <surname>Werner</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Hall</surname>
          </string-name>
          .
          <article-title>Optimal foraging and the size selection of prey by the bluegill sunfish (lepomis macrochirus)</article-title>
          .
          <source>Ecology</source>
          ,
          <volume>55</volume>
          (
          <issue>5</issue>
          ):
          <fpage>1042</fpage>
          -
          <lpage>1052</lpage>
          ,
          <year>1974</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>R.</given-names>
            <surname>White</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. N.</given-names>
            <surname>Bennett</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Dumais</surname>
          </string-name>
          .
          <article-title>Predicting short - term interests using activity -based search contexts</article-title>
          .
          <source>In Proceedings of the 19th ACM International Conference on Information and Knowledge Management (CIKM)</source>
          , pages
          <fpage>1009</fpage>
          -
          <lpage>1018</lpage>
          ,
          <year>Oct 2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>T.</given-names>
            <surname>Wilson</surname>
          </string-name>
          .
          <article-title>On user studies and information needs</article-title>
          .
          <source>Journal of Documentation</source>
          ,
          <volume>37</volume>
          (
          <issue>1</issue>
          ):
          <fpage>3</fpage>
          -
          <lpage>15</lpage>
          ,
          <year>1981</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>T.</given-names>
            <surname>Wilson</surname>
          </string-name>
          .
          <article-title>M odels in information behaviour research</article-title>
          .
          <source>Journal of Documentation</source>
          ,
          <volume>55</volume>
          (
          <issue>3</issue>
          ):
          <fpage>249</fpage>
          -
          <lpage>270</lpage>
          ,
          <year>1999</year>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>