<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Search and Recommendation: Birds of a Feather?</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Toine Bogers Department of Communication &amp; Psychology Aalborg University Copenhagen</institution>
          <addr-line>2450 Copenhagen SV</addr-line>
          ,
          <country country="DK">Denmark</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2014</year>
      </pub-date>
      <abstract>
        <p />
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>In just a little over half a century, the field of
information retrieval has experienced spectacular growth and
success, with IR applications such as search engines
becoming a billion-dollar industry in the past decades.
Recommender systems have seen an even more
meteoric rise to success with wide-scale application by
companies like Amazon, Facebook, and Netflix. But
are search and recommendation really two different
fields of research that address different problems with
different sets of algorithms in papers published at
distinct conferences?</p>
      <p>In my talk, I want to argue that search and
recommendation are more similar than they have been
treated in the past decade. By looking more closely at
the tasks and problems that search and
recommendation try to solve, at the algorithms used to solve these
problems and at the way their performance is
evaluated, I want to show that there is no clear black and
white division between the two. Instead, search and
recommendation are part of a much more fluid
continuum of methods and techniques for information
access.</p>
    </sec>
  </body>
  <back>
    <ref-list />
  </back>
</article>