<!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>Massive Implicit Feedback: Organizing Search Logs into Topic Maps for Collaborative Sur ng</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Xuanhui Wang</string-name>
          <email>xwang20@illinois.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>ChengXiang Zhai</string-name>
          <email>czhai@illinois.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science University of Illinois at Urbana-Champaign</institution>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2009</year>
      </pub-date>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        Current search engines heavily emphasize on direct
querying which tends to work well only for simple information
needs such as navigational queries. However, direct
querying may not support complex information needs such as
exploratory search well [
        <xref ref-type="bibr" rid="ref11 ref4">4, 11</xref>
        ] since users' interactions are
mainly limited to submitting a query, viewing results, and
reformulating queries [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. As a complementary way of
information seeking with querying, browsing can be very useful
for exploratory search or information foraging [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
Unfortunately, with the current search engines, browsing is mostly
limited to following hyperlinks or navigating through
structures consisting of a xed set of categories or other
metadata available [
        <xref ref-type="bibr" rid="ref2 ref4">4, 2</xref>
        ].
      </p>
      <p>
        We have been developing a new collaborative sur ng
system to enable users to go beyond hyperlinks to browse
exibly for ad hoc information needs. Our main idea is to view
search logs as information footprints left by users in
navigating in the information space and organize these
footprints into a multi-resolution topic map. The map makes
it possible for users to navigate exibly in the information
space by following the footprints left by other users. As
new users use the map for navigation, they leave more
footprints, which can then be used to enrich and re ne the map
dynamically and continuously for the bene t of future users.
Thus, by turning search logs into a topic map, we can
establish a sustainable infrastructure to facilitate users to surf
the information space in a collaborative manner.
Preliminary experiment results show that the topic map is e ective
in helping users to satisfy exploratory information needs [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
In the following, we describe our system in more detail and
discuss its potential impact on understanding users for
improving information seeking.
      </p>
    </sec>
    <sec id="sec-2">
      <title>SYSTEM DESCRIPTION</title>
      <p>Figure 1 shows the interface of our system which is
implemented as a meta-search engine interacting with Google.
The interface has three panes: (1) The top pane is a
querying box, where a user can submit a keyword query. (2) The
left pane shows a portion of a multi-resolution topic map
built based on search logs, where a user can click on a node
to navigate into a topic region. (3) The right pane displays
information corresponding to a topic region, including the
clickthroughs made by previous users when they visit the
topic region and the documents covered by the topic region.</p>
      <p>These three panes allow a user to navigate in the
information space in large, medium, and small steps, respectively.
With the query box on the top, a user can make a long
distance navigation into any topic region (i.e., \large steps");
with the topic map on the left pane, the user can navigate
into related topic regions (i.e., \medium steps"); and with
the display of a topic region in the right pane, the user can
navigate by following hyperlinks (i.e., \small steps"). A user
can take any of these three navigation actions at any time.
Thus our system implements a uni ed information seeking
model where both querying and browsing are viewed as ways
to navigate in the information space.</p>
      <p>Inside the system, when a user submits a query, the
system would display the most relevant part of the topic map
on the left pane and show the search results from Google for
the query. When the user navigates on the map to click on
a node (corresponding to a topic region), the system would
automatically update the right pane to show corresponding
search results using a query constructed based on the node
selected by the user. In general, the right pane is always
synchronized with the left pane to show the documents
corresponding to the current node on the map.</p>
      <p>The topic map promotes browsing and can naturally
support exploratory search. For example, a user who wants to
arrange a house can start with a query \table," zoom into
\dinning table," zoom out to \dinning,", move horizontally
to \kitchen," and further move to \appliance." From \table",
this user can also horizontally move to \chair," to \desk,", or
to \tablecloth." Another example is \wedding." From
\wedding," we can zoom into di erent aspects of wedding such
as \wedding dress,' \wedding vows," etc. We can also
horizontally move to \vacation," \honeymoon," or \hotels." All
these browsing traces can be leveraged to infer users'
underlying information needs and better serve users with complex
exploratory information needs. The browsing logs can be
leveraged to improve the map and further help future users
who have similar information needs.</p>
      <p>
        A main technical challenge in developing this system is to
construct topic maps. Currently, the nodes in topic maps
are valid queries in search logs. All queries with the same
number of keywords belong to the same level. The children
of a map node is obtained by adding a keyword into the
current query and the neighbors of the query is by substituting
a keyword in the current query. All these surrounding nodes
are ranked accordingly. Speci cally, we rely on the term
cooccurrence in search logs to construct such a map and all
the technique details can be found in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>MASSIVE IMPLICIT FEEDBACK</title>
      <p>
        From the viewpoint of understanding users and
exploiting user information to provide better search support, our
system implements a strategy of massive implicit feedback
[
        <xref ref-type="bibr" rid="ref3 ref6 ref7 ref9">3, 7, 6, 9</xref>
        ], where query logs and browsing logs of all users
would be captured and leveraged to provide better support
for future users in both querying and browsing. Indeed, the
implicit feedback information collectable by the system
includes not only the queries and clickthroughs available in a
current search engine but also the browsing traces left by
users in using the map. The system treats all these di erent
kinds of user information uniformly as \information
footprints" left by users and organizes them into a topic map
to deliver bene ts to future users. At the same time, new
users would leave new footprints to allow the system to grow
continuously over time to improve its support for browsing
and querying. Thus, the system enables collaborative
surfing where users help each other through sustained massive
implicit feedback.
      </p>
      <p>We hope our demo can stimulate discussions about many
interesting questions related to the workshop: (1) How should
we evaluate topic maps? (2) How should we evaluate such
an interactive system? (3) How can we formally model a
user based on both query logs and browsing logs? (4) How
can we leverage maps to clarify user interests?</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>N. J.</given-names>
            <surname>Belkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. T.</given-names>
            <surname>Dumais</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Scholtz</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Wilkinson</surname>
          </string-name>
          .
          <article-title>Evaluating interactive information retrieval systems: opportunities and challenges</article-title>
          .
          <source>In CHI Extended Abstracts</source>
          , pages
          <volume>1594</volume>
          {
          <fpage>1595</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Hearst</surname>
          </string-name>
          .
          <article-title>Clustering versus faceted categories for information exploration</article-title>
          .
          <source>Commun. ACM</source>
          ,
          <volume>49</volume>
          (
          <issue>4</issue>
          ):
          <volume>59</volume>
          {
          <fpage>61</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Kelly</surname>
          </string-name>
          and
          <string-name>
            <given-names>N. J.</given-names>
            <surname>Belkin</surname>
          </string-name>
          .
          <article-title>Display time as implicit feedback: understanding task e ects</article-title>
          .
          <source>In Proceedings of ACM SIGIR</source>
          <year>2004</year>
          , pages
          <fpage>377</fpage>
          {
          <fpage>384</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>G.</given-names>
            <surname>Marchionini</surname>
          </string-name>
          .
          <article-title>Exploratory search: from nding to understanding</article-title>
          .
          <source>Commun. ACM</source>
          ,
          <volume>49</volume>
          (
          <issue>4</issue>
          ):
          <volume>41</volume>
          {
          <fpage>46</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>P. L. T.</given-names>
            <surname>Pirolli</surname>
          </string-name>
          .
          <source>Information Foraging Theory: Adaptive Interaction with Information</source>
          . Oxford University Press,
          <year>June 2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>X.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Tan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          .
          <article-title>Implicit user modeling for personalized search</article-title>
          .
          <source>In Proceedings of CIKM 2005</source>
          , pages
          <fpage>824</fpage>
          {
          <fpage>831</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <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>Personalizing search via automated analysis of interests and activities</article-title>
          .
          <source>In Proceedings of ACM SIGIR</source>
          <year>2005</year>
          , pages
          <fpage>449</fpage>
          {
          <fpage>456</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shakery</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          .
          <article-title>Search logs as information footprints: Supporting guided navigation for exploratory search</article-title>
          .
          <source>Technical Report UIUCDCS-R-2008-3001</source>
          , University of Illinois,
          <year>2008</year>
          . https://www.ideals.uiuc.edu/bitstream/handle/2142/ 10971/
          <string-name>
            <surname>UIUCDCS-R-</surname>
          </string-name>
          2008-3001.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <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>
          .
          <source>In Proceedings of SIGIR 2007</source>
          , pages
          <fpage>87</fpage>
          {
          <fpage>94</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <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>Mining term association patterns from search logs for e ective query reformulation</article-title>
          .
          <source>In CIKM</source>
          , pages
          <volume>479</volume>
          {
          <fpage>488</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R. W.</given-names>
            <surname>White</surname>
          </string-name>
          and
          <string-name>
            <given-names>R. A.</given-names>
            <surname>Roth</surname>
          </string-name>
          .
          <article-title>Exploratory Search: Beyond the Query-Response Paradigm</article-title>
          . Morgan and Claypool,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>