<!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>Detection for Causality-driven Adhoc Information Retrieval Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Chuan-An Lin</string-name>
          <email>clin134@ucsc.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yi Zhang</string-name>
          <email>yiz@soe.ucsc.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>IRKM Lab, Engineering Building 2, University of California</institution>
          ,
          <addr-line>Santa Cruz, Santa Cruz, CA, 95064</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <fpage>335</fpage>
      <lpage>344</lpage>
      <abstract>
        <p>This is the working note of our participation in the 2020 Causality-driven Adhoc Information Retrieval Task. We aim to retrieve news documents that indicate possible causes of a query event. Our proposed method involves query expansion based on causality relation detection from a primarily retrieved collection. We compare our method with two baselines and analyze the performance of expansion terms on selected topics. Our analysis shows that although the naive causality detection method recognizes some critical terms, precision should be improved to outperform the baselines.</p>
      </abstract>
      <kwd-group>
        <kwd>query expansion</kwd>
        <kwd>causality detection</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Automatic connecting events based on causality relation provides a promising application for</p>
      <sec id="sec-1-1">
        <title>2.1. Pre-event Query Expansion</title>
        <p>The core idea of our method is query expansion based on causality detection. We define a
postevent as the event we want to know about its cause (e.g., Telecom minister A. Raja resignation
), and a pre-event as one possible event that leads to the post-event. Thus, we treat the task as
detecting possible pre-events given the post-event, which is the query, and retrieving documents
Initial Query
Telecom minister A.</p>
        <p>Raja resignation</p>
        <p>Event Term
resignation</p>
        <p>Document</p>
        <p>Set_1</p>
        <sec id="sec-1-1-1">
          <title>Event extraction</title>
        </sec>
        <sec id="sec-1-1-2">
          <title>First retrieval</title>
        </sec>
        <sec id="sec-1-1-3">
          <title>Causal relation detection</title>
          <p>Pre-event Post-event
accusation
scam resignation
……
Query Terms
accusation
scam
……
telecom
minister
A. Raja
Document</p>
          <p>Set_2</p>
        </sec>
        <sec id="sec-1-1-4">
          <title>Query expansion</title>
        </sec>
        <sec id="sec-1-1-5">
          <title>Second retrieval</title>
          <p>that describe the pre-events. To achieve this, we assume that potential pre-events can be found
in the documents that describe the post-event. Once retrieve these kinds of documents, we
can conduct causal relation detection to find potential pre-events and use them to do a second
retrieval to get the final desired documents. We organize our approach’s procedure to 5 steps,
as shown in figure 2.1, and describe them in detail in the following paragraphs.</p>
          <p>Event extraction: The first step is event extraction, in which we extract the syntactic head
word of the sentence (usually the verb) in the query title to represent the post-event. The
intention is to get more information from similar events.</p>
          <p>First retrieval: We use the resulting event term above to retrieve a document collection for
extracting potential pre-events.</p>
          <p>
            Causal relation detection: We implement a simplified version of [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ]. Specifically, we use
causal keywords (‘because’, ‘lead to’, ‘after’) to first recognize “causal sentence” with a causal
relation from the retrieved document collection, then we extract verbs and nouns in the causal
sentence after or before the occurring of the causal keyword depending on which keyword it is.
To estimate the relevance score of the verbs and nouns as pre-events for query expansion, we
simply calculate the frequency of their occurrence in among all the causal sentences.
          </p>
          <p>Query expansion: We use the extracted pre-event terms above to expand the original query
and remove the original event term. We presumably choose the top 5 sorted according to its
frequency mentioned above. Further investigation of the number of terms to use can be explored
in the future.</p>
          <p>Second retrieval: The document set retrieved using the expanded query is our final result.</p>
        </sec>
      </sec>
      <sec id="sec-1-2">
        <title>2.2. Implementation</title>
        <p>
          Following the work of [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], we use Apache Lucene 5.5.5 version to build our retrieval system.
We also use the EnglishAnalyzerWithSmartStopWord class to preprocess the documents as well
        </p>
        <p>Documents retrieved should contain information about the accusations
against A. Raja in the 2G Spectrum scam. Documents that talk about his
criticisms for allocating 4.4MHz of spectrum a scarce resource at the 2001
price of Rs 1,651 crore through a first come, first served policy rather than
auctions; by compromising on the market value of spectrum, the government
is estimated to have lost revenues worth around Rs 50,000 crore; new licensees
are signing equity deals with foreign players in which the value of spectrum
has risen sevenfold, would be considered as relevant.
as the queries. For similarity function, we use LMJelineMercer similarity with the smoothing
parameter set to 0.7. 5 top pre-event terms expanded by our method are used and removed if
the expanded term is identical to the original event term. We retrieve up to 1, 000 documents
for each topic as our final results.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>3. Experiments</title>
      <sec id="sec-2-1">
        <title>3.1. Dataset</title>
        <p>
          The CAIR dataset is a collection of 303,291 Telegraph India news documents from 2001 to 2010
[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. There are 20 query topics for testing in total. Each topic contains two parts: query title and
query narratives. The former is a selected public event that we treat as the post-event, and the
latter is a description of the criteria of relevant documents. Table 1 provides an example topic.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>3.2. Baselines</title>
        <p>We compare our method with two baselines that directly use the query title and query narratives,
respectively, with the same setting. We use title to represent the baseline using query title and
narratives to represent the one using query narratives. We use title-expansion to denote our
method.</p>
      </sec>
      <sec id="sec-2-3">
        <title>3.3. Results</title>
        <p>Table 2 shows the experimental results. We can find that our method has not been competitive
with the two baselines. narratives outperforms the other methods significantly, which is not
surprising as the content of query narratives have already contained the pre-events desired. In
Contrast, the results show that the expanded terms in title-expansion do not help improve
the original query title in the retrieval task. We then provide further analysis in section 4.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>4. Analysis</title>
      <p>We choose 3 topics from the testing set to conduct the analysis. The top terms as potential
pre-events extracted by our model are listed in table 3. For the event term ‘assassination,’
our model efectively extracted terms like ‘attack’ and ‘deathkilled,’ which is of quite a small
portion. Most extracted terms are rather irrelevant. For the event term ‘accused,’ more terms
for possible pre-events are detected (‘court’, ‘police’, ‘case’, ‘arrest’, ‘murder’, etc.) We notice
that the accuracy of our extraction method is afected by the topic property. For the event
‘assassination,’ proper nouns are identified (‘Gandhis,’ ’Musharraf’) as well as other terms like
‘President,’ ‘Minister,’ and ‘government’ that might be too specific for some particular events
that involve assassination. The extracted terms for the post-event ’resignation’ follow a similar
pattern. In contrast, the extracted terms for the ‘accused’ event are rather general and can be
applied to diferent events that involve accusations. We infer that the diference comes from
the frequency of some particular events being reported on the news. For example, If there is a
lot of news that reports the assassination of a particular person, the terms specifically related to
this single event are more likely to be extracted by our model. Overall, the analysis shows that
the extracted terms of our current method contain some useful information yet not accurate
enough and highly depends on the topic.</p>
    </sec>
    <sec id="sec-4">
      <title>5. Conclusion</title>
      <p>In this work, we implement a retrieval model based on query expansion and naive causality
detection to approach the CAIR task. We also compare our model with baselines that only
use query title and query narratives. Experimental results show that our method has not been
able to surpass the baselines. Further analysis of selected topics indicates that the causality
detection method needs to be improved to enhance the extracted terms’ precision. While our
naive approach has not distinguished the causal sentences that are actually relevant to the topic
from the non-relevant ones, possible approaches like embedding method to jointly model the
topic and the causal sentences may be considered in future works to improve the performance.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>This work is supported by the IRKM lab in University of California, Santa Cruz.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>N.</given-names>
            <surname>Asghar</surname>
          </string-name>
          ,
          <article-title>Automatic extraction of causal relations from natural language texts: A comprehensive survey</article-title>
          ,
          <source>CoRR abs/1605</source>
          .07895 (
          <year>2016</year>
          ). URL: http://arxiv.org/abs/1605.07895.
          <article-title>a r X i v : 1 6 0 5 . 0 7 8 9 5</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>R. Pradeep</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Aswathi</surname>
          </string-name>
          ,
          <article-title>Extraction of causality and related events using text analysis</article-title>
          ,
          <source>in: 2019 2nd International Conference on Intelligent Computing, Instrumentation and Control Technologies (ICICICT)</source>
          , volume
          <volume>1</volume>
          ,
          <year>2019</year>
          , pp.
          <fpage>1448</fpage>
          -
          <lpage>1453</lpage>
          .
          <source>doi:1 0 . 1 1</source>
          <volume>0</volume>
          <fpage>9</fpage>
          <string-name>
            <surname>/ I C I C I C T</surname>
          </string-name>
          <article-title>4 6</article-title>
          <volume>0 0 8 . 2 0 1 9 . 8 9 9 3 3 0 2 .</volume>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>E.</given-names>
            <surname>Kıcıman</surname>
          </string-name>
          ,
          <article-title>Causal inference over longitudinal data to support expectation exploration</article-title>
          ,
          <source>in: The 41st International ACM SIGIR Conference on Research Development in Information Retrieval</source>
          , SIGIR '18,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2018</year>
          , p.
          <fpage>1345</fpage>
          . URL: https://doi.org/10.1145/3209978.3210215.
          <source>doi:1 0 . 1 1</source>
          <volume>4 5 / 3 2 0 9 9 7 8 . 3 2 1 0 2 1 5 .</volume>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>K.</given-names>
            <surname>Radinsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Davidovich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Markovitch</surname>
          </string-name>
          ,
          <article-title>Learning causality for news events prediction</article-title>
          ,
          <source>in: Proceedings of the 21st International Conference on World Wide Web, WWW '12</source>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2012</year>
          , p.
          <fpage>909</fpage>
          -
          <lpage>918</lpage>
          . URL: https: //doi.org/10.1145/2187836.2187958.
          <source>doi:1 0 . 1 1</source>
          <volume>4 5 / 2 1 8 7 8 3 6 . 2 1 8 7 9 5 8 .</volume>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Datta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ganguly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Roy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bonin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Jochim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mitra</surname>
          </string-name>
          ,
          <article-title>Retrieving potential causes from a query event</article-title>
          ,
          <source>in: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , SIGIR '20,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2020</year>
          , p.
          <fpage>1689</fpage>
          -
          <lpage>1692</lpage>
          . URL: https://doi.org/10.1145/3397271.3401207.
          <source>doi:1 0 . 1 1</source>
          <volume>4 5 / 3 3 9 7 2 7 1 . 3 4 0 1 2 0 7 .</volume>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Massung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Qin</surname>
          </string-name>
          , T. Liu,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          , Constructing and embedding
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>