<!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>Evaluation of Digital Library Services Using Complementary Logs¤</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Maristella Agostii</string-name>
          <email>agosti@dei.unipd.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Franco Crivellari</string-name>
          <email>crive@dei.unipd.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giorgio Maria Di Nunzio</string-name>
          <email>dinunzio@dei.unipd.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Padua</institution>
          ,
          <addr-line>Via Gradenigo 6/a, 35131, Padua</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In recent years, the importance of log analysis has grown, log data constitute a relevant aspect in the evaluation process of the quality of a digital library system. In this paper, we address the problem of log analysis for complex systems such as digital library systems, and how the analysis of search query logs or Web logs is not su±cient to study users and interpret their preferences. In fact the combination of implicitly and explicitly collected data improves understanding of behavior with respect to the understanding that can be gained by analyzing the sets of data separately.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Web Log</kwd>
        <kwd>Search Log</kwd>
        <kwd>User Study</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>The interaction between the user and an information access
system can be analyzed and studied to gather user
preferences and to \learn" what the user likes the most, and to use
this information to personalize the presentation of results.
User preferences can be learned explicitly, for example
asking the user to ¯ll-in questionnaires, or implicitly, by
studying the actions of the user which are recorded in the search
log of a system. The second choice is certainly less intrusive
but requires more e®ort to reconstruct each search session a
user made in order to learn his preferences.
¤Copyright is held by the author/owner(s).</p>
      <p>SIGIR'09, July 19-23, 2009, Boston, USA.</p>
      <p>Log is a concept commonly used in computer science; in
fact, log data are collected by programs to make a permanent
record of events during their usage. The log data can be used
to study the usage of a speci¯c application, and to better
adapt it to the objectives the users were expecting to reach.
In the context of the Web, the storage and the analysis of
Web log ¯les are mainly used to gain knowledge on the users
and improve the services o®ered by a Web portal, without
the need to bother the users with the explicit collection of
information.</p>
      <p>
        When research addresses the problem of studying log data
in digital libraries, which are very complex systems,
di®erent characteristics regarding library automation systems and
digital library systems need to be taken into account. In fact,
for all the di®erent categories of users of a digital library
system, the quality of services and documents the digital library
supplies are very important. Log data constitute a relevant
aspect in the evaluation process of the quality of a digital
library system and of the quality of interoperability of digital
library services [
        <xref ref-type="bibr" rid="ref18 ref2">2, 18</xref>
        ]. With this concept in mind, it is also
possible to think about new di®erent logging formats which
re°ect how a generic DL system behaves [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>This paper deals with the study of complementary types of
logs in complex systems with the aim of ¯nding new ways
of using them to evaluate and personalize digital library
services for the ¯nal users. The paper is organized as follows:
Section 2 presents previous related work, Section 3 analyzes
and presents di®erent facets of the study and use of logs of
complex systems, Section 4 presents the ¯ndings of the case
study conducted in the context of the TELplus project1 for
the evaluation and personalization of the services of The
European Library, and lastly Section 5 draws conclusions and
indicates directions for the continuation of the work.</p>
    </sec>
    <sec id="sec-2">
      <title>2. RELATED WORK</title>
      <p>In the last decade, log analysis has become one of the main
threads of research for understanding users of search engines
as shown by the works presented at three major relevant
conferences and that have been analyzed by us2.
Those works study logs in di®erent ways and for di®erent</p>
      <sec id="sec-2-1">
        <title>1http://www.theeuropeanlibrary.org/telplus/</title>
        <p>2The three analyzed major conferences are:
SIGIR - http://www.sigir.org/
WWW - http://www.iw3c2.org/
JCDL - http://www.jcdl.org/
purposes, but they can be divided into two main classes:
studies about search query logs, and studies about Web
server logs. Since most of these research papers concern
search engines, the focus of their research is more on
improving queries and results and less on sur¯ng the Web. The few
exceptions to this classi¯cation will be analyzed later in the
paper.</p>
        <p>
          Query search logs can be used for: building knowledge, such
as automatically building a search thesaurus [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], or
acquiring ontological knowledge [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]; re¯ning and expanding
queries by means of analysis of search logs [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], or by means of
correlations between query terms and document terms based
on search query logs [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]; comparing of query extension
techniques with pseudo-relevance feedback techniques [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ];
organizing search results [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ]; studying temporal changes and
relationships, such as changes of queries on hourly basis in
order to understand how user preferences change over time [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ],
analysis of multitasking user searches [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], issues related to
ambiguity and freshness of queries [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ], studies of causal
relations between queries [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ]; mining queries for extracting
news-related queries [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], and association rules to discover
related queries [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ], or fast query recommendations [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ].
Web logs can be used for: improving rank of results by
replacing the adjacency matrix of the HITS algorithm with a
link matrix which weights connections between nodes based
on the usage data from Web server log tra±c [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]; matching
website organization with visitor expectations by means of
Web log analysis [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ]; ¯nding user navigational patterns [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ];
agents' detection [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
        </p>
        <p>
          There is also a recent emerging research activity about log
analysis which tackles cross-lingual issues: [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] extends the
notion of query suggestion to cross-lingual query suggestion
studying search query logs; [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] leverages click-through data
to extract query translation pairs. The interest in
multilingual log analysis is also con¯rmed by initiatives promoted
by the TrebleCLEF3 coordination action which supports the
development and consolidation of expertise in the
multidisciplinary research area of multilingual information access
(MLIA).
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. LOGS OF COMPLEX SYSTEMS</title>
      <p>
        Present digital library systems are complex software
systems, often based on a service-oriented architecture, able to
manage complex and diversi¯ed collections of digital objects.
One signi¯cant aspect that still relates present systems to
the old ones is that the representation of the content of the
digital objects that constitute the collection of interest is
still done by professionals. This means that the
management of metadata can still be based on the use of authority
control rules in describing author, place names and other
relevant catalogue data. A digital library system can exploit
authority data that keep lists of preferred or accepted forms
of names and all other relevant headings. This is a
dramatic di®erence between digital library systems and search
engines, and it is usually overcome with the analysis of log
data. In fact a search engine often becomes a speci¯c
component of a digital library system, when the digital library
system faces the management and search of digital objects
3http://www.trebleclef.eu/
by content in the same manner as information retrieval
systems and search engines [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. In all other types of searches,
either the digital library system makes use of authority data
to respond to ¯nal users in a more consistent and coherent
way through a search system that is a sort of a new
generation of online public access catalogue (OPAC) system, or
the system supports the full content search with a service
that gives the ¯nal users the facilities of a search engine.
Search query logs or Web logs alone give only a partial view
of the stream of information that users produce. [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] show
how to combine two di®erent streams of data, search query
logs and click-streams, in order to analyze re-¯nding
behavior of a group of users under observation for a period of one
year.
      </p>
      <p>
        Moreover, log analysis can be supported and validated by
user studies which are a valuable method for understanding
user behavior in di®erent situations. User studies require
a signi¯cant amount of time and e®ort, so an accurate
design of the process has to be carried out. In general, user
studies and logs are used in a separate way, since they are
adopted with di®erent aims in mind. Ingwersen and JaÄrvelin
report in [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] that it seems more scienti¯cally informative to
combine logs together with observation in naturalistic
settings. Pharo and JaÄrvelin in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] suggest systematic use of
the triangulation of di®erent data collection techniques as
a general approach in order to get better knowledge of the
Web information search process. An example of this type of
combined studies is [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], where that authors claim that fully
understanding user satisfaction and user intent requires a
depth of data unavailable in search query logs but possible
to acquire from other sources of data, such as one-on-one
studies or instrumented panels.
      </p>
      <p>The combination of implicitly and explicitly collected data
improves understanding of behavior with respect to the
understanding that can be gained by analyzing the sets of data
separately. In particular for digital libraries, where the
evaluation of the di®erent services is di±cult if logs are used
alone, the combined sets of data provide the opportunity
of reaching insights towards user personalization of digital
library services.</p>
      <p>From this starting point we have developed a method for
collecting data derived from the user interaction log, \implicit"
data, and data collected from user questionnaires, \explicit"
data, for analyzing the interaction between users and digital
libraries. This means that the conceived method is based on
the combination and analysis of the following data sources:
HTTP log which contains the HTTP requests sent by the
Web client to the Web server during a user browsing session;
search log which contains the actions performed by the user
during a search; questionnaire data which are collected at
the end of a user browsing and searching session.
The possibility of studying and correlating di®erent sources
of data was envisaged during the study of the Web portal of
The European Library4, which provides a vast virtual
collection of material from all disciplines and o®ers interested
visitors simple access to European cultural heritage.</p>
      <sec id="sec-3-1">
        <title>4http://www.theeuropeanlibrary.org/</title>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. RESULTS OF THE CASE STUDY</title>
      <p>The European Library is a free service that o®ers access to
the resources of 48 national libraries of Europe in 20
languages with about 150 million entries across Europe. The
European Library provides a vast virtual collection of
material from all disciplines and o®ers interested visitors simple
access to European cultural heritage.</p>
      <p>To validate the proposed method, a study was conducted in
a controlled setting at the end of 2007 { beginning of 2008, in
the computer laboratories of di®erent faculties of the
University of Padua, Italy, where students were requested to
conduct a free navigation and search for information on The
European Library portal and to ¯ll in a questionnaire
specifically designed to harvest the data that can be used to
extract information on users satisfaction on the use of di®erent
parts of the portal. A total of 155 students participated in
the study, mostly Italians, equally distributed between males
and females, and with an age range typical of students of
Bachelor and Master Degree (in most cases between 19 and
25 years old).</p>
      <p>
        The analysis of the results was done in the following order:
the analysis of each stream of data - i.e. HTTP log, search
query log, questionnaires - was ¯rst conducted, while the
analysis of possible interrelation among these sources was
conducted later. The description of the analysis of each
single stream is reported in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], here we concentrate on the
aspects which emerge from the correlation of the di®erent
sources of information.
      </p>
      <p>Table 1 summarizes one of the important features when
doing log analysis: session length. In particular, the table
shows how di®erent these lengths are according to the source
that is analyzed. The \Search log" column shows the
statistics of the times, in minutes, of sessions found in the search
logs, and between brackets the times of sessions of users
who registered to the portal. This shows that logging on
is a clear intention of users who are willing to spend time
in the portal and search more, compared to random users.
The \HTTP log" column shows the times of sessions found
in the HTTP logs computed in October 2007, and between
brackets the times of the sessions of users who participated
in the user study at the University of Padua. In this case,
there is a strong bias of the students of the user study due
to the time slot which was about 30/45 minutes. The times
of random users are comparable to those found in the search
logs. The last column shows the times of sessions for
¯llingin the questionnaires, which are obviously very similar to
the times of HTTP sessions of the user study. There is one
important aspect which emerges from the data: sessions are
very short, browsing and searching activity lasts less than 2
minutes in 50% of the cases. This particular situation can be
explained only by studying the answers of the users to the
questionnaire where there are clear indications about some
di±culties they found in understanding how to read the list
of the results, and how to use some functions of the
interface. These are also the reasons why they would have left
the portal sooner if they had not been asked to stay and ¯ll
in the questionnaire.</p>
      <p>An important interrelation was found among questionnaires
and log data which may explain the short length of a user
session. One of the outcomes of the questionnaire was the
disorientation of the user upon entering The European Library
portal for the ¯rst time, in particular it seems not to be clear
what kind of information can be accessed through this
portal. Users are in general ready to search in a Google-like
fashion and obtain documents, in terms of links to pages
or documents online, in the case of The European Library
they are essentially in front of an online public access
catalogue which retrieves bibliographic records. Obtaining
library catalogue records after a search is a source of confusion
which leaves the user unhappy and willing to leave the portal
quickly.</p>
      <p>Questionnaires also show that images in particular seem to
be very appealing for users; both the \treasures" section, a
section which shows high resolution images of ancient
documents, and the \exhibition" section, a section which shows
pictures of the national libraries buildings, were thoroughly
browsed by users even before making any query in the
portal. This is an important clue which may suggest that there
should be more linking from the images to the catalogue
records. The interrelation among the information about
users who prefer images and the HTTP log and searches
log is still under investigation. In fact, we would like to
see if this willingness expressed in the questionnaire is also
re°ected in user actions: for example, a user who is
interested in images clicks more frequently on images or search
for documents like maps or paintings; or a user expresses
this interest in images but actually does not perform any
action in the portal which con¯rms this interest.</p>
    </sec>
    <sec id="sec-5">
      <title>5. CONCLUSIONS</title>
      <p>The insights gained by analyzing log data together with data
from controlled studies are more informative than the results
that can be derived by separately analyzing the groups of
data. Our studies on logs combined with interviews have
shown that the results are more scienti¯cally informative
than those obtained when the two types of studies are
conducted alone. This encouraging result constitutes the ground
on which we are generalizing and formalizing starting from
the obtained results. A crucial feature in the future will be
making active use also of the information on metadata that
are present in the log, because until now no active way of
using them has been incorporated in the proposed method.</p>
    </sec>
    <sec id="sec-6">
      <title>6. ACKNOWLEDGEMENTS</title>
      <p>The work has been partially supported by the TELplus
Targeted Project for digital libraries, as part of the eContentplus
Program of the EC, and by the TrebleCLEF Coordination
Action, as part of the 7FP of the EC.
7.</p>
    </sec>
    <sec id="sec-7">
      <title>REFERENCES</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Agosti</surname>
          </string-name>
          , editor.
          <source>Information access through search engines and digital libraries</source>
          . Springer, Berlin, Germany,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Agosti</surname>
          </string-name>
          .
          <article-title>Log data in digital libraries</article-title>
          . In M. Agosti,
          <string-name>
            <given-names>F.</given-names>
            <surname>Esposito</surname>
          </string-name>
          , and C. Thanos, editors,
          <source>IRCDL</source>
          , pages
          <volume>115</volume>
          {
          <fpage>122</fpage>
          .
          <string-name>
            <surname>DELOS</surname>
          </string-name>
          <article-title>: an Association for Digital Libraries</article-title>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Agosti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Crivellari</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G. M. Di</given-names>
            <surname>Nunzio</surname>
          </string-name>
          .
          <article-title>A method for combining and analyzing implicit interaction data and explicit preferences of users</article-title>
          . Workshop on Contextual Information Access,
          <article-title>Seeking and Retrieval Evaluation (ECIR</article-title>
          <year>2009</year>
          ),
          <year>April 2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>P. G.</given-names>
            <surname>Anick</surname>
          </string-name>
          .
          <article-title>Using terminological feedback for web search re¯nement: a log-based study</article-title>
          .
          <source>In SIGIR</source>
          , pages
          <volume>88</volume>
          {
          <fpage>95</fpage>
          . ACM,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Beitzel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. C.</given-names>
            <surname>Jensen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chowdhury</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Grossman</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O.</given-names>
            <surname>Frieder</surname>
          </string-name>
          .
          <article-title>Hourly analysis of a very large topically categorized web query log</article-title>
          . In M. Sanderson, K. JaÄrvelin, J. Allan, and P. Bruza, editors,
          <source>SIGIR</source>
          , pages
          <volume>321</volume>
          {
          <fpage>328</fpage>
          . ACM,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>N.</given-names>
            <surname>Buzikashvili</surname>
          </string-name>
          .
          <article-title>An exploratory web log study of multitasking</article-title>
          . In Efthimiadis et al. [
          <volume>12</volume>
          ], pages
          <fpage>623</fpage>
          {
          <fpage>624</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Buzikashvili</surname>
          </string-name>
          .
          <article-title>Sliding window technique for the web log analysis</article-title>
          .
          <source>In Williamson et al. [31]</source>
          , pages
          <fpage>1213</fpage>
          {
          <fpage>1214</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>L.</given-names>
            <surname>Carr</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. D.</given-names>
            <surname>Roure</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Iyengar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. A.</given-names>
            <surname>Goble</surname>
          </string-name>
          , and M. Dahlin, editors.
          <source>Proceedings of the 15th international conference on World Wide Web, WWW</source>
          <year>2006</year>
          , Edinburgh, Scotland, UK, May
          <volume>23</volume>
          -26,
          <year>2006</year>
          . ACM,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          and
          <string-name>
            <given-names>T.</given-names>
            <surname>Cook</surname>
          </string-name>
          .
          <article-title>Mining contiguous sequential patterns from web logs</article-title>
          .
          <source>In Williamson et al. [31]</source>
          , pages
          <fpage>1177</fpage>
          {
          <fpage>1178</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>S.-L.</given-names>
            <surname>Chuang</surname>
          </string-name>
          , H.-T. Pu,
          <string-name>
            <given-names>W.-H.</given-names>
            <surname>Lu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.-F.</given-names>
            <surname>Chien</surname>
          </string-name>
          .
          <article-title>Auto-construction of a live thesaurus from search term logs for interactive web search</article-title>
          .
          <source>In SIGIR</source>
          , pages
          <volume>334</volume>
          {
          <fpage>336</fpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>H.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-R.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-Y.</given-names>
            <surname>Nie</surname>
          </string-name>
          , and W.-Y. Ma.
          <article-title>Probabilistic query expansion using query logs</article-title>
          .
          <source>In WWW 2002</source>
          , pages
          <fpage>325</fpage>
          {
          <fpage>332</fpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>E. N.</given-names>
            <surname>Efthimiadis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. T.</given-names>
            <surname>Dumais</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hawking</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          K. JaÄrvelin, editors.
          <source>SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , Seattle, Washington, USA,
          <year>2006</year>
          . ACM,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>W.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Niu</surname>
          </string-name>
          , J.-Y. Nie,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.-F. Wong</surname>
            , and
            <given-names>H.-W.</given-names>
          </string-name>
          <string-name>
            <surname>Hon</surname>
          </string-name>
          .
          <article-title>Cross-lingual query suggestion using query logs of di®erent languages</article-title>
          .
          <source>In Kraaij et al. [19]</source>
          , pages
          <fpage>463</fpage>
          {
          <fpage>470</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>A</article-title>
          . Gonc»alves, G. Panchanathan,
          <string-name>
            <given-names>U.</given-names>
            <surname>Ravindranathan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Krowne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. A.</given-names>
            <surname>Fox</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Jagodzinski</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L. N.</given-names>
            <surname>Cassel</surname>
          </string-name>
          .
          <article-title>The xml log standard for digital libraries: Analysis, evolution, and deployment</article-title>
          .
          <source>In JCDL</source>
          , pages
          <volume>312</volume>
          {
          <fpage>314</fpage>
          . IEEE Computer Society,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>C.</given-names>
            <surname>Grimes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D. M.</given-names>
            <surname>Russell</surname>
          </string-name>
          .
          <article-title>Query logs alone are not enough</article-title>
          . In E. Amitay and
          <string-name>
            <surname>C. G. M. J</surname>
          </string-name>
          . Teevan, editors,
          <source>Query Log Analysis: Social And Technological Challenges. A workshop at the 16th International World Wide Web Conference (WWW</source>
          <year>2007</year>
          ), May
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>R.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yang</surname>
          </string-name>
          .
          <article-title>Web query translation via web log mining</article-title>
          . In S.
          <string-name>
            <surname>-H. Myaeng</surname>
            ,
            <given-names>D. W.</given-names>
          </string-name>
          <string-name>
            <surname>Oard</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Sebastiani</surname>
          </string-name>
          , T.-S. Chua, and M.
          <article-title>-</article-title>
          K. Leong, editors,
          <source>SIGIR</source>
          , pages
          <volume>749</volume>
          {
          <fpage>750</fpage>
          . ACM,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>P.</given-names>
            <surname>Ingwersen</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>JaÄrvelin. The Turn</surname>
          </string-name>
          . Springer, The Netherlands,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>T.</given-names>
            <surname>Koch</surname>
          </string-name>
          , A. ArdoÄ, and
          <string-name>
            <given-names>K.</given-names>
            <surname>Golub</surname>
          </string-name>
          .
          <article-title>Browsing and searching behavior in the renardus web service a study based on log analysis</article-title>
          . In H. Chen,
          <string-name>
            <given-names>H. D.</given-names>
            <surname>Wactlar</surname>
          </string-name>
          , C. chih
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>E.-P.</given-names>
          </string-name>
          <string-name>
            <surname>Lim</surname>
          </string-name>
          , and M. G. Christel, editors,
          <source>JCDL, page 378. ACM</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>W.</given-names>
            <surname>Kraaij</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. P. de Vries</surname>
            ,
            <given-names>C. L. A.</given-names>
          </string-name>
          <string-name>
            <surname>Clarke</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Fuhr</surname>
          </string-name>
          , and N. Kando, editors.
          <source>SIGIR 2007: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , Amsterdam, The Netherlands,
          <source>July 23-27</source>
          ,
          <year>2007</year>
          . ACM,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>M.</given-names>
            <surname>Maslov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Golovko</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Segalovich</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Braslavski</surname>
          </string-name>
          .
          <article-title>Extracting news-related queries from web query log</article-title>
          .
          <source>In Carr et al. [8]</source>
          , pages
          <fpage>931</fpage>
          {
          <fpage>932</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>J. C.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Rae</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Schaefer</surname>
          </string-name>
          .
          <article-title>Modi¯cations of kleinberg's hits algorithm using matrix exponentiation and weblog records</article-title>
          . In W. B.
          <string-name>
            <surname>Croft</surname>
            ,
            <given-names>D. J.</given-names>
          </string-name>
          <string-name>
            <surname>Harper</surname>
            ,
            <given-names>D. H.</given-names>
          </string-name>
          <string-name>
            <surname>Kraft</surname>
          </string-name>
          , and J. Zobel, editors,
          <source>SIGIR</source>
          , pages
          <volume>444</volume>
          {
          <fpage>445</fpage>
          . ACM,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>J.</given-names>
            <surname>Parikh</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Kapur</surname>
          </string-name>
          .
          <article-title>Unity: relevance feedback using user query logs</article-title>
          .
          <source>In Efthimiadis et al. [12]</source>
          , pages
          <fpage>689</fpage>
          {
          <fpage>690</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>N.</given-names>
            <surname>Pharo</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>JaÄrvelin.</surname>
          </string-name>
          <article-title>The SST method: a tool for analysing Web information search processes</article-title>
          .
          <source>Information Processing &amp; Management</source>
          ,
          <volume>40</volume>
          (
          <issue>4</issue>
          ):
          <volume>633</volume>
          {
          <fpage>654</fpage>
          ,
          <year>July 2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>S.</given-names>
            <surname>Sekine</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Suzuki</surname>
          </string-name>
          .
          <article-title>Acquiring ontological knowledge from query logs</article-title>
          .
          <source>In Williamson et al. [31]</source>
          , pages
          <fpage>1223</fpage>
          {
          <fpage>1224</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>X.</given-names>
            <surname>Shi</surname>
          </string-name>
          and
          <string-name>
            <given-names>C. C.</given-names>
            <surname>Yang</surname>
          </string-name>
          .
          <article-title>Mining related queries from search engine query logs</article-title>
          .
          <source>In Carr et al. [8]</source>
          , pages
          <fpage>943</fpage>
          {
          <fpage>944</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>R.</given-names>
            <surname>Srikant</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          .
          <article-title>Mining web logs to improve website organization</article-title>
          .
          <source>In WWW 2001</source>
          , pages
          <fpage>430</fpage>
          {
          <fpage>437</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>Causal relation of queries from temporal logs</article-title>
          .
          <source>In Williamson et al. [31]</source>
          , pages
          <fpage>1141</fpage>
          {
          <fpage>1142</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>J.</given-names>
            <surname>Teevan</surname>
          </string-name>
          , E. Adar,
          <string-name>
            <given-names>R.</given-names>
            <surname>Jones</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M. A. S.</given-names>
            <surname>Potts</surname>
          </string-name>
          .
          <article-title>Information re-retrieval: repeat queries in yahoo's logs</article-title>
          .
          <source>In Kraaij et al. [19]</source>
          , pages
          <fpage>151</fpage>
          {
          <fpage>158</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          .
          <article-title>Learn from web search logs to organize search results</article-title>
          . In Kraaij et al. [
          <volume>19</volume>
          ], pages
          <fpage>87</fpage>
          {
          <fpage>94</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>R. W.</given-names>
            <surname>White</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. L. A.</given-names>
            <surname>Clarke</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Cucerzan</surname>
          </string-name>
          .
          <article-title>Comparing query logs and pseudo-relevance feedbackfor web-search query re¯nement</article-title>
          . In Kraaij et al. [
          <volume>19</volume>
          ], pages
          <fpage>831</fpage>
          {
          <fpage>832</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>C. L.</given-names>
            <surname>Williamson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. E.</given-names>
            <surname>Zurko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. F.</given-names>
            <surname>Patel-Schneider</surname>
          </string-name>
          , and P. J. Shenoy, editors.
          <source>Proceedings of the 16th International Conference on World Wide Web, WWW</source>
          <year>2007</year>
          , Ban®, Alberta, Canada,
          <year>2007</year>
          . ACM,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          and
          <string-name>
            <given-names>O.</given-names>
            <surname>Nasraoui</surname>
          </string-name>
          .
          <article-title>Mining search engine query logs for query recommendation</article-title>
          .
          <source>In Carr et al. [8]</source>
          , pages
          <fpage>1039</fpage>
          {
          <fpage>1040</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>