<!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>Keynote: Table Retrieval and Generation</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Krisztian Balog University of Stavanger</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Tables are powerful and versatile tools for organizing and presenting data. Tables may be viewed as complex information objects, which summarize existing information in a structured form. Therefore, for many information needs, returning tables as search results may be more helpful to the user than serving a ranked list of items (documents or entities). This talk is centered around utilizing (relational) tables as units of retrieval. We introduce and address the problem of ad hoc table retrieval : answering a keyword query with a ranked list of tables. In another variant of this task, referred to as query-by-table, the input is not a keyword query, but an incomplete table. Tables can be ranked much like documents, by considering the words contained in them. Our main research objective is to move beyond lexical matching and improve table retrieval performance by incorporating semantic matching. We achieve that by representing tables and queries in multiple semantic spaces (employing both discrete sparse and continuous dense vector representations). It may happen that the exact table the user is looking for does not exist. Our third task, termed on-the- y table generation, addresses this very scenario: given a query, generate a relational table that contains relevant entities (as rows) along with their key properties (as columns). This problem is decomposed into three speci c subtasks: (i) core column entity ranking, (ii) schema determination, and (iii) value lookup. We show that the rst two subtasks are not independent of each other and can assist each other in an iterative manner.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Biography
Krisztian Balog is a full professor at the University of Stavanger where he leads the Information Access &amp;
Interaction research group. He received his PhD from the University of Amsterdam, and worked as a postdoc at
the Norwegian University of Science and Technology (NTNU), before joining the University of Stavanger. His
general research interests lie in the use and development of information retrieval, information extraction, and
machine learning techniques for intelligent information access tasks. His current research concerns entity-oriented
and semantic search, and novel evaluation methodologies. He serves as a senior programme committee member
at SIGIR, CIKM and ECIR, as an Associate Editor of the ACM Transactions on Information Systems, and as
a current and former coordinator of information retrieval benchmarking e orts at TREC and CLEF.
Copyright c by the paper's authors. Copying permitted for private and academic purposes.</p>
    </sec>
  </body>
  <back>
    <ref-list />
  </back>
</article>